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
2018Learning Single-Index Models in Gaussian Space.Rishabh Dudeja, Daniel Hsu
2018Minimax Bounds on Stochastic Batched Convex Optimization.John C. Duchi, Feng Ruan, Chulhee Yun
2018Fast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms.Ilias Diakonikolas, Jerry Li, Ludwig Schmidt
2018Testing Symmetric Markov Chains From a Single Trajectory.Constantinos Daskalakis, Nishanth Dikkala, Nick Gravin
2018Finite Sample Analysis of Two-Timescale Stochastic Approximation with Applications to Reinforcement Learning.Gal Dalal, Gugan Thoppe, Balzs Szrnyi, Shie Mannor
2018Detecting Correlations with Little Memory and Communication.Yuval Dagan, Ohad Shamir
2018Black-Box Reductions for Parameter-free Online Learning in Banach Spaces.Ashok Cutkosky, Francesco Orabona
2018Exact and Robust Conformal Inference Methods for Predictive Machine Learning with Dependent Data.Victor Chernozhukov, Kaspar Wthrich, Yinchu Zhu
2018Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent.Niangjun Chen, Gautam Goel, Adam Wierman
2018Underdamped Langevin MCMC: A non-asymptotic analysis.Xiang Cheng, Niladri S. Chatterji, Peter L. Bartlett, Michael I. Jordan
2018Incentivizing Exploration by Heterogeneous Users.Bangrui Chen, Peter I. Frazier, David Kempe
2018Nonstochastic Bandits with Composite Anonymous Feedback.Nicol Cesa-Bianchi, Claudio Gentile, Yishay Mansour
2018A General Approach to Multi-Armed Bandits Under Risk Criteria.Asaf B. Cassel, Shie Mannor, Assaf Zeevi
2018Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities.Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart
2018Action-Constrained Markov Decision Processes With Kullback-Leibler Cost.Ana Busic, Sean P. Meyn
2018Conference on Learning Theory 2018: Preface.Sbastien Bubeck, Philippe Rigollet
2018Optimal Single Sample Tests for Structured versus Unstructured Network Data.Guy Bresler, Dheeraj Nagaraj
2018Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure.Matthew S. Brennan, Guy Bresler, Wasim Huleihel
2018Online Variance Reduction for Stochastic Optimization.Zalan Borsos, Andreas Krause, Kfir Y. Levy
2018Active Tolerant Testing.Avrim Blum, Lunjia Hu
2018Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form.Srinadh Bhojanapalli, Nicolas Boumal, Prateek Jain, Praneeth Netrapalli
2018Hardness of Learning Noisy Halfspaces using Polynomial Thresholds.Arnab Bhattacharyya, Suprovat Ghoshal, Rishi Saket
2018A Finite Time Analysis of Temporal Difference Learning With Linear Function Approximation.Jalaj Bhandari, Daniel Russo, Raghav Singal
2018Langevin Monte Carlo and JKO splitting.Espen Bernton
2018Approximation beats concentration? An approximation view on inference with smooth radial kernels.Mikhail Belkin
1,3261,350 of 2,661← PreviousNext →

Comparable venues

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