Convex Optimization

Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback AISTATS 2011 Information Theoretical Clustering via Semidefinite Programming AISTATS 2011 Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation NeurIPS 2011 Projection onto A Nonnegative Max-Heap NeurIPS 2011 Revisiting MAP Estimation, Message Passing and Perfect Graphs AISTATS 2011 Safe Learning: bridging the gap between Bayes, MDL and statistical learning theory via empirical convexity COLT 2011 Shaping Level Sets with Submodular Functions NeurIPS 2011 Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation NeurIPS 2011 Statistical Performance of Convex Tensor Decomposition NeurIPS 2011 Stochastic convex optimization with bandit feedback NeurIPS 2011 A Family of Penalty Functions for Structured Sparsity NeurIPS 2010 A Primal-Dual Algorithm for Group Sparse Regularization with Overlapping Groups NeurIPS 2010 A Primal-Dual Message-Passing Algorithm for Approximated Large Scale Structured Prediction NeurIPS 2010 Convex Structure Learning in Log-Linear Models: Beyond Pairwise Potentials AISTATS 2010 Distributed Dual Averaging In Networks NeurIPS 2010 Efficient Minimization of Decomposable Submodular Functions NeurIPS 2010 Fast global convergence rates of gradient methods for high-dimensional statistical recovery NeurIPS 2010 Generalized roof duality and bisubmodular functions NeurIPS 2010 Large-Scale Matrix Factorization with Missing Data under Additional Constraints NeurIPS 2010 Lower Bounds on Rate of Convergence of Cutting Plane Methods NeurIPS 2010 Moreau-Yosida Regularization for Grouped Tree Structure Learning NeurIPS 2010 Multiple Kernel Learning and the SMO Algorithm NeurIPS 2010 Network Flow Algorithms for Structured Sparsity NeurIPS 2010 Occlusion Detection and Motion Estimation with Convex Optimization NeurIPS 2010 On the Convexity of Latent Social Network Inference NeurIPS 2010