← Optimization & Theory
Machine Learning › Optimization & Theory ›

Optimization

14207 directly classified papers

Papers per year

Papers

Robust Lasso with missing and grossly corrupted observations NIPS 2011
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NIPS 2011
Algorithms for Hyper-Parameter Optimization NIPS 2011
Analysis and Improvement of Policy Gradient Estimation NIPS 2011
Prismatic Algorithm for Discrete D.C. Programming Problem NIPS 2011
Generalised Coupled Tensor Factorisation NIPS 2011
Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness NIPS 2011
Learning in Hilbert vs. Banach Spaces: A Measure Embedding Viewpoint NIPS 2011
Convergent Fitted Value Iteration with Linear Function Approximation NIPS 2011
Maximum Margin Multi-Label Structured Prediction NIPS 2011
Stochastic convex optimization with bandit feedback NIPS 2011
Matrix Completion for Multi-label Image Classification NIPS 2011
Beating SGD: Learning SVMs in Sublinear Time NIPS 2011
Divide-and-Conquer Matrix Factorization NIPS 2011
Orthogonal Matching Pursuit with Replacement NIPS 2011
Efficient Online Learning via Randomized Rounding NIPS 2011
Learning Sparse Representations of High Dimensional Data on Large Scale Dictionaries NIPS 2011
Budgeted Optimization with Concurrent Stochastic-Duration Experiments NIPS 2011
A Denoising View of Matrix Completion NIPS 2011
RTRMC: A Riemannian trust-region method for low-rank matrix completion NIPS 2011
Neural Reconstruction with Approximate Message Passing (NeuRAMP) NIPS 2011
Trace Lasso: a trace norm regularization for correlated designs NIPS 2011
A concave regularization technique for sparse mixture models NIPS 2011
Approximating Semidefinite Programs in Sublinear Time NIPS 2011
Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation NIPS 2011