← 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

On the Algorithmics and Applications of a Mixed-norm based Kernel Learning Formulation NIPS 2009
Analysis of SVM with Indefinite Kernels NIPS 2009
Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization NIPS 2009
LQR-trees: Feedback motion planning on sparse randomized trees RSS 2009
Efficient Large-Scale Distributed Training of Conditional Maximum Entropy Models NIPS 2009
Speeding up Magnetic Resonance Image Acquisition by Bayesian Multi-Slice Adaptive Compressed Sensing NIPS 2009
Dual Averaging Method for Regularized Stochastic Learning and Online Optimization NIPS 2009
On the Convergence of the Concave-Convex Procedure NIPS 2009
Convex Relaxation of Mixture Regression with Efficient Algorithms NIPS 2009
Slow Learners are Fast NIPS 2009
Efficient Recovery of Jointly Sparse Vectors NIPS 2009
A General Projection Property for Distribution Families NIPS 2009
The P-Norm Push: A Simple Convex Ranking Algorithm that Concentrates at the Top of the List JMLR 2009
Information-theoretic lower bounds on the oracle complexity of convex optimization NIPS 2009
Accelerated Gradient Methods for Stochastic Optimization and Online Learning NIPS 2009
A Convex Upper Bound on the Log-Partition Function for Binary Distributions NIPS 2008
Multi-stage Convex Relaxation for Learning with Sparse Regularization NIPS 2008
Supervised Exponential Family Principal Component Analysis via Convex Optimization NIPS 2008
Robust Regression and Lasso NIPS 2008
PSDBoost: Matrix-Generation Linear Programming for Positive Semidefinite Matrices Learning NIPS 2008
Exact Convex Confidence-Weighted Learning NIPS 2008
Classification with a Reject Option using a Hinge Loss JMLR 2008
Tighter Bounds for Structured Estimation NIPS 2008
Sparse Online Learning via Truncated Gradient NIPS 2008
Reconciling Real Scores with Binary Comparisons: A New Logistic Based Model for Ranking NIPS 2008