Continuous Optimization

FFTLasso: Large-Scale LASSO in the Fourier Domain CVPR 2017 Filter Flow Made Practical: Massively Parallel and Lock-Free CVPR 2017 Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data NeurIPS 2017 Frame-based Data Factorizations ICML 2017 Fundamental Conditions for Low-CP-Rank Tensor Completion JMLR 2017 Gap Safe Screening Rules for Sparsity Enforcing Penalties JMLR 2017 Generalized Conditional Gradient for Sparse Estimation JMLR 2017 Generalized Linear Model Regression under Distance-to-set Penalties NeurIPS 2017 Geodesic Distance Descriptors CVPR 2017 Geometric Descent Method for Convex Composite Minimization NeurIPS 2017 Geometry of 3D Environments and Sum of Squares Polynomials RSS 2017 Global Convergence of Non-Convex Gradient Descent for Computing Matrix Squareroot AISTATS 2017 Gradient Descent Can Take Exponential Time to Escape Saddle Points NeurIPS 2017 Gradient Methods for Submodular Maximization NeurIPS 2017 Gradient Projection Iterative Sketch for Large-Scale Constrained Least-Squares ICML 2017 Graph Matching via Multiplicative Update Algorithm NeurIPS 2017 Grassmannian Manifold Optimization Assisted Sparse Spectral Clustering CVPR 2017 Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees NeurIPS 2017 Greedy Direction Method of Multiplier for MAP Inference of Large Output Domain AISTATS 2017 Group Sparse Optimization via lp,q Regularization JMLR 2017 Group-Wise Point-Set Registration Based on Renyi's Second Order Entropy CVPR 2017 GSOS: Gauss-Seidel Operator Splitting Algorithm for Multi-Term Nonsmooth Convex Composite Optimization ICML 2017 Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains AISTATS 2017 Guarantees for Greedy Maximization of Non-submodular Functions with Applications ICML 2017 Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression JMLR 2017