conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5,334 papers

Papers per year

17
66
123
466
307
'05
'10
'15
'20
'25

Papers

Open Problem: Recursive Teaching Dimension Versus VC Dimension COLT 2015
Label optimal regret bounds for online local learning COLT 2015
Efficient Learning of Linear Separators under Bounded Noise COLT 2015
Bandit Convex Optimization: \sqrtT Regret in One Dimension COLT 2015
On the Complexity of Learning with Kernels COLT 2015
Learnability of Solutions to Conjunctive Queries: The Full Dichotomy COLT 2015
A PTAS for Agnostically Learning Halfspaces COLT 2015
Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems COLT 2015
Faster Algorithms for Testing under Conditional Sampling COLT 2015
Learning and inference in the presence of corrupted inputs COLT 2015
Variable Selection is Hard COLT 2015
A Chaining Algorithm for Online Nonparametric Regression COLT 2015
Learning the dependence structure of rare events: a non-asymptotic study COLT 2015
Computational Lower Bounds for Community Detection on Random Graphs COLT 2015
Exp-Concavity of Proper Composite Losses COLT 2015
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem COLT 2015
Second-order Quantile Methods for Experts and Combinatorial Games COLT 2015
Bad Universal Priors and Notions of Optimality COLT 2015
Learning with Square Loss: Localization through Offset Rademacher Complexity COLT 2015
Online Density Estimation of Bradley-Terry Models COLT 2015
First-order regret bounds for combinatorial semi-bandits COLT 2015
Norm-Based Capacity Control in Neural Networks COLT 2015
Batched Bandit Problems COLT 2015
Hierarchies of Relaxations for Online Prediction Problems with Evolving Constraints COLT 2015
An Almost Optimal PAC Algorithm COLT 2015