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

Moment-based Uniform Deviation Bounds for $k$-means and Friends NIPS 2013
PAC-Bayes-Empirical-Bernstein Inequality NIPS 2013
Confidence Intervals and Hypothesis Testing for High-Dimensional Statistical Models NIPS 2013
Efficient Exploration and Value Function Generalization in Deterministic Systems NIPS 2013
On the Sample Complexity of Subspace Learning NIPS 2013
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions NIPS 2013
The Fast Convergence of Incremental PCA NIPS 2013
On Flat versus Hierarchical Classification in Large-Scale Taxonomies NIPS 2013
Cluster Trees on Manifolds NIPS 2013
Information-theoretic lower bounds for distributed statistical estimation with communication constraints NIPS 2013
Generalized Method-of-Moments for Rank Aggregation NIPS 2013
Minimax Optimal Algorithms for Unconstrained Linear Optimization NIPS 2013
A Stability-based Validation Procedure for Differentially Private Machine Learning NIPS 2013
Learning Kernels Using Local Rademacher Complexity NIPS 2013
Achievability of Asymptotic Minimax Regret in Online and Batch Prediction ACML 2013
Exact Learning of Bounded Tree-width Bayesian Networks AISTATS 2013
Competing with an Infinite Set of Models in Reinforcement Learning AISTATS 2013
Distribution-Free Distribution Regression AISTATS 2013
Localization and Adaptation in Online Learning AISTATS 2013
On the Asymptotic Optimality of Maximum Margin Bayesian Networks AISTATS 2013
Open Problem: Adversarial Multiarmed Bandits with Limited Advice COLT 2013
On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization COLT 2013
Excess risk bounds for multitask learning with trace norm regularization COLT 2013
Honest Compressions and Their Application to Compression Schemes COLT 2013
Passive Learning with Target Risk COLT 2013