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
On the Query Complexity of Learning1993
On the Structure of Degrees of Inferability1993
Parameterized Learning Complexity1993
Piecemeal Learning of an Unknown Environment1993
Polynomial Learnability of Linear Threshold Approximations1993
Probability is More Powerful Than Team for Language Identification from Positive Data1993
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, COLT 1993, Santa Cruz, CA, USA, July 26-28, 19931993
Rate of Approximation Results Motivated by Robust Neural Network Learning1993
Statistical Queries and Faulty PAC Oracles1993
Teaching a Smart Learner1993
The "lob-pass" Problem and an On-line Learning Model of Rational Choice1993
Worst-Case Quadratic Loss Bounds for a Generalization of the Widrow-Hoff Rule1993
Absolute Error Bounds for Learning Linear Functions Online1992
A Computational Model of Teaching1992
An Improved Boosting Algorithm and Its Implications on Learning Complexity1992
A Noise Model on Learning Sets of Strings1992
An O(n) Learning Algorithm for DNF Under the Uniform Distribution.log log n1992
Approximate Testing and Learnability1992
A Technique for Upper Bounding the Spectral Norm with Applications to Learning1992
A Theory for Memory-Based Learning1992
A Training Algorithm for Optimal Margin Classifiers1992
Bellman Strikes Again! The Growth Rate of Sample Complexity with Dimension for the Nearest Neighbor Classifier1992
Breaking the Probability 1/2 Barrier in FIN-Type Learning1992
Case-Based Learning in Inductive Inference1992
Characterizations of Learnability for Classes of {O, ..., n}-Valued Functions1992
Corrigendum to Types of Noise in Data for Concept Learning1992
Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution1992
Degrees of Inferability1992
Dominating Distributions and Learnability1992
Exact Learning of Read-k Disjoint DNF and Not-So-Disjoint DNF1992
Generalization versus Classification1992
Language Learning from Stochastic Input1992
Learnability of Description Logics1992
Learning Boolean Read-Once Formulas with Arbitrary Symmetric and Constant Fan-in Gates1992
Learning DNF Formulae Under Classes of Probability Distributions1992
Learning Hierarchical Rule Sets1992
Learning k-Term DNF Formulas with an Incomplete Membership Oracle1992
Learning Stochastic Functions by Smooth Simultaneous Estimation1992
Learning Switching Concepts1992
Learning With a Slowly Changing Distribution1992
On Exact Specification by Examples1992
On Learning Limiting Programs1992
On Learning Noisy Threshold Functions with Finite Precision Weights1992
On-line Learning of Rectangles1992
On the Computational Power of Neural Nets1992
On the Role of Procrastination for Machine Learning1992
PAB-Decisions for Boolean and Real-Valued Features1992
PAC-Learnability of Determinate Logic Programs1992
PAC Learning With Generalized Samples and an Application to Stochastic Geometry1992
Polynomial Iniform Convergence and Polynomial-Sample Learnability1992

« prev Page 48/51 next »