← Optimization & Theory
Machine Learning › Optimization & Theory ›

Theory

4950 directly classified papers

Papers per year

Papers

Which graphical models are difficult to learn? NIPS 2009
Discrete MDL Predicts in Total Variation NIPS 2009
Asymptotic Analysis of MAP Estimation via the Replica Method and Compressed Sensing NIPS 2009
Monte Carlo Sampling for Regret Minimization in Extensive Games NIPS 2009
Robust Nonparametric Regression with Metric-Space Valued Output NIPS 2009
On the Convergence of the Concave-Convex Procedure NIPS 2009
Adaptive False Discovery Rate Control under Independence and Dependence JMLR 2009
Reconstruction of Sparse Circuits Using Multi-neuronal Excitation (RESCUME) NIPS 2009
A Fast, Consistent Kernel Two-Sample Test NIPS 2009
Nash Equilibria of Static Prediction Games NIPS 2009
Fast, smooth and adaptive regression in metric spaces NIPS 2009
Information-theoretic lower bounds on the oracle complexity of convex optimization NIPS 2009
Complexity of Decentralized Control: Special Cases NIPS 2009
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers NIPS 2009
Statistical Analysis of Semi-Supervised Learning: The Limit of Infinite Unlabelled Data NIPS 2009
Posterior Consistency of the Silverman g-prior in Bayesian Model Choice NIPS 2008
Value Function Based Reinforcement Learning in Changing Markovian Environments JMLR 2008
High-dimensional support union recovery in multivariate regression NIPS 2008
On the Equivalence of Linear Dimensionality-Reducing Transformations JMLR 2008
Theory of matching pursuit NIPS 2008
On Bootstrapping the ROC Curve NIPS 2008
On the asymptotic equivalence between differential Hebbian and temporal difference learning using a local third factor NIPS 2008
Diffeomorphic Dimensionality Reduction NIPS 2008
Resolution Limits of Sparse Coding in High Dimensions NIPS 2008
Manifold Learning: The Price of Normalization JMLR 2008