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

Best of many worlds: Robust model selection for online supervised learning AISTATS 2019
Online Learning in Kernelized Markov Decision Processes AISTATS 2019
Active Ranking with Subset-wise Preferences AISTATS 2019
Convergence of Gradient Descent on Separable Data AISTATS 2019
Adaptive Minimax Regret against Smooth Logarithmic Losses over High-Dimensional l1-Balls via Envelope Complexity AISTATS 2019
On Learning Graphs with Edge-Detecting Queries ALT 2019
An Exponential Efron-Stein Inequality for $L_q$ Stable Learning Rules ALT 2019
Improved Generalization Bounds for Robust Learning ALT 2019
Adaptive Exact Learning of Decision Trees from Membership Queries ALT 2019
Hardness of Improper One-Sided Learning of Conjunctions For All Uniformly Falsifiable CSPs ALT 2019
Limit Learning Equivalence Structures ALT 2019
A tight excess risk bound via a unified PAC-Bayesian–Rademacher–Shtarkov–MDL complexity ALT 2019
Sample Compression for Real-Valued Learners ALT 2019
A Sharp Lower Bound for Agnostic Learning with Sample Compression Schemes ALT 2019
Optimal Collusion-Free Teaching ALT 2019
Average-Case Information Complexity of Learning ALT 2019
Minimax Learning of Ergodic Markov Chains ALT 2019
Towards Testing Monotonicity of Distributions Over General Posets COLT 2019
Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes COLT 2019
Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information COLT 2019
Learning Two Layer Rectified Neural Networks in Polynomial Time COLT 2019
Private Center Points and Learning of Halfspaces COLT 2019
Universality of Computational Lower Bounds for Submatrix Detection COLT 2019
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm COLT 2019
On the Computational Power of Online Gradient Descent COLT 2019