← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

Cost-sensitive Multiclass Classification Risk Bounds ICML 2013
Regularization of Neural Networks using DropConnect ICML 2013
Consistency versus Realizable H-Consistency for Multiclass Classification ICML 2013
On the difficulty of training recurrent neural networks ICML 2013
Two-Sided Exponential Concentration Bounds for Bayes Error Rate and Shannon Entropy ICML 2013
Activized Learning with Uniform Classification Noise ICML 2013
Regret Minimization for Branching Experts COLT 2013
The Sample-Complexity of General Reinforcement Learning ICML 2013
Learning Theory Analysis for Association Rules and Sequential Event Prediction JMLR 2013
The Rate of Convergence of AdaBoost JMLR 2013
Distribution-Dependent Sample Complexity of Large Margin Learning JMLR 2013
Domain Generalization via Invariant Feature Representation ICML 2013
A Stability-based Validation Procedure for Differentially Private Machine Learning NIPS 2013
Cluster Trees on Manifolds NIPS 2013
Efficient Exploration and Value Function Generalization in Deterministic Systems NIPS 2013
Confidence Intervals and Hypothesis Testing for High-Dimensional Statistical Models NIPS 2013
Learning Kernels Using Local Rademacher Complexity NIPS 2013
Minimax Optimal Algorithms for Unconstrained Linear Optimization NIPS 2013
Generalized Method-of-Moments for Rank Aggregation NIPS 2013
Information-theoretic lower bounds for distributed statistical estimation with communication constraints NIPS 2013
On Flat versus Hierarchical Classification in Large-Scale Taxonomies NIPS 2013
The Fast Convergence of Incremental PCA NIPS 2013
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions NIPS 2013
On the Sample Complexity of Subspace Learning NIPS 2013
PAC-Bayes-Empirical-Bernstein Inequality NIPS 2013