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
Polynomial Time Inference of a Subclass of Context-Free Transformations1992
Probably Almost Discriminative Learning1992
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, COLT 1992, Pittsburgh, PA, USA, July 27-29, 19921992
Query by Committee1992
Random DFA's Can Be Approximately Learned from Sparse Uniform Examples1992
Robust Trainability of Single Neurons1992
Some Weak Learning Results1992
The Learning Complexity of Smooth Functions of a Single Variable1992
Toward Efficient Agnostic Learning1992
Types of Monotonic Language Learning and Their Characterization1992
Universal Sequential Learning and Decision from Individual Data Sequences1992
A Geometric Approach to Threshold Circuit Complexity1991
A Loss Bound Model for On-Line Stochastic Prediction Strategies1991
Approximation and Estimation Bounds for Artificial Neural Networks1991
Bounded Degree Graph Inference from Walks1991
Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension1991
Calculation of the Learning Curve of Bayes Optimal Classification Algorithm for Learning a Perceptron With Noise1991
Evaluating the Performance of a Simple Inductive Procedure in the Presence of Overfitting Error1991
Fast Identification of Geometric Objects with Membership Queries1991
Improved Learning of AC0 Functions1991
Investigating the Distribution Assumptions in the Pac Learning Model1991
Learning 2µ DNF Formulas and kµ Decision Trees1991
Learning and Generalization.(Abstract)1991
Learning by Smoothing: A Morphological Approach1991
Learning Curves in Large Neural Networks1991
Learning in the Presence of Finitely or Infinitely Many Irrelevant Attributes1991
Learning Monotone DNF with an Incomplete Membership Oracle1991
Learning Monotone kµ DNF Formulas on Product Distributions1991
Learning Probabilistic Read-Once Formulas on Product Distributions1991
Learning Read-Once Formulas over Fields and Extended Bases1991
On Learning Binary Weights for Majority Functions1991
On-Line Learning with an Oblivious Environment and the Power of Randomization1991
On the Complexity of Learning Strings and Sequences1991
On the Complexity of Teaching1991
On the Learnability of Infinitary Regular Sets1991
Polynomial Learnability of Probabilistic Concepts with Respect to the Kullback-Leibler Divergence1991
Polynomial-Time Learning of Very Simple Grammars from Positive Data1991
Probably Almost Bayes Decisions1991
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, COLT 1991, Santa Cruz, California, USA, August 5-7, 19911991
Redundant Noisy Attributes, Attribute Errors, and Linear-Threshold Learning Using Winnow1991
Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract)1991
Simultaneous Learning of Concepts and Simultaneous Estimation of Probabilities1991
The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions1991
The Role of Learning in Autonomous Robots1991
The VC-Dimension vs. the Statistical Capacity for Two Layer Networks with Binary Weights1991
Tracking Drifting Concepts Using Random Examples1991
When Oracles Do Not Help1991
Aggregating Strategies1990
A Learning Criterion for Stochastic Rules1990
A Mechanical Method of Successful Scientific Inquiry1990

« prev Page 49/51 next »