← Optimization & Theory
Machine Learning › Optimization & Theory ›

Theory

4950 directly classified papers

Papers per year

Papers

A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers NIPS 2009
Robust Nonparametric Regression with Metric-Space Valued Output NIPS 2009
Statistical Analysis of Semi-Supervised Learning: The Limit of Infinite Unlabelled Data NIPS 2009
Fast, smooth and adaptive regression in metric spaces NIPS 2009
Monte Carlo Sampling for Regret Minimization in Extensive Games NIPS 2009
Information-theoretic lower bounds on the oracle complexity of convex optimization NIPS 2009
Which graphical models are difficult to learn? NIPS 2009
On the Convergence of the Concave-Convex Procedure NIPS 2009
Asymptotic Analysis of MAP Estimation via the Replica Method and Compressed Sensing NIPS 2009
Reconstruction of Sparse Circuits Using Multi-neuronal Excitation (RESCUME) NIPS 2009
Nash Equilibria of Static Prediction Games NIPS 2009
Adaptive False Discovery Rate Control under Independence and Dependence JMLR 2009
Discrete MDL Predicts in Total Variation NIPS 2009
Complexity of Decentralized Control: Special Cases NIPS 2009
Margin-based Ranking and an Equivalence between AdaBoost and RankBoost JMLR 2009
A Bahadur Representation of the Linear Support Vector Machine JMLR 2008
On Relevant Dimensions in Kernel Feature Spaces JMLR 2008
Learning with Consistency between Inductive Functions and Kernels NIPS 2008
A general framework for investigating how far the decoding process in the brain can be simplified NIPS 2008
Consistency of Trace Norm Minimization JMLR 2008
Complete Identification Methods for the Causal Hierarchy JMLR 2008
Rademacher Complexity Bounds for Non-I.I.D. Processes NIPS 2008
Value Function Based Reinforcement Learning in Changing Markovian Environments JMLR 2008
Convergence and Rate of Convergence of a Manifold-Based Dimension Reduction Algorithm NIPS 2008
Resolution Limits of Sparse Coding in High Dimensions NIPS 2008