COLT

2,540 papers1,556 directions

Papers by Year

2026 6
2025 177
2024 176
2023 168
2022 153
2021 141
2020 127
2019 126
2018 95
2017 74
2016 68
2015 79
2014 61
2013 51
2012 52
2011 44
2010 49
2009 44
2008 54
2007 50
2006 49
2005 49
2004 47
2003 61
2002 28
2001 19
2000 35
1999 37
1998 33
1997 36
1996 38
1995 57
1994 40
1993 56
1992 49
1991 36
1990 37
1989 27
1988 29

Top Research Directions

Research directions most represented by papers from this venue.

The Statistical Computational Gap in High Dimensions 107
Multi-Agent Learning Under Bandit Feedback 46
Regret Scaling in High Dimensional Online Learning 36
Adapting to Stochastic and Adversarial Environments 34
Bypassing Learning Constraints by Relaxing the Hypothesis Class 31
The Computational Cost of High Precision 31
The Empirical Validation Gap 28
Dynamic Regret Minimization in Non-Stationary Online Learning 27
The Mechanics of Benign Overfitting in High Dimensions 24
Agnostic Learning with Adversarial Label Noise 23
Scaling Bandit Learning to Large Action Spaces 22
Managing Hidden Constant Overhead in Algorithm Design 22
Generalization Bounds for Unbounded Loss Functions 18
Parameter-Free and Scale-Free Online Learning 18
Computational Lower Bounds via Statistical Queries 17

Top Authors

AuthorPapers
Yishay Mansour42
Ilias Diakonikolas34
Nicolò Cesa-Bianchi34
Peter Bartlett34
Alexander Rakhlin32
Ohad Shamir31
Steve Hanneke31
Daniel Kane29
Nathan Srebro27
Robert E. Schapire27
Shay Moran27
Elad Hazan26
Hans U. Simon25
Vitaly Feldman24
Manfred K Warmuth23
Shie Mannor23
Haipeng Luo22
Karthik Sridharan22
Adam Klivans21
Sebastien Bubeck19

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret1994
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 19941994
Rigorous Learning Curve Bounds from Statistical Mechanics1994
The Minimum L-Complexity Algorithm and its Applications to Learning Non-Parametric Rules1994
The Representation of Recursive Languages and Its Impact on the Efficiency of Learning1994
The Strength of Noninclusions for Teams of Finite Learners (Extended Abstract)1994
Acceleration of Learning in Binary Choice Problems1993
A Model of Sequence Extrapolation1993
Amplification of Weak Learning under the Uniform Distribution1993
Asking Questions to Minimize Errors1993
Average Case Analysis of the Clipped Hebb Rule for Nonoverlapping Perception Networks1993
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers1993
Capabilities of fallible FINite Learning1993
Capabilities of Probabilistic Learners with Bounded Mind Changes1993
Choosing a Reliable Hypothesis1993
Conservativeness and Monotonicity for Learning Algorithms1993
Efficient Identification of Regular Expressions from Representative Examples1993
General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts1993
Genetic Algorithms and Machine Learning1993
Keeping the Neural Networks Simple by Minimizing the Description Length of the Weights1993
Language Learning in Dependence on the Space of Hypotheses1993
Learning and Robust Learning of Product Distributions1993
Learning Binary Relations Using Weighted Majority Voting1993
Learning Fallible Finite State Automata1993
Learning from a Population of Hypotheses1993
Learning kµ Decision Trees on the Uniform Distribution1993
Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples1993
Learning Two-Tape Automata from Queries and Counterexamples1993
Learning Unions of Two Rectangles in the Plane with Equivalence Queries1993
Learning with Restricted Focus of Attention1993
Learning µ-branching Programs with Queries1993
Linear Time Deterministic Learning of k-Term DNF1993
Localization vs. Identification of Semi-Algebraic Sets1993
Lower Bounds for PAC Learning with Queries1993
Lower Bounds on the Vapnik-Chervonenkis Dimension of Multi-Layer Threshold Networks1993
Occam's Razor for Functions1993
On Learning Embedded Symmetric Concepts1993
On Learning in the Limit and Non-Uniform (epsilon, delta)-Learning1993
On Learning Multiple Concepts in Parallel1993
On Learning Visual Concepts and DNF Formulae1993
On-Line Learning of Functions of Bounded Variation under Various Sampling Schemes1993
On-Line Learning of Rectangles in Noisy Environments1993
On-Line Learning with Linear Loss Constraints1993
On Polynomial-Time Probably almost Discriminative Learnability1993
On Probably Correct Classification of Concepts1993
On the Average Tractability of Binary Integer Programming and the Curious Transition to Perfect Generalization in Learning Majority Functions1993
On the Complexity of Function Learning1993
On the Impact of Forgetting on Learning Machines1993
On the Power of Polynomial Discriminators and Radial Basis Function Networks1993
On the Power of Sigmoid Neural Networks1993

« prev Page 47/51 next »