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

Combinatorial Pure Exploration of Multi-Armed Bandits NIPS 2014
Online Decision-Making in General Combinatorial Spaces NIPS 2014
Learning Shuffle Ideals Under Restricted Distributions NIPS 2014
Minimax-optimal Inference from Partial Rankings NIPS 2014
Bounded Regret for Finite-Armed Structured Bandits NIPS 2014
Optimistic Planning in Markov Decision Processes Using a Generative Model NIPS 2014
Best-Arm Identification in Linear Bandits NIPS 2014
On the Number of Linear Regions of Deep Neural Networks NIPS 2014
Analysis of Empirical MAP and Empirical Partially Bayes: Can They be Alternatives to Variational Bayes? AISTATS 2014
Improved Bounds for Online Learning Over the Permutahedron and Other Ranking Polytopes AISTATS 2014
Information-Theoretic Characterization of Sparse Recovery AISTATS 2014
A New Perspective on Learning Linear Separators with Large L_qL_p Margins AISTATS 2014
PAC-Bayesian Theory for Transductive Learning AISTATS 2014
Non-Asymptotic Analysis of Relational Learning with One Network AISTATS 2014
Optimality of Thompson Sampling for Gaussian Bandits Depends on Priors AISTATS 2014
Tight Bounds for the Expected Risk of Linear Classifiers and PAC-Bayes Finite-Sample Guarantees AISTATS 2014
A Finite-Sample Generalization Bound for Semiparametric Regression: Partially Linear Models AISTATS 2014
Low-Rank Spectral Learning AISTATS 2014
PAC-Bayesian Collective Stability AISTATS 2014
Selective Sampling with Drift AISTATS 2014
An Analysis of Active Learning with Uniform Feature Noise AISTATS 2014
Open Problem: The Statistical Query Complexity of Learning Sparse Halfspaces COLT 2014
Open Problem: Online Local Learning COLT 2014
Open Problem: Efficient Online Sparse Regression COLT 2014
Distribution-independent Reliable Learning COLT 2014