← Optimization & Theory
Machine Learning › Optimization & Theory ›

Theory

4950 directly classified papers

Papers per year

Papers

Dimension-free Concentration Bounds on Hankel Matrices for Spectral Learning ICML 2014
Nonnegative Sparse PCA with Provable Guarantees ICML 2014
The Complexity of Learning Halfspaces using Generalized Linear Methods COLT 2014
Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians COLT 2014
Simple MAP Inference via Low-Rank Relaxations NIPS 2014
A Residual Bootstrap for High-Dimensional Regression with Near Low-Rank Designs NIPS 2014
Optimal decision-making with time-varying evidence reliability NIPS 2014
Computational Limits for Matrix Completion COLT 2014
Algebraic Reconstruction Bounds and Explicit Inversion for Phase Retrieval at the Identifiability Threshold AISTATS 2014
On Projective Reconstruction In Arbitrary Dimensions CVPR 2014
Approximate Policy Iteration Schemes: A Comparison ICML 2014
Deterministic Symmetric Positive Semidefinite Matrix Completion NIPS 2014
Optimal rates for k-NN density and mode estimation NIPS 2014
From Stochastic Mixability to Fast Rates NIPS 2014
Learning on graphs using Orthonormal Representation is Statistically Consistent NIPS 2014
Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation NIPS 2014
Sparse Polynomial Learning and Graph Sketching NIPS 2014
Spectral Methods for Supervised Topic Models NIPS 2014
High-Dimensional Learning of Linear Causal Networks via Inverse Covariance Estimation JMLR 2014
Spectral Learning of Latent-Variable PCFGs: Algorithms and Sample Complexity JMLR 2014
On Decomposing the Proximal Map NIPS 2013
Uncertainty-Driven Efficiently-Sampled Sparse Graphical Models for Concurrent Tumor Segmentation and Atlas Registration ICCV 2013
Generalized Method-of-Moments for Rank Aggregation NIPS 2013
Estimation, Optimization, and Parallelism when Data is Sparse NIPS 2013
Exploiting Urban Scenes for Vision-aided Inertial Navigation RSS 2013