Optimization

An Exact Algorithm for F-Measure Maximization NeurIPS 2011 Approximating Semidefinite Programs in Sublinear Time NeurIPS 2011 A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011 A Simpler Approach to Matrix Completion JMLR 2011 Better Mini-Batch Algorithms via Accelerated Gradient Methods NeurIPS 2011 Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts NeurIPS 2011 Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization COLT 2011 Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NeurIPS 2011 Convergent Decomposition Solvers for Tree-reweighted Free Energies AISTATS 2011 Efficient Methods for Overlapping Group Lasso NeurIPS 2011 Efficient Offline Communication Policies for Factored Multiagent POMDPs NeurIPS 2011 Energetically Optimal Action Potentials NeurIPS 2011 Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation NeurIPS 2011 Load Balancing for Mobility-on-Demand Systems RSS 2011 Nearest Neighbor based Greedy Coordinate Descent NeurIPS 2011 On the Universality of Online Mirror Descent NeurIPS 2011 Penalty Decomposition Methods for Rank Minimization NeurIPS 2011 Predicting Dynamic Difficulty NeurIPS 2011 Projection onto A Nonnegative Max-Heap NeurIPS 2011 Quasi-Newton Methods for Markov Chain Monte Carlo NeurIPS 2011 RTRMC: A Riemannian trust-region method for low-rank matrix completion NeurIPS 2011 Signal Estimation Under Random Time-Warpings and Nonlinear Signal Alignment NeurIPS 2011 Structure Learning for Optimization NeurIPS 2011 Variance Penalizing AdaBoost NeurIPS 2011 Basis Construction from Power Series Expansions of Value Functions NeurIPS 2010