convex optimization

Efficient and Accurate Lp-Norm Multiple Kernel Learning NeurIPS 2009 Efficient Large-Scale Distributed Training of Conditional Maximum Entropy Models NeurIPS 2009 Efficient Recovery of Jointly Sparse Vectors NeurIPS 2009 Information-theoretic lower bounds on the oracle complexity of convex optimization NeurIPS 2009 Learning a Small Mixture of Trees NeurIPS 2009 LQR-trees: Feedback motion planning on sparse randomized trees RSS 2009 On the Algorithmics and Applications of a Mixed-norm based Kernel Learning Formulation NeurIPS 2009 On the Convergence of the Concave-Convex Procedure NeurIPS 2009 Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization NeurIPS 2009 Slow Learners are Fast NeurIPS 2009 Sparse Metric Learning via Smooth Optimization NeurIPS 2009 Speeding up Magnetic Resonance Image Acquisition by Bayesian Multi-Slice Adaptive Compressed Sensing NeurIPS 2009 The P-Norm Push: A Simple Convex Ranking Algorithm that Concentrates at the Top of the List JMLR 2009 A Convex Upper Bound on the Log-Partition Function for Binary Distributions NeurIPS 2008 An Extended Level Method for Efficient Multiple Kernel Learning NeurIPS 2008 Classification with a Reject Option using a Hinge Loss JMLR 2008 Clustered Multi-Task Learning: A Convex Formulation NeurIPS 2008 Estimating Robust Query Models with Convex Optimization NeurIPS 2008 Exact Convex Confidence-Weighted Learning NeurIPS 2008 Fast Rates for Regularized Objectives NeurIPS 2008 Improved Moves for Truncated Convex Models NeurIPS 2008 Mind the Duality Gap: Logarithmic regret algorithms for online optimization NeurIPS 2008 Multi-class Discriminant Kernel Learning via Convex Programming JMLR 2008 Multi-label Multiple Kernel Learning NeurIPS 2008 Multi-stage Convex Relaxation for Learning with Sparse Regularization NeurIPS 2008