% Key papers for Complexity of nonconvex first-order methods (scime atlas, https://atlas.scime.ai). Authors are not included: add them from the paper pages. @inproceedings{neurips2016_fast_55724, title = {{Fast Algorithms for Robust PCA via Gradient Descent}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2016}, url = {https://nips.cc/virtual/2016/poster/7061}, } @inproceedings{neurips2016_reshaped_55962, title = {{Reshaped Wirtinger Flow for Solving Quadratic System of Equations}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2016}, url = {https://nips.cc/virtual/2016/poster/7147}, } @inproceedings{icml2018_computational_36587, title = {{Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn’s Algorithm}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2018}, url = {https://icml.cc/virtual/2018/poster/2468}, } @inproceedings{iclr2020_gradientless_29672, title = {{Gradientless Descent: High-Dimensional Zeroth-Order Optimization}}, booktitle = {International Conference on Learning Representations (ICLR)}, year = {2020}, url = {https://openreview.net/forum?id=Skep6TVYDB}, } @inproceedings{neurips2018_on_57470, title = {{On the Local Minima of the Empirical Risk}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2018}, url = {https://nips.cc/virtual/2018/poster/11480}, } @inproceedings{neurips2019_a_57827, title = {{A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2019}, url = {https://nips.cc/virtual/2019/poster/14520}, } @inproceedings{neurips2019_complexity_58015, title = {{Complexity of Highly Parallel Non-Smooth Convex Optimization}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2019}, url = {https://nips.cc/virtual/2019/poster/14622}, } @inproceedings{aaai2019_faster_100607, title = {{Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization}}, booktitle = {AAAI Conference on Artificial Intelligence (AAAI)}, year = {2019}, url = {https://ojs.aaai.org/index.php/AAAI/article/view/3963}, } @inproceedings{neurips2019_global_58337, title = {{Global Guarantees for Blind Demodulation with Generative Priors}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2019}, url = {https://nips.cc/virtual/2019/poster/14137}, } @inproceedings{iclr2020_geometric_29886, title = {{Geometric Analysis of Nonconvex Optimization Landscapes for Overcomplete Learning}}, booktitle = {International Conference on Learning Representations (ICLR)}, year = {2020}, url = {https://openreview.net/forum?id=rygixkHKDH}, } @inproceedings{neurips2016_homotopy_55774, title = {{Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than \$O(1/epsilon)\$}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2016}, url = {https://nips.cc/virtual/2016/poster/7088}, } @inproceedings{icml2021_optimal_39742, title = {{Optimal Complexity in Decentralized Training}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2021}, url = {https://icml.cc/virtual/2021/poster/8893}, } @inproceedings{icml2019_pa_37638, title = {{PA-GD: On the Convergence of Perturbed Alternating Gradient Descent to Second-Order Stationary Points for Structured Nonconvex Optimization}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2019}, url = {https://icml.cc/virtual/2019/poster/4138}, } @inproceedings{neurips2021_super_63117, title = {{SUPER-ADAM: Faster and Universal Framework of Adaptive Gradients}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2021}, url = {https://nips.cc/virtual/2021/poster/27440}, } @inproceedings{neurips2020_acceleration_59309, title = {{Acceleration with a Ball Optimization Oracle}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2020}, url = {https://nips.cc/virtual/2020/poster/18117}, } @inproceedings{icml2019_iterative_37457, title = {{Iterative Linearized Control: Stable Algorithms and Complexity Guarantees}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2019}, url = {https://icml.cc/virtual/2019/poster/4201}, } @inproceedings{icml2021_learner_39514, title = {{Learner-Private Convex Optimization}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2021}, url = {https://icml.cc/virtual/2021/poster/9455}, } @inproceedings{aaai2024_on_6827, title = {{On Partial Optimal Transport: Revising the Infeasibility of Sinkhorn and Efficient Gradient Methods}}, booktitle = {AAAI Conference on Artificial Intelligence (AAAI)}, year = {2024}, url = {https://ojs.aaai.org/index.php/AAAI/article/view/28648}, } @inproceedings{icml2019_efficient_37324, title = {{Efficient Dictionary Learning with Gradient Descent}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2019}, url = {https://icml.cc/virtual/2019/poster/3789}, } @inproceedings{neurips2018_uniform_57741, title = {{Uniform Convergence of Gradients for Non-Convex Learning and Optimization}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2018}, url = {https://nips.cc/virtual/2018/poster/11835}, } @inproceedings{neurips2025_rewind_76117, title = {{Rewind-to-Delete: Certified Machine Unlearning for Nonconvex Functions}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2025}, url = {https://openreview.net/forum?id=FgjcLXIUjr}, } @inproceedings{aaai2025_gpu_9288, title = {{GPU-Accelerated Parallel Bilevel Optimization for Roubst 6G ISAC}}, booktitle = {AAAI Conference on Artificial Intelligence (AAAI)}, year = {2025}, url = {https://ojs.aaai.org/index.php/AAAI/article/view/33214}, } @inproceedings{icml2026_gradient_49316, title = {{Gradient Testing and Estimation by Comparisons}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2026}, url = {https://openreview.net/forum?id=1JG0y5cOmK}, } @inproceedings{neurips2024_robust_71243, title = {{Robust and Faster Zeroth-Order Minimax Optimization: Complexity and Applications}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2024}, url = {https://neurips.cc/virtual/2024/poster/96000}, } @inproceedings{icml2024_faster_43846, title = {{Faster Adaptive Decentralized Learning Algorithms}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2024}, url = {https://icml.cc/virtual/2024/poster/34606}, } @inproceedings{icml2024_on_44714, title = {{On Convergence of Incremental Gradient for Non-convex Smooth Functions}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2024}, url = {https://icml.cc/virtual/2024/poster/33738}, } @inproceedings{icml2024_a_44764, title = {{A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2024}, url = {https://icml.cc/virtual/2024/poster/33688}, } @inproceedings{icml2024_gradient_45664, title = {{Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2024}, url = {https://icml.cc/virtual/2024/poster/32788}, } @inproceedings{icml2025_general_48047, title = {{General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2025}, url = {https://icml.cc/virtual/2025/poster/44560}, } @inproceedings{icml2026_limuon_54178, title = {{LiMuon: Light and Fast Muon Optimizer for Large Models}}, booktitle = {International Conference on Machine Learning (ICML)}, year = {2026}, url = {https://openreview.net/forum?id=mf8N8PTUAa}, } @inproceedings{neurips2024_acceleration_73631, title = {{Acceleration Exists! Optimization Problems When Oracle Can Only Compare Objective Function Values}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2024}, url = {https://neurips.cc/virtual/2024/poster/93860}, } @inproceedings{neurips2024_optimizing_73657, title = {{Optimizing over Multiple Distributions under Generalized Quasar-Convexity Condition}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2024}, url = {https://neurips.cc/virtual/2024/poster/93835}, } @inproceedings{neurips2025_semi_77786, title = {{Semi-infinite Nonconvex Constrained Min-Max Optimization}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2025}, url = {https://openreview.net/forum?id=XX7XpzSMHd}, } @inproceedings{iclr2025_admm_81489, title = {{ADMM for Nonconvex Optimization under Minimal Continuity Assumption}}, booktitle = {International Conference on Learning Representations (ICLR)}, year = {2025}, url = {https://iclr.cc/virtual/2025/poster/30287}, } @inproceedings{iclr2025_adaptive_83128, title = {{Adaptive Batch Size for Privately Finding Second-Order Stationary Points}}, booktitle = {International Conference on Learning Representations (ICLR)}, year = {2025}, url = {https://iclr.cc/virtual/2025/poster/28679}, } @inproceedings{neurips2026_adaptively_93039, title = {{Adaptively Incorporating Directional Hints into Zeroth-Order Optimization}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2026}, url = {https://neurips.cc/virtual/2026/poster/149625}, } @inproceedings{neurips2026_complexity_94355, title = {{Complexity of Classical Acceleration for \$ell\_1\$-Regularized PageRank}}, booktitle = {Advances in Neural Information Processing Systems (NeurIPS)}, year = {2026}, url = {https://neurips.cc/virtual/2026/poster/153053}, } @inproceedings{iclr2024_simple_33498, title = {{Simple Minimax Optimal Byzantine Robust Algorithm for Nonconvex Objectives with Uniform Gradient Heterogeneity}}, booktitle = {International Conference on Learning Representations (ICLR)}, year = {2024}, url = {https://iclr.cc/virtual/2024/poster/19577}, } @inproceedings{iclr2024_on_35013, title = {{On the Hardness of Online Nonconvex Optimization with Single Oracle Feedback}}, booktitle = {International Conference on Learning Representations (ICLR)}, year = {2024}, url = {https://iclr.cc/virtual/2024/poster/18061}, }