Claudio Gentile

Yishay Mansour

Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Regret Minimization for Branching Experts.

[BibT_eX]

[DOI]

Proceedings of the COLT 2013, 2013

Online Similarity Prediction of Networked Data from Known and Unknown Graphs.

[BibT_eX]

[DOI]

Mark Herbster

Stephen Pasteris

Proceedings of the COLT 2013, 2013

2012

Beyond Logarithmic Bounds in Online Learning.

[BibT_eX]

[DOI]

Francesco Orabona

Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

Selective sampling and active learning from single and multiple teachers.

[BibT_eX]

[DOI]

Ofer Dekel

Karthik Sridharan

J. Mach. Learn. Res., 2012

A Correlation Clustering Approach to Link Classification in Signed Networks.

[BibT_eX]

[DOI]

Proceedings of the COLT 2012, 2012

On Multilabel Classification and Ranking with Partial Feedback.

[BibT_eX]

[DOI]

Francesco Orabona

Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

A Linear Time Active Learning Algorithm for Link Classification.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

2011

Predicting the labels of an unknown graph via adaptive exploration.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Learning noisy linear classifiers via adaptive and selective sampling.

[BibT_eX]

[DOI]

Mach. Learn., 2011

Projected Perspective Reformulations with Applications in Design Problems.

[BibT_eX]

[DOI]

Oper. Res., 2011

Bandits with an Edge

[BibT_eX]

[DOI]

Dotan Di Castro

Shie Mannor

CoRR, 2011

The stable set polytope of claw-free graphs with stability number greater than three.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011

See the Tree Through the Lines: The Shazoo Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

2010

Linear Algorithms for Online Multitask Classification.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2010

The stable set polytope of claw-free graphs with large stability number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Random Spanning Trees and the Prediction of Weighted Graphs.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Machine Learning (ICML-10), 2010

Robust Selective Sampling from Single and Multiple Teachers.

[BibT_eX]

[DOI]

Ofer Dekel

Karthik Sridharan

Proceedings of the COLT 2010, 2010

Active Learning on Trees and Graphs.

[BibT_eX]

[DOI]

Proceedings of the COLT 2010, 2010

2009

A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2009

Gear Composition of Stable Set Polytopes and G-Perfection.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

Robust bounds for classification via selective sampling.

[BibT_eX]

[DOI]

Francesco Orabona

Proceedings of the 26th Annual International Conference on Machine Learning, 2009

Fast and Optimal Prediction on a Labeled Tree.

[BibT_eX]

[DOI]

Proceedings of the COLT 2009, 2009

The k-Gear Composition and the Stable Set Polytope.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Learning Unknown Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008

Improved Risk Tail Bounds for On-Line Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Gear composition and the stable set polytope.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

Guest Editors' Introduction: Special issue on Learning Theory (COLT-2007).

[BibT_eX]

[DOI]

Nader H. Bshouty

Mach. Learn., 2008

Linear Classification and Selective Sampling Under Low Noise Conditions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 21, 2008

An Evaluation of Function Point Counting Based on Measurement-Oriented Models.

[BibT_eX]

[DOI]

Vieri Del Bianco

Luigi Lavazza

Proceedings of the 12th International Conference on Evaluation and Assessment in Software Engineering, 2008

On the Stable Set Polytope of Claw-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

SDP diagonalizations and perspective cuts for a class of nonseparable MIQP.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

Experiments with a hybrid interior point/combinatorial approach for network flow problems.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2007

Tracking the best hyperplane with a simple budget Perceptron.

[BibT_eX]

[DOI]

Mach. Learn., 2007

Prim-based support-graph preconditioners for min-cost flow problems.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2007

On higher-order perceptron algorithms.

[BibT_eX]

[DOI]

Cristian Brotto

Proceedings of the Advances in Neural Information Processing Systems 20, 2007

2006

Mod-2 Cuts Generation Yields the Convex Hull of Bounded Integer Feasible Sets.

[BibT_eX]

[DOI]

Robert Weismantel

SIAM J. Discret. Math., 2006

Perspective cuts for a class of convex 0-1 mixed integer programs.

[BibT_eX]

[DOI]

Math. Program., 2006

Worst-Case Analysis of Selective Sampling for Linear Classification.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2006

Incremental Algorithms for Hierarchical Classification.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2006

Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints.

[BibT_eX]

[DOI]

Oper. Res., 2006

Hierarchical classification: combining Bayes with SVM.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning, 2006

Tracking the Best Hyperplane with a Simple Budget Perceptron.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2005

A Second-Order Perceptron Algorithm.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

2004

On the Generalization Ability of On-Line Learning Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

New Preconditioners for KKT Systems of Network Flow Problems.

[BibT_eX]

[DOI]

SIAM J. Optim., 2004

A Polyhedral Approach for the Staff Rostering Problem.

[BibT_eX]

[DOI]

Giovanni Felici

Manag. Sci., 2004

Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

Incremental Algorithms for Hierarchical Classification.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

Regret Bounds for Hierarchical Classification with Linear-Threshold Functions.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

On the Way to Perfection: Primal Operations for Stable Sets in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Sharpest Cut, 2004

2003

The Robustness of the p-Norm Algorithms.

[BibT_eX]

[DOI]

Mach. Learn., 2003

Guest Editor's Introduction.

[BibT_eX]

[DOI]

Mach. Learn., 2003

Zero-Lifting for Integer Block Structured Problems.

[BibT_eX]

[DOI]

Giovanni Felici

J. Comb. Optim., 2003

Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 16 [Neural Information Processing Systems, 2003

Learning Probabilistic Linear-Threshold Classifiers via Selective Sampling.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory and Kernel Machines, 2003

2002

Adaptive and Self-Confident On-Line Learning Algorithms.

[BibT_eX]

[DOI]

Peter Auer

J. Comput. Syst. Sci., 2002

Kernel Methods for Document Filtering.

[BibT_eX]

[DOI]

Proceedings of The Eleventh Text REtrieval Conference, 2002

Margin-Based Algorithms for Information Filtering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 15 [Neural Information Processing Systems, 2002

A Primal Approach to the Stable Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

A New Approximate Maximal Margin Classification Algorithm.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2001

Improved Lower Bounds for Learning from Noisy Examples: An Information-Theoretic Approach.

[BibT_eX]

[DOI]

David P. Helmbold

Inf. Comput., 2001

2000

P-Sufficient Statistics for PAC Learning k-term-DNF Formulas through Enumeration.

[BibT_eX]

[DOI]

Bruno Apolloni

Theor. Comput. Sci., 2000

Adaptive and Self-Confident On-Line Learning Algorithms.

[BibT_eX]

Peter Auer

Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

1999

The Robustness of the <i>p</i>-Norm Algorithms.

[BibT_eX]

[DOI]

Nick Littlestone

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998

Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory.

[BibT_eX]

[DOI]

Bruno Apolloni

Theor. Comput. Sci., 1998

Max Horn SAT and the minimum cut problem in directed hypergraphs.

[BibT_eX]

[DOI]

Math. Program., 1998

Linear Hinge Loss and Average Margin.

[BibT_eX]

[DOI]