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
Logistic Regression, AdaBoost and Bregman Distances2000
MadaBoost: A Modification of AdaBoost2000
Model Selection and Error Estimation2000
On the Convergence Rate of Good-Turing Estimators2000
On the Difficulty of Approximately Maximizing Agreements2000
On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries2000
On the Learnability and Design of Output Codes for Multiclass Problems2000
PAC Analogues of Perceptron and Winnow via Boosting the Margin2000
Relative Expected Instantaneous Loss Bounds2000
Sparsity vs. Large Margins for Linear Classifiers2000
Statistical Sufficiency for Classes in Empirical L2 Spaces2000
The Computational Complexity of Densest Region Detection2000
The Minimax Strategy for Gaussian Density Estimation. pp2000
The Precision of Query Points as a Resource for Learning Convex Polytopes with Membership Queries2000
The Role of Critical Sets in Vapnik-Chervonenkis Theory2000
Additive Models, Boosting, and Inference for Generalized Divergences1999
An Adaptive Version of the Boost by Majority Algorithm1999
An Apprentice Learning Model (extended abstract)1999
Approximation Algorithms for Clustering Problems1999
Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation1999
Boosting as Entropy Projection1999
Convergence Analysis of Temporal-Difference Learning Algorithms with Linear Function Approximation1999
Covering Numbers for Support Vector Machines1999
Drifting Games1999
Estimating a Mixture of Two Product Distributions1999
Exact Learning of Unordered Tree Patterns from Queries1999
Extensional Set Learning (extended abstract)1999
Extension of the PAC Framework to Finite and Countable Markov Chains1999
Further Results on the Margin Distribution1999
Individual Sequence Prediction - Upper Bounds and Application for Complexity1999
Learning Fixed-Dimension Linear Thresholds from Fragmented Data1999
Learning Specialist Decision Lists1999
Learning Threshold Functions with Small Weights Using Membership Queries1999
Linear Relations between Square-Loss and Kolmogorov Complexity1999
Microchoice Bounds and Self Bounding Learning Algorithms1999
Minimax Regret Under log Loss for General Classes of Experts1999
More Efficient PAC-Learning of DNF with Membership Queries Under the Uniform Distribution1999
Multiclass Learning, Boosting, and Error-Correcting Codes1999
On a Generalized Notion of Mistake Bounds1999
On Learning in the Presence of Unspecified Attribute Values1999
On PAC Learning Using Winnow, Perceptron, and a Perceptron-like Algorithm1999
On Prediction of Individual Sequences Relative to a Set of Experts in the Presence of Noise1999
On the Intrinsic Complexity of Learning Recursive Functions1999
On Theory Revision with Queries1999
PAC-Bayesian Model Averaging1999
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, COLT 1999, Santa Cruz, CA, USA, July 7-9, 19991999
Regret Bounds for Prediction Problems1999
Reinforcement Learning and Mistake Bounded Algorithms1999
Theoretical Analysis of a Class of Randomized Regularization Methods1999
The Robustness of the p-Norm Algorithms1999

« prev Page 42/51 next »