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
Learning Simple Deterministic Languages1989
Learning Structure from Data: A Survey1989
Learning via Queries to an Oracle1989
On Approximate Truth1989
On Learning from Exercises1989
On the Role of Search for Learning1989
Polynomial Learnability of Semilinear Sets1989
Proceedings of the Second Annual Workshop on Computational Learning Theory, COLT 1989, Santa Cruz, CA, USA, July 31 - August 2, 19891989
Reliable and Useful Learning1989
Space-Bounded Learning and the Vapnik-Chervonenkis Dimension1989
The Light Bulb Problem1989
A General Lower Bound on the Number of Examples Needed for Learning1988
Efficient Unsupervised Learning1988
Equivalence of Models for Polynomial Learnability1988
Inductive Inference: An Abstract Approach1988
Learnability by Fixed Distributions1988
Learning Automata from Ordered Examples1988
Learning Context-Free Grammars from Structural Data in Polynomial Time1988
Learning Decision Trees from Random Examples1988
Learning in Neural Networks1988
Learning in Parallel1988
Learning in Threshold Networks1988
Learning k-DNF with Noise in the Attributes1988
Learning Pattern Languages from a Single Initial Example and from Queries1988
Learning Probabilistic Prediction Functions1988
Learning Programs with an Easy to Calculate Set of Errors1988
Learning Regular Languages From Counterexamples1988
Learning Theories in a Subset of a Polyadic Logic1988
Learning via Queries1988
Learning With Hints1988
Non-Learnable Classes of Boolean Formulae That Are Closer Under Variable Permutation1988
On the Learnability of Finite Automata1988
Predicting {0, 1}-Functions on Randomly Drawn Points1988
Proceedings of the First Annual Workshop on Computational Learning Theory, COLT '88, Cambridge, MA, USA, August 3-5, 19881988
Prudence in Language Learning1988
Results on Learnability and the Vapnick-Chervonenkis Dimension1988
Some Remarks About Space-Complexity of Learning, and Circuit Complexity of Recognizing1988
The Power of Vacillation1988
Transformation of Probabilistic Learning Strategies into Deterministic Learning Strategies1988
Types of Noise in Data for Concept Learning1988

« prev Page 51/51