← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

Passive Learning with Target Risk COLT 2013
Active and passive learning of linear separators under log-concave distributions COLT 2013
Learning Using Local Membership Queries COLT 2013
Sparse Adaptive Dirichlet-Multinomial-like Processes COLT 2013
Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching COLT 2013
Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees COLT 2013
Efficient Learning of Simplices COLT 2013
Complexity Theoretic Lower Bounds for Sparse Principal Component Detection COLT 2013
A Spectral Learning Approach to Range-Only SLAM ICML 2013
Near-optimal Batch Mode Active Learning and Adaptive Submodular Optimization ICML 2013
Optimal rates for stochastic convex optimization under Tsybakov noise condition ICML 2013
Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs ICML 2013
Dynamical Models and tracking regret in online convex programming ICML 2013
On the Generalization Ability of Online Learning Algorithms for Pairwise Loss Functions ICML 2013
Sharp Generalization Error Bounds for Randomly-projected Classifiers ICML 2013
Collective Stability in Structured Prediction: Generalization from One Example ICML 2013
Stability and Hypothesis Transfer Learning ICML 2013
The lasso, persistence, and cross-validation ICML 2013
Exploiting Ontology Structures and Unlabeled Data for Learning ICML 2013
Almost Optimal Exploration in Multi-Armed Bandits ICML 2013
Online Learning under Delayed Feedback ICML 2013
Moment-based Uniform Deviation Bounds for $k$-means and Friends NIPS 2013
Analyzing the Harmonic Structure in Graph-Based Learning NIPS 2013
On the Representational Efficiency of Restricted Boltzmann Machines NIPS 2013
Matrix factorization with binary components NIPS 2013