Gábor Lugosi

Sandra Zilles

Theor. Comput. Sci., 2011

Minimax Policies for Combinatorial Prediction Games.

[BibT_eX]

[DOI]

Jean-Yves Audibert

Sébastien Bubeck

Proceedings of the COLT 2011, 2011

Mathematical and Computational Foundations of Learning Theory (Dagstuhl Seminar 11291).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2011

2010

On-Line Sequential Bin Packing.

[BibT_eX]

[DOI]

György Ottucsák

J. Mach. Learn. Res., 2010

The Longest Minimum-Weight Path in a Complete Graph.

[BibT_eX]

[DOI]

Louigi Addario-Berry

Nicolas Broutin

Comb. Probab. Comput., 2010

2009

Multiple choice tries and distributed hash tables.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

Online Multi-task Learning with Hard Constraints.

[BibT_eX]

[DOI]

Omiros Papaspiliopoulos

Proceedings of the COLT 2009, 2009

2008

Tracking the Best Quantizer.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

On the Performance of Clustering in Hilbert Spaces.

[BibT_eX]

[DOI]

Gérard Biau

IEEE Trans. Inf. Theory, 2008

Strategies for Prediction Under Imperfect Monitoring.

[BibT_eX]

[DOI]

Shie Mannor

Math. Oper. Res., 2008

Consistency of Random Forests and Other Averaging Classifiers.

[BibT_eX]

[DOI]

Gérard Biau

J. Mach. Learn. Res., 2008

Concentration Inequalities.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007

Introduction to the special issue on COLT 2006.

[BibT_eX]

[DOI]

Avrim Blum

Hans Ulrich Simon

Mach. Learn., 2007

The On-Line Shortest Path Problem Under Partial Monitoring.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2007

Learning correlated equilibria in games with compact sets of strategies.

[BibT_eX]

[DOI]

Games Econ. Behav., 2007

Global Nash convergence of Foster and Young's regret testing.

[BibT_eX]

[DOI]

Fabrizio Germano

Games Econ. Behav., 2007

Sequential prediction under incomplete feedback.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Research and Development, 2007

2006

Regret Minimization Under Partial Monitoring.

[BibT_eX]

[DOI]

Math. Oper. Res., 2006

The Shortest Path Problem in the Bandit Setting.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Prediction, learning, and games.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-0-511-54692-1, 2006

2005

Minimizing regret with label efficient prediction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Internal Regret in On-Line Portfolio Selection.

[BibT_eX]

[DOI]

Mach. Learn., 2005

From Ranking to Classification: A Statistical View.

[BibT_eX]

[DOI]

Stéphan Clémençon

Proceedings of the From Data and Information Analysis to Knowledge Engineering, 2005

Tracking the Best of Many Experts.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

Ranking and Scoring Using Empirical Risk Minimization.

[BibT_eX]

[DOI]

Stéphan Clémençon

Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

Limited-Delay Coding of Individual Sequences with Piecewise Different Behavior.

[BibT_eX]

[DOI]

Proceedings of the 44th IEEE IEEE Conference on Decision and Control and 8th European Control Conference Control, 2005

2004

Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2004

Efficient algorithms and minimax bounds for zero-delay lossy source coding.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

A "Follow the Perturbed Leader"-type Algorithm for Zero-Delay Quantization of Individual Sequence.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

Potential-Based Algorithms in On-Line Prediction and Game Theory.

[BibT_eX]

[DOI]

Mach. Learn., 2003

On the Rate of Convergence of Regularized Boosting Classifiers.

[BibT_eX]

[DOI]

Gilles Blanchard

J. Mach. Learn. Res., 2003

Introduction to Statistical Learning Theory.

[BibT_eX]

[DOI]

Olivier Bousquet

Proceedings of the Advanced Lectures on Machine Learning, 2003

Concentration Inequalities.

[BibT_eX]

[DOI]

Olivier Bousquet

Proceedings of the Advanced Lectures on Machine Learning, 2003

2002

A note on robust hypothesis testing.

[BibT_eX]

[DOI]

László Györfi

IEEE Trans. Inf. Theory, 2002

Model Selection and Error Estimation.

[BibT_eX]

[DOI]

Peter L. Bartlett

Mach. Learn., 2002

Data-dependent margin-based generalization bounds for classification.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2002

A Consistent Strategy for Boosting Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, 2002

2001

A zero-delay sequential scheme for lossy coding of individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

Worst-Case Bounds for the Logarithmic Loss of Predictors.

[BibT_eX]

[DOI]

Mach. Learn., 2001

Data-Dependent Margin-Based Generalization Bounds for Classification.

[BibT_eX]

[DOI]

Balázs Kégl

Proceedings of the Computational Learning Theory, 2001

Potential-Based Algorithms in Online Prediction and Game Theory.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, 2001

Combinatorial methods in density estimation.

[BibT_eX]

Springer series in statistics, Springer, ISBN: 978-0-387-95117-1, 2001

2000

Finite-time lower bounds for the two-armed bandit problem.

[BibT_eX]

[DOI]

Sanjeev R. Kulkarni

IEEE Trans. Autom. Control., 2000

A sharp concentration inequality with applications.

[BibT_eX]

[DOI]

Pascal Massart

Random Struct. Algorithms, 2000

1999

A simple randomized algorithm for sequential prediction of ergodic time series.

[BibT_eX]

[DOI]

László Györfi

Gusztáv Morvai

IEEE Trans. Inf. Theory, 1999

Minimax Regret Under log Loss for General Classes of Experts.

[BibT_eX]

[DOI]

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

1998

Learning Pattern Classification - A Survey.

[BibT_eX]

[DOI]

Sanjeev R. Kulkarni

Santosh S. Venkatesh

IEEE Trans. Inf. Theory, 1998

The Minimax Distortion Redundancy in Empirical Quantizer Design.

[BibT_eX]

[DOI]

Peter L. Bartlett

IEEE Trans. Inf. Theory, 1998

Strong Minimax Lower Bounds for Learning.

[BibT_eX]

[DOI]

András Antos

Mach. Learn., 1998

Scale-sensitive Dimensions and Skeleton Estimates for Classification.

[BibT_eX]

[DOI]

Márta Horváth

Discret. Appl. Math., 1998

On Sequential Prediction of Individual Sequences Relative to a Set of Experts.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

1997

Empirical quantizer design in the presence of source noise or channel noise.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

A Minimax Lower Bound for Empirical Quantizer Design.

[BibT_eX]

[DOI]

Peter L. Bartlett

Proceedings of the Computational Learning Theory, Third European Conference, 1997

1996

Nonparametric estimation and classification using radial basis function nets and empirical risk minimization.

[BibT_eX]

[DOI]

Adam Krzyzak

IEEE Trans. Neural Networks, 1996

Concept learning using complexity regularization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Designing Vector Quantizers in the Presence of Source Noise or Channel Noise.

[BibT_eX]

[DOI]

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

A Data-Dependent Skeleton Estimate for Learning.

[BibT_eX]

[DOI]

Márta Pintér

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

A Probabilistic Theory of Pattern Recognition

[BibT_eX]

[DOI]

László Györfi

Stochastic Modelling and Applied Probability 31, Springer, ISBN: 978-1-4612-0711-5, 1996

1995

Nonparametric estimation via empirical risk minimization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Fixed-rate universal lossy source coding and rates of convergence for memoryless sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Lower bounds in pattern recognition and learning.

[BibT_eX]

[DOI]

Pattern Recognit., 1995

1994

On the posterior-probability estimate of the error rate of nonparametric classification rules.

[BibT_eX]

[DOI]

Miroslaw Pawlak

IEEE Trans. Inf. Theory, 1994

Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

Nonparametric classification using radial basis function nets and empirical risk minimization.

[BibT_eX]

[DOI]

Adam Krzyzak

Proceedings of the 12th IAPR International Conference on Pattern Recognition, 1994

1993

Strong universal consistency of neural network classifiers.

[BibT_eX]

[DOI]

András Faragó

IEEE Trans. Inf. Theory, 1993

Fast Nearest-Neighbor Search in Dissimilarity Spaces.

[BibT_eX]

[DOI]

András Faragó

IEEE Trans. Pattern Anal. Mach. Intell., 1993

Universality and Rates of Convergence in Lossy Source Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1993

1992

Learning with an unreliable teacher.

[BibT_eX]

[DOI]