← Keywords

convex optimization

1320 papers

Explore in graph

Also known as

ACO ADMM CO OCO

Co-occurring keywords

stochastic optimization (1060) convergence rate (606) stochastic gradient descent (1088) gradient descent (1143) online learning (1770) support vector machine (976) matrix completion (356) regret bound (1918) kernel methods (1096) sparse optimization (246)

Papers

Lifted coordinate descent for learning with trace-norm regularization AISTATS 2012
Multi-Task Averaging NIPS 2012
Estimation and Selection via Absolute Penalized Convex Minimization And Its Multistage Adaptive Applications JMLR 2012
High-Rank Matrix Completion AISTATS 2012
Mirror Descent Meets Fixed Share (and feels no regret) NIPS 2012
Structured Learning of Gaussian Graphical Models NIPS 2012
Approximating Semidefinite Programs in Sublinear Time NIPS 2011
Variable Sparsity Kernel Learning JMLR 2011
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NIPS 2011
Penalty Decomposition Methods for Rank Minimization NIPS 2011
Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning NIPS 2011
Matrix Completion for Multi-label Image Classification NIPS 2011
Maximum Margin Multi-Label Structured Prediction NIPS 2011
Convergent Decomposition Solvers for Tree-reweighted Free Energies AISTATS 2011
Improved Loss Bounds For Multiple Kernel Learning AISTATS 2011
Clustered Multi-Task Learning Via Alternating Structure Optimization NIPS 2011
Projection onto A Nonnegative Max-Heap NIPS 2011
Stochastic convex optimization with bandit feedback NIPS 2011
Convex envelopes of complexity controlling penalties: the case against premature envelopment AISTATS 2011
Greedy Algorithms for Structurally Constrained High Dimensional Problems NIPS 2011
Assisting Main Task Learning by Heterogeneous Auxiliary Tasks with Applications to Skin Cancer Screening AISTATS 2011
Information Theoretical Clustering via Semidefinite Programming AISTATS 2011
CAKE: Convex Adaptive Kernel Density Estimation AISTATS 2011
Shaping Level Sets with Submodular Functions NIPS 2011
On the Universality of Online Mirror Descent NIPS 2011