Skip to content

Conference on Learning Theory

COLT

A*

CORE rank

CORE rank (raw)

A*

Fields of research

Machine Learning · Artificial Intelligence

Papers indexed

2,661

1988–2026

Papers per year

1988197 peak2026

COLT papers

2,661 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2013Consistency of Robust Kernel Density Estimators.Robert A. Vandermeulen, Clayton D. Scott
2013PLAL: Cluster-based active learning.Ruth Urner, Sharon Wulff, Shai Ben-David
2013Differentially Private Feature Selection via Stability Arguments, and the Robustness of the Lasso.Abhradeep Thakurta, Adam D. Smith
2013Boosting with the Logistic Loss is Consistent.Matus Telgarsky
2013On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization.Ohad Shamir
2013Open Problem: Adversarial Multiarmed Bandits with Limited Advice.Yevgeny Seldin, Koby Crammer, Peter L. Bartlett
2013Classification with Asymmetric Label Noise: Consistency and Maximal Denoising.Clayton Scott, Gilles Blanchard, Gregory Handy
2013Online Learning with Predictable Sequences.Alexander Rakhlin, Karthik Sridharan
2013Excess risk bounds for multitask learning with trace norm regularization.Massimiliano Pontil, Andreas Maurer
2013Approachability, fast and slow.Vianney Perchet, Shie Mannor
2013Open Problem: Lower bounds for Boosting with Hadamard Matrices.Jiazhong Nie, Manfred K. Warmuth, S. V. N. Vishwanathan, Xinhua Zhang
2013Estimation of Extreme Values and Associated Level Sets of a Regression Function via Selective Sampling.Stanislav Minsker
2013Passive Learning with Target Risk.Mehrdad Mahdavi, Rong Jin
2013Honest Compressions and Their Application to Compression Schemes.Roi Livni, Pierre Simon
2013General Oracle Inequalities for Gibbs Posterior with Application to Ranking.Cheng Li, Wenxin Jiang, Martin A. Tanner
2013Open Problem: Fast Stochastic Exp-Concave Optimization.Tomer Koren
2013Learning a set of directions.Wouter M. Koolen, Jiazhong Nie, Manfred K. Warmuth
2013Information Complexity in Bandit Subset Selection.Emilie Kaufmann, Shivaram Kalyanakrishnan
2013Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching.Daniel M. Kane, Adam R. Klivans, Raghu Meka
2013Sparse Adaptive Dirichlet-Multinomial-like Processes.Marcus Hutter
2013Algorithms and Hardness for Robust Subspace Recovery.Moritz Hardt, Ankur Moitra
2013Competing With Strategies.Wei Han, Alexander Rakhlin, Karthik Sridharan
2013Regret Minimization for Branching Experts.Eyal Gofer, Nicol Cesa-Bianchi, Claudio Gentile, Yishay Mansour
2013Online Similarity Prediction of Networked Data from Known and Unknown Graphs.Claudio Gentile, Mark Herbster, Stephen Pasteris
2013Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees.Vitaly Feldman, Pravesh Kothari, Jan Vondrk
1,6511,675 of 2,661← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.