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
Boosting a Weak Learning Algorithm by Majority1990
Composite Geometric Concepts and Polynomial Predictability1990
Efficient Distribution-Free Learning of Probabilistic Concepts (Abstract)1990
Exact Identification of Circuits Using Fixed Points of Amplification Functions (Abstract)1990
Finite Learning by a "Team"1990
Identifying µ-Formula Decision Trees with Queries1990
Inductive Identification of Pattern Languages Restricted Substitutions1990
Inductive Inference from Positive Data is Powerful1990
Inductive Inference of Minimal Programs1990
Inferring Graphs from Walks1990
Learning by Distances1990
Learning Conjunctions of Horn Clauses (Abstract)1990
Learning DNF Under the Uniform Distribution in Quasi-Polynomial Time1990
Learning Functions of k Terms1990
Learning Integer Lattices1990
Learning Switch Configurations1990
Learning Via Queries in [+, <]1990
Learning Via Queries With Teams and Anomilies1990
On Learning Ring-Sum-Expansions1990
On the Complexity of Learning from Counterexamples and Membership Queries (abstract)1990
On the Complexity of Learning Minimum Time-Bounded Turing Machines1990
On the Computational Complexity of Approximating Distributions by Probabilistic Automata1990
On the Number of Examples and Stages Needed for Learning Decision Trees1990
On the Sample Complexity of Finding Good Search Strategies1990
On the Sample Complexity of PAC-Learning Using Random and Chosen Examples1990
On the Sample Complexity of Weak Learning1990
On Threshold Circuits for Parity (Abstract)1990
Pattern Languages are not Learnable1990
Polynomial Time Algorithms for Learning Neural Nets1990
Proceedings of the Third Annual Workshop on Computational Learning Theory, COLT 1990, University of Rochester, Rochester, NY, USA, August 6-8, 19901990
Robust Separations in Inductive Inference (Abstract)1990
Separating PAC and Mistake-Bound Learning Models Over the Boolean Domain (Abstract)1990
Some Problems of Learning with an Oracle1990
The Learnability of Formal Concepts1990
A Parametrization Scheme for Classifying Models of Learnability1989
A Polynomial-Time Algorithm for Learning k-Variable Pattern Languages from Examples1989
A Statistical Approach to Learning and Generalization in Layered Neural Networks1989
Complexity Issues in Learning by Neural Nets1989
Convergence to Nearly Minimal Size Grammars by Vacillating Learning Machines1989
Elementary Formal System as a Unifying Framework for Language Learning1989
Equivalence Queries and Approximate Fingerprints1989
From On-Line to Batch Learning1989
Identification of Unions of Languages Drawn from an Identifiable Class1989
Induction from the General to the More General1989
Inductive Inference with Bounded Number of Mind Changes1989
Inductive Principles of the Search for Empirical Dependences (Methods Based on Weak Convergence of Probability Measures)1989
Informed Parsimonious Inference of Prototypical Genetic Sequences1989
Learning in the Presence of Inaccurate Information1989
Learning Nested Differences of Intersection-Closed Concept Classes1989
Learning Read-Once Formulas Using Membership Queries1989

« prev Page 50/51 next »