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 Probabilistic Linear-Threshold Classifiers via Selective Sampling2003
Learning Random Log-Depth Decision Trees under the Uniform Distribution2003
Learning with Equivalence Constraints and the Relation to Multiclass Learning2003
Learning with Rigorous Support Vector Machines2003
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem2003
Maximal Margin Classification for Metric Spaces2003
Maximum Margin Algorithms with Boolean Kernels2003
Multiplicative Updates for Large Margin Classifiers2003
On Finding Large Conjunctive Clusters2003
On Graph Kernels: Hardness Results and Efficient Alternatives2003
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms2003
On-Line Learning with Imperfect Monitoring2003
Optimal Rates of Aggregation2003
PAC-MDL Bounds2003
Polynomial Certificates for Propositional Classes2003
Positive Definite Rational Kernels2003
Preference Elicitation and Query Learning2003
Projective DNF Formulae and Their Revision2003
Random Subclass Bounds2003
Reducing Kernel Matrix Diagonal Dominance Using Semi-definite Programming2003
Robust Regression by Boosting the Median2003
Sequence Prediction Based on Monotone Complexity2003
Simplified PAC-Bayesian Margin Bounds2003
Smooth e-Intensive Regression by Loss Symmetrization2003
Sparse Kernel Partial Least Squares Regression2003
Sparse Probability Regression by Label Partitioning2003
Subspace Detection: A Robust Statistics Formulation2003
Tutorial: Learning Topics in Game-Theoretic Decision Making2003
Tutorial: Machine Learning Methods in Natural Language Processing2003
Universal Coding of Zipf Distributions2003
Universal Well-Calibrated Algorithm for On-Line Classification2003
Using a Linear Fit to Determine Monotonicity Directions2003
When Is Small Beautiful?2003
A Consistent Strategy for Boosting Algorithms2002
Agnostic Learning Nonconvex Function Classes2002
A Second-Order Perceptron Algorithm2002
Bounds for the Minimum Disagreement Problem with Applications to Learning Theory2002
Computational Learning Theory, 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002, Proceedings2002
Entropy, Combinatorial Dimensions and Random Averages2002
Exploring Learnability between Exact and PAC2002
Geometric Parameters of Kernel Machines2002
Inferring Deterministic Linear Languages2002
Learning the Internet2002
Learning Tree Languages from Text2002
Localized Rademacher Complexities2002
Maximizing the Margin with Boosting2002
Merging Uniform Inductive Learners2002
Mixability and the Existence of Weak Complexities2002
New Lower Bounds for Statistical Query Learning2002
On the Proper Learning of Axis Parallel Concepts2002

« prev Page 40/51 next »