non-convex optimization

Theoretical Convergence of Multi-Step Model-Agnostic Meta-Learning JMLR 2022 The Power of Adaptivity in SGD: Self-Tuning Step Sizes with Unbounded Gradients and Affine Variance COLT 2022 The role of optimization geometry in single neuron learning AISTATS 2022 Tight Analysis of Extra-gradient and Optimistic Gradient Methods For Nonconvex Minimax Problems NeurIPS 2022 Towards An Efficient Approach for the Nonconvex lp Ball Projection: Algorithm and Analysis JMLR 2022 Towards a Theory of Non-Log-Concave Sampling:First-Order Stationarity Guarantees for Langevin Monte Carlo COLT 2022 Towards Optimal Communication Complexity in Distributed Non-Convex Optimization NeurIPS 2022 Towards Practical Adam: Non-Convexity, Convergence Theory, and Mini-Batch Acceleration JMLR 2022 Towards Theoretically Inspired Neural Initialization Optimization NeurIPS 2022 Understanding Gradient Descent on the Edge of Stability in Deep Learning ICML 2022 Zeroth-Order Negative Curvature Finding: Escaping Saddle Points without Gradients NeurIPS 2022 Adaptive Proximal Gradient Methods for Structured Neural Networks NeurIPS 2021 A Faster Decentralized Algorithm for Nonconvex Minimax Problems NeurIPS 2021 A Hybrid Variance-Reduced Method for Decentralized Stochastic Non-Convex Optimization ICML 2021 A Limited-Capacity Minimax Theorem for Non-Convex Games or: How I Learned to Stop Worrying about Mixed-Nash and Love Neural Nets AISTATS 2021 Analytical Study of Momentum-Based Acceleration Methods in Paradigmatic High-Dimensional Non-Convex Problems NeurIPS 2021 An Analysis of Constant Step Size SGD in the Non-convex Regime: Asymptotic Normality and Bias NeurIPS 2021 An Efficient Algorithm for Deep Stochastic Contextual Bandits AAAI 2021 An Online Method for A Class of Distributionally Robust Optimization with Non-convex Objectives NeurIPS 2021 An Optimistic Acceleration of AMSGrad for Nonconvex Optimization ACML 2021 A Second look at Exponential and Cosine Step Sizes: Simplicity, Adaptivity, and Performance ICML 2021 A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization ICML 2021 Benefit of deep learning with non-convex noisy gradient descent: Provable excess risk bound and superiority to kernel methods ICLR 2021 Black-Box Reductions for Zeroth-Order Gradient Algorithms to Achieve Lower Query Complexity JMLR 2021 Byzantine-Resilient Non-Convex Stochastic Gradient Descent ICLR 2021