← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5312 directly classified papers

Papers per year

Papers

Active Learning of Multi-Index Function Models NIPS 2012
Learning optimal spike-based representations NIPS 2012
Relax and Randomize : From Value to Algorithms NIPS 2012
Convergence Rate Analysis of MAP Coordinate Minimization Algorithms NIPS 2012
Generalization Bounds for Domain Adaptation NIPS 2012
Nyström Method vs Random Fourier Features: A Theoretical and Empirical Comparison NIPS 2012
Learning Halfspaces with the Zero-One Loss: Time-Accuracy Tradeoffs NIPS 2012
Learning curves for multi-task Gaussian process regression NIPS 2012
Finite Sample Convergence Rates of Zero-Order Stochastic Optimization Methods NIPS 2012
Query Complexity of Derivative-Free Optimization NIPS 2012
Pointwise Tracking the Optimal Regression Function NIPS 2012
Towards a learning-theoretic analysis of spike-timing dependent plasticity NIPS 2012
Multiclass Learning with Simplex Coding NIPS 2012
Multiclass Learning Approaches: A Theoretical Comparison with Implications NIPS 2012
On Multilabel Classification and Ranking with Partial Feedback NIPS 2012
Learning Valuation Functions COLT 2012
Online Regret Bounds for Undiscounted Continuous Reinforcement Learning NIPS 2012
Generalization Bounds for Online Learning Algorithms with Pairwise Loss Functions COLT 2012
Attribute-Efficient Learning andWeight-Degree Tradeoffs for Polynomial Threshold Functions COLT 2012
Learning Functions of Halfspaces Using Prefix Covers COLT 2012
Computational Bounds on Statistical Query Learning COLT 2012
Classification Calibration Dimension for General Multiclass Losses NIPS 2012
On Estimation and Selection for Topic Models AISTATS 2012
Tight Bounds on Profile Redundancy and Distinguishability NIPS 2012
Learning from Weak Teachers AISTATS 2012