Continuous Optimization

SPALS: Fast Alternating Least Squares via Implicit Leverage Scores Sampling NeurIPS 2016 Sparse Support Recovery with Non-smooth Loss Functions NeurIPS 2016 Sparsity and Error Analysis of Empirical Feature-Based Regularization Schemes JMLR 2016 Stacked Attention Networks for Image Question Answering CVPR 2016 Stochastic Optimization for Large-scale Optimal Transport NeurIPS 2016 Structure-Blind Signal Recovery NeurIPS 2016 Structured Matrix Recovery via the Generalized Dantzig Selector NeurIPS 2016 Structure Learning of Partitioned Markov Networks ICML 2016 Sublabel-Accurate Relaxation of Nonconvex Energies CVPR 2016 Sublinear Time Orthogonal Tensor Decomposition NeurIPS 2016 Sub-sampled Newton Methods with Non-uniform Sampling NeurIPS 2016 Subspace Clustering With Priors via Sparse Quadratically Constrained Quadratic Programming CVPR 2016 Tensor Decomposition via Joint Matrix Schur Decomposition ICML 2016 The Next Best Underwater View CVPR 2016 The non-convex Burer-Monteiro approach works on smooth semidefinite programs NeurIPS 2016 The Sound of APALM Clapping: Faster Nonsmooth Nonconvex Optimization with Stochastic Asynchronous PALM NeurIPS 2016 Time and Energy Optimal Path Planning in General Flows RSS 2016 Total Variation Classes Beyond 1d: Minimax Rates, and the Limitations of Linear Smoothers NeurIPS 2016 Towards Faster Rates and Oracle Property for Low-Rank Matrix Estimation ICML 2016 Towards More Efficient SPSD Matrix Approximation and CUR Matrix Decomposition JMLR 2016 Tractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization AISTATS 2016 Trend Filtering on Graphs JMLR 2016 Uncalibrated Photometric Stereo by Stepwise Optimization Using Principal Components of Isotropic BRDFs CVPR 2016 Unwrapping ADMM: Efficient Distributed Computing via Transpose Reduction AISTATS 2016 3D Shape Estimation From 2D Landmarks: A Convex Relaxation Approach CVPR 2015