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 Optimal Capacity of Binary Neural Networks: Rigorous Combinatorial Approaches1995
Piecemeal Graph Exploration by a Mobile Robot (Extended Abstract)1995
Predicting Nearly as Well as the Best Pruning of a Decision Tree1995
Predictive Hebbian Learning1995
Proceedings of the Eigth Annual Conference on Computational Learning Theory, COLT 1995, Santa Cruz, California, USA, July 5-8, 19951995
Proper Learning Algorithm for Functions of k Terms Under Smooth Distributions1995
Randomized Approximate Aggregating Strategies and Their Applications to Prediction and Discrimination1995
Rationality1995
Reducing the Number of Queries in Self-Directed Learning1995
Reductions for Learning via Queries1995
Regression NSS: An Alternative to Cross Validation1995
Sample Sizes for Sigmoidal Neural Networks1995
Sequential PAC Learning1995
Simple Learning Algorithms Using Divide and Conquer1995
Specification and Simulation of Statistical Query Algorithms for Efficiency and Noise Tolerance1995
The Perceptron Algorithm vs. Winnow: Linear vs. Logarithmic Mistake Bounds when few Input Variables are Relevant1995
An Optimal-Control Application of Two Paradigms of On-Line Learning1994
An Optimal Parallel Algorithm for Learning DFA1994
Approximate Methods for Sequential Decision Making Using Expert Advice1994
A Statistical Approach to Decision Tree Modeling1994
Bayesian Inductive Logic Programming1994
CLASSIC Learning1994
Co-Learning of Total Recursive Functions1994
Efficient Agnostic PAC-Learning with Simple Hypothesis1994
Efficient Learning of Continuous Neural Networks1994
Efficient Reinforcement Learning1994
Exploiting Random Walks for Learning1994
Fat-Shattering and the Learnability of Real-Valued Functions1994
Frequencies vs Biases: Machine Learning Problems in Natural Language Processing (Extended Abstract)1994
Generalization in Partially Connected Layered Neural Networks1994
Geometrical Concept Learning and Convex Polytopes1994
Inclusion Problems in Parallel Learning and Games (Extended Abstract)1994
Inference and Minimization of Hidden Markov Chains1994
Learning from a Consistently Ignorant Teacher1994
Learning Linear Threshold Functions in the Presence of Classification Noise1994
Learning Monotone Log-Term DNF Formulas1994
Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise1994
Learning Probabilistic Automata with Variable Memory Length1994
Learning Structurally Reversible Context-Free Grammars from Queries and Counterexamples in Polynomial Time1994
Learning Unions of Boxes with Membership and Equivalence Queries1994
Learning with Malicious Membership Queries and Exceptions (Extended Abstract)1994
Learning with Queries but Incomplete Information (Extended Abstract)1994
Lower Bounds on the VC-Dimension of Smoothly Parametrized Function Classes1994
On a Learnability Question Associated to Neural Networks with Continuous Activations (Extended Abstract)1994
On Learning Arithmetic Read-Once Formulas with Exponentiation (Extended Abstract)1994
On Learning Counting Functions with Queries1994
On Learning Read-k-Satisfy-j DNF1994
On the Intrinsic Complexity of Language Identification1994
On the Limits of Proper Learnability of Subclasses of DNF Formulas1994
Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract)1994

« prev Page 46/51 next »