non-convex optimization

Adaptive Gradient Descent without Descent ICML 2020 A Decentralized Parallel Algorithm for Training Generative Adversarial Nets NeurIPS 2020 A Feasible Level Proximal Point Method for Nonconvex Sparse Constrained Optimization NeurIPS 2020 A Generalized Framework for Edge-Preserving and Structure-Preserving Image Smoothing AAAI 2020 Agnostic Learning of a Single Neuron with Gradient Descent NeurIPS 2020 A Graduated Filter Method for Large Scale Robust Estimation CVPR 2020 A Greedy Anytime Algorithm for Sparse PCA COLT 2020 An Effective Hard Thresholding Method Based on Stochastic Variance Reduction for Nonconvex Sparse Learning AAAI 2020 An Improved Analysis of Stochastic Gradient Descent with Momentum NeurIPS 2020 A novel variational form of the Schatten-p quasi-norm NeurIPS 2020 Approximation Schemes for ReLU Regression COLT 2020 A Sample Complexity Separation between Non-Convex and Convex Meta-Learning ICML 2020 A Simple and Efficient Smoothing Method for Faster Optimization and Local Exploration NeurIPS 2020 A Sparse Semismooth Newton Based Proximal Majorization-Minimization Algorithm for Nonconvex Square-Root-Loss Regression Problems JMLR 2020 A Stochastic Derivative-Free Optimization Method with Importance Sampling: Theory and Learning to Control AAAI 2020 A Stochastic Path Integral Differential EstimatoR Expectation Maximization Algorithm NeurIPS 2020 Asymptotic Analysis via Stochastic Differential Equations of Gradient Descent Algorithms in Statistical and Computational Paradigms JMLR 2020 A Unified Optimization Framework for Low-Rank Inducing Penalties CVPR 2020 A Unified q-Memorization Framework for Asynchronous Stochastic Optimization JMLR 2020 Automatically Learning Compact Quality-aware Surrogates for Optimization Problems NeurIPS 2020 Bounding the expected run-time of nonconvex optimization with early stopping UAI 2020 Breaking Reversibility Accelerates Langevin Dynamics for Non-Convex Optimization NeurIPS 2020 Can Stochastic Zeroth-Order Frank-Wolfe Method Converge Faster for Non-Convex Problems? ICML 2020 Choosing the Sample with Lowest Loss makes SGD Robust AISTATS 2020 Communication-Efficient Distributed Stochastic AUC Maximization with Deep Neural Networks ICML 2020