Skip to content
conftrace_

non-convex optimization

949 papers

Papers

ZO-AdaMM: Zeroth-Order Adaptive Momentum Method for Black-Box Optimization NeurIPS 2019 A Bridging Framework for Model Optimization and Deep Propagation NeurIPS 2018 Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descent COLT 2018 Adaptive Methods for Nonconvex Optimization NeurIPS 2018 Adaptive Negative Curvature Descent with Applications in Non-convex Optimization NeurIPS 2018 A Fast Algorithm for Separated Sparsity via Perturbed Lagrangians AISTATS 2018 A Generic Approach for Escaping Saddle points AISTATS 2018 Analysis of Krylov Subspace Solutions of Regularized Non-Convex Quadratic Problems NeurIPS 2018 An Analysis of the t-SNE Algorithm for Data Visualization COLT 2018 An Efficient Pruning Algorithm for Robust Isotonic Regression NeurIPS 2018 A Nonconvex Proximal Splitting Algorithm under Moreau-Yosida Regularization AISTATS 2018 Approximate message passing for amplitude based optimization ICML 2018 A Primal-Dual Analysis of Global Optimality in Nonconvex Low-Rank Matrix Recovery ICML 2018 Are ResNets Provably Better than Linear Predictors? NeurIPS 2018 A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization NeurIPS 2018 Asynchronous Stochastic Quasi-Newton MCMC for Non-Convex Optimization ICML 2018 A theory on the absence of spurious solutions for nonconvex and nonsmooth optimization NeurIPS 2018 A Tight Bound of Hard Thresholding JMLR 2018 A Unified Framework for Nonconvex Low-Rank plus Sparse Matrix Recovery AISTATS 2018 Benefits of over-parameterization with EM NeurIPS 2018 Catalyst for Gradient-based Nonconvex Optimization AISTATS 2018 Construction of Incoherent Dictionaries via Direct Babel Function Minimization ACML 2018 Continuous Relaxation of MAP Inference: A Nonconvex Perspective CVPR 2018 Convergence Analysis of Gradient Descent for Eigenvector Computation IJCAI 2018 Convergence guarantees for a class of non-convex and non-smooth optimization problems ICML 2018