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

Efficient and Optimal Fixed-Time Regret with Two Experts ALT 2022
Universally Consistent Online Learning with Arbitrarily Dependent Responses ALT 2022
Distinguishing Relational Pattern Languages With a Small Number of Short Strings ALT 2022
Metric Entropy Duality and the Sample Complexity of Outcome Indistinguishability ALT 2022
Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability ALT 2022
A Model Selection Approach for Corruption Robust Reinforcement Learning ALT 2022
TensorPlan and the Few Actions Lower Bound for Planning in MDPs under Linear Realizability of Optimal Value Functions ALT 2022
The Fragility of Multi-Treebank Parsing Evaluation COLING 2022
Benchmarking Compositionality with Formal Languages COLING 2022
Tight query complexity bounds for learning graph partitions COLT 2022
Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals COLT 2022
Beyond No Regret: Instance-Dependent PAC Reinforcement Learning COLT 2022
The Implicit Bias of Benign Overfitting COLT 2022
Universal Online Learning with Bounded Loss: Reduction to Binary Classification COLT 2022
Monotone Learning COLT 2022
Policy Optimization for Stochastic Shortest Path COLT 2022
Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise COLT 2022
Universal Online Learning: an Optimistically Universal Learning Rule COLT 2022
Width is Less Important than Depth in ReLU Neural Networks COLT 2022
Computational-Statistical Gap in Reinforcement Learning COLT 2022
An Efficient Minimax Optimal Estimator For Multivariate Convex Regression COLT 2022
Smoothed Online Learning is as Easy as Statistical Learning COLT 2022
Generalization Bounds for Data-Driven Numerical Linear Algebra COLT 2022
Benign Overfitting without Linearity: Neural Network Classifiers Trained by Gradient Descent for Noisy Linear Data COLT 2022
Minimax Regret Optimization for Robust Machine Learning under Distribution Shift COLT 2022