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
Generalized Notions of Mind Change Complexity1997
Generating all Maximal Independent Sets of Bounded-Degree Hypergraphs1997
Inferring Answers to Queries1997
Information Theory in Probability, Statistics, Learning, and Neural Nets (Abstract)1997
Learning Distributions from Random Walks1997
Learning from Examples with Unspecified Attribute Values (Extended Abstract)1997
Learning Logic Programs by Using the Product Homomorphism Method1997
Learning Markov Chains with Variable Memory Length from Noisy Output1997
Learning Probabilistically Consistent Linear Threshold Functions1997
Learning with Maximum-Entropy Distributions1997
On-line Evaluation and Prediction using Linear Functions1997
On-line Learning and the Metrical Task System Problem1997
On the Complexity of Learning for a Spiking Neuron (Extended Abstract)1997
PAC Adaptive Control of Linear Systems1997
Performance Bounds for Nonlinear Time Series Prediction1997
Proceedings of the Tenth Annual Conference on Computational Learning Theory, COLT 1997, Nashville, Tennessee, USA, July 6-9, 19971997
Resource Bounded Next Value and Explanatory Identification: Learning Automata, Patterns and Polynomials On-Line1997
Some Label Efficient Learning Results1997
Teachers, Learners and Black Boxes1997
The Binary Exponentiated Gradient Algorithm for Learning Linear Functions1997
Universal Portfolios With and Without Transaction Costs1997
A Bayesian/Information Theoretic Model of Bias Learning1996
A Competitive Approach to Game Learning1996
A Data-Dependent Skeleton Estimate for Learning1996
A Framework for Structural Risk Minimisation1996
Analysis of a Simple Learning Algorithm: Learning Foraging Thresholds for Lizards1996
Analysis of Greedy Expert Hiring and an Application to Memory-Based Learning (Extended Abstract)1996
Angluin's Theorem for Indexed Families of r.e. Sets and Applications1996
A Randomized Approximation of the MDL for Stochastic Models with Hidden Variables1996
A Simple Algorithm for Learning O(log n)-Term DNF1996
Attribute-Efficient Learning in Query and Mistake-Bound Models1996
Challenges in Machine Learning for Text Classification1996
Elementary Formal Systems, Intrinsic Complexity, and Procrastination1996
Game Theory, On-Line Prediction and Boosting1996
Graph Learning with a Nearest Neighbor Approach1996
Learning an Optimal Decision Strategy in an Influence Diagram with Latent Variables1996
Learning Branches and Learning to Win Closed Games1996
Learning Changing Concepts by Exploiting the Structure of Change1996
Learning Conjunctions of Two Unate DNF Formulas (Extended Abstract): Computational and Informational Results1996
Learning Curve Bounds for a Markov Decision Process with Undiscounted Rewards1996
Learning of Depth Two Neural Networks with Constant Fan-In at the Hidden Nodes (Extended Abstract)1996
On Bayes Methods for On-Line Boolean Prediction1996
On Learning width Two Branching Programs (Extended Abstract)1996
On-Line Portfolio Selection1996
On Restricted-Focus-of-Attention Learnability of Boolean Functions1996
On the Complexity of Learning from Drifting Distributions1996
PAC Learning Axis-Aligned Rectangles with Respect to Product Distributions from Multiple-Instance Examples1996
PAC Learning Intersections of Halfspaces with Membership Queries (Extended Abstract)1996
PAC-Like Upper Bounds for the Sample Complexity of Leave-one-Out Cross-Validation1996
Predicting a Binary Sequence Almost As Well As the Optimal Biased Coin1996

« prev Page 44/51 next »