← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

Learning Trees from Strings: A Strong Learning Algorithm for some Context-Free Grammars JMLR 2013
Distributions of Angles in Random Packing on Spheres JMLR 2013
Sparsity-Based Generalization Bounds for Predictive Sparse Coding ICML 2013
Using More Data to Speed-up Training Time AISTATS 2012
Beyond Logarithmic Bounds in Online Learning AISTATS 2012
Random Feature Maps for Dot Product Kernels AISTATS 2012
Deterministic Annealing for Semi-Supervised Structured Output Learning AISTATS 2012
A Geometric Approach to Sample Compression JMLR 2012
Density Propagation and Improved Bounds on the Partition Function NIPS 2012
Tight Bounds on Proper Equivalence Query Learning of DNF COLT 2012
New Bounds for Learning Intervals with Implications for Semi-Supervised Learning COLT 2012
Distributed Learning, Communication Complexity and Privacy COLT 2012
Robust Interactive Learning COLT 2012
Learning DNF Expressions from Fourier Spectrum COLT 2012
Volume Regularization for Binary Classification NIPS 2012
Selective Labeling via Error Bound Minimization NIPS 2012
Identifiability and Unmixing of Latent Parse Trees NIPS 2012
On the (Non-)existence of Convex, Calibrated Surrogate Losses for Ranking NIPS 2012
Mixability in Statistical Learning NIPS 2012
Dimensionality Dependent PAC-Bayes Margin Bound NIPS 2012
On the Sample Complexity of Robust PCA NIPS 2012
Non-parametric Approximate Dynamic Programming via the Kernel Method NIPS 2012
Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence NIPS 2012
Learning Multiple Tasks using Shared Hypotheses NIPS 2012
Exploration in Model-based Reinforcement Learning by Empirically Estimating Learning Progress NIPS 2012