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
Uniform-Distribution Attribute Noise Learnability1999
Viewing all Models as "Probabilistic"1999
Aspects of Complexity of Conservative Probabilistic Learning1998
Birds Can Fly1998
Combining Labeled and Unlabeled Data with Co-Training1998
Cross-Validation for Binary Classification by Real-Valued Functions: Theoretical Analysis1998
Efficient Learning of Monotone Concepts via Quadratic Optimization1998
Exact Learning of Tree Patterns from Queries and Counterexamples1998
Improved Boosting Algorithms using Confidence-Rated Predictions1998
Improved Lower Bounds for Learning from Noisy Examples: An Information-Theoretic Approach1998
Large Margin Classification Using the Perceptron Algorithm1998
Learnability of a Subclass of Extended Pattern Languages1998
Learning Agents for Uncertain Environments (Extended Abstract)1998
Learning Atomic Formulas with Prescribed Properties1998
Learning First Order Universal Horn Expressions1998
Learning One-Variable Pattern Languages in Linear Average Time1998
Learning to Communicate via Unknown Channel (Abstract)1998
Minimax Relative Loss Analysis for Sequential Prediction Algorithms Using Parametric Hypotheses1998
Neural Networks and Efficient Associative Memory1998
On Sequential Prediction of Individual Sequences Relative to a Set of Experts1998
On the Power of Learning Robustly1998
On the Sample Complexity of Learning Functions with Bounded Variation1998
Polylogarithmic-Overhead Piecemeal Graph Exploration1998
Proceedings of the Eleventh Annual Conference on Computational Learning Theory, COLT 1998, Madison, Wisconsin, USA, July 24-26, 19981998
Projection Learning1998
Robust Learning Aided by Context1998
Sample Complexity of Model-Based Search1998
Self Bounding Learning Algorithms1998
Some PAC-Bayesian Theorems1998
Structural Results about Exact Learning with Unspecified Attribute Values1998
Testing Problems with Sub-Learning Sample Complexity1998
The complexity of learning according to two models of a drifting environment1998
The Query Complexity of Finding Local Minima in the Lattice1998
Tracking the Best Regressor1998
Universal Portfolio Selection1998
A Brief Look at Some Machine Learning Problems in Genomics1997
A Dichotomy Theorem for Learning Quantified Boolean Formulas1997
Agnostic Learning of Geometric Patterns (Extended Abstract)1997
Algorithmic Stability and Sanity-Check Bounds for Leave-one-Out Cross-Validation1997
Analysis of Two Gradient-based Algorithms for On-line Regression1997
An Efficient Extension to Mixture Techniques for Prediction and Decision Trees1997
A PAC Analysis of a Bayesian Estimator1997
Asymmetric Team Learning1997
Computational Sample Complexity1997
Dense Shattering and Teaching Dimensions for Differentiable Families (Extended Abstract)1997
Derandomizing Stochastic Prediction Strategies1997
Distributed Cooperative Bayesian Learning Strategies1997
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach1997
FINite Learning Capabilities and Their Limits1997
General Convergence Results for Linear Discriminant Updates1997

« prev Page 43/51 next »