Skip to content

Conference on Learning Theory

COLT

A*

CORE rank

CORE rank (raw)

A*

Fields of research

Machine Learning · Artificial Intelligence

Papers indexed

2,661

1988–2026

Papers per year

1988197 peak2026

COLT papers

2,661 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
1999More Efficient PAC-Learning of DNF with Membership Queries Under the Uniform Distribution.Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
1999Uniform-Distribution Attribute Noise Learnability.Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
1999Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation.Avrim Blum, Adam Kalai, John Langford
1999Exact Learning of Unordered Tree Patterns from Queries.Thomas R. Amoth, Paul Cull, Prasad Tadepalli
1999Individual Sequence Prediction - Upper Bounds and Application for Complexity.Chamy Allenberg
1999Learning Threshold Functions with Small Weights Using Membership Queries.Elias Abboud, Nader Agha, Nader H. Bshouty, Nizar Radwan, Fathi Saleh
1998Minimax Relative Loss Analysis for Sequential Prediction Algorithms Using Parametric Hypotheses.Kenji Yamanishi
1998Universal Portfolio Selection.V. G. Vovk, Chris Watkins
1998Projection Learning.Leslie G. Valiant
1998Learning Atomic Formulas with Prescribed Properties.Irene Tsapara, Gyrgy Turn
1998Improved Boosting Algorithms using Confidence-Rated Predictions.Robert E. Schapire, Yoram Singer
1998Learning Agents for Uncertain Environments (Extended Abstract).Stuart Russell
1998Sample Complexity of Model-Based Search.Christopher D. Rosin
1998Learning One-Variable Pattern Languages in Linear Average Time.Rdiger Reischuk, Thomas Zeugmann
1998Birds Can Fly.Jochen Nessel
1998Learnability of a Subclass of Extended Pattern Languages.Andrew R. Mitchell
1998Neural Networks and Efficient Associative Memory.Matthias Miltrup, Georg Schnitger
1998Aspects of Complexity of Conservative Probabilistic Learning.La Meyer
1998Some PAC-Bayesian Theorems.David A. McAllester
1998On the Sample Complexity of Learning Functions with Bounded Variation.Philip M. Long
1998The complexity of learning according to two models of a drifting environment.Philip M. Long
1998Learning First Order Universal Horn Expressions.Roni Khardon
1998Testing Problems with Sub-Learning Sample Complexity.Michael J. Kearns, Dana Ron
1998On the Power of Learning Robustly.Sanjay Jain, Carl H. Smith, Rolf Wiehagen
1998Tracking the Best Regressor.Mark Herbster, Manfred K. Warmuth
2,2262,250 of 2,661← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.