Nonconvex Optimization papers, 2023–2026

Key findings

• Nonconvex Optimization went from 346 papers in 2023 to 757 in 2026, roughly 2.2x in three years.
• NeurIPS publishes the most Nonconvex Optimization work: 958 papers from 2023 to 2026, 41% of the four-venue total.
• The fastest-growing overlap is with Diffusion Models: papers tagged with both rose from 2 in 2023 to 44 in 2026.
• Among the 5 topics under Optimization and Scaling, it ranks #2 by 2026 paper count; the fastest grower in the group, Scaling Laws, is up 4.1x versus 2.2x here.

Representative papers

Spread across years and venues so every edition shows up

• NeurIPS 2026$\gamma$-weakly $\theta$-up-concavity: A Unified Framework for Non-Convex Optimization Beyond DR-Submodular and OSS Functions
• ICML 2026$\texttt{MetaDistill}$: Unlocking the Performance Ceiling for Pretrained Optimizers
• ICLR 2026Behavioral Embeddings of Programs: A Quasi-Dynamic Approach for Optimization Prediction
• CVPR 2026Coverage Optimization for Camera View Selection
• NeurIPS 2025Beyond Random: Automatic Inner-loop Optimization in Dataset Distillation
• ICML 2025A Bregman Proximal Viewpoint on Neural Operators
• ICLR 2025A Truncated Newton Method for Optimal Transport
• CVPR 2025Balanced Rate-Distortion Optimization in Learned Image Compression
• NeurIPS 2024A survey and benchmark of high-dimensional Bayesian optimization of discrete sequences
• ICML 2024A Doubly Recursive Stochastic Compositional Gradient Descent Method for Federated Multi-Level Compositional Optimization
• ICLR 2024Bayesian Coreset Optimization for Personalized Federated Learning
• CVPR 2024FaceCom: Towards High-fidelity 3D Facial Shape Completion via Optimization and Inpainting Guidance
• NeurIPS 2023A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting
• ICML 2023A Distribution Optimization Framework for Confidence Bounds of Risk Measures
• ICLR 2023A view of mini-batch SGD via generating functions: conditions of convergence, phase transitions, benefit from negative momenta.
• CVPR 2023Attribute-Preserving Face Dataset Anonymization via Latent Code Optimization
• NeurIPS 2026A Doubly Smoothed Decentralized Stochastic Minimax Optimization Algorithm
• ICML 2026A Constrained Optimization Perspective of Unrolled Transformers
• ICLR 2026BEP: A Binary Error Propagation Algorithm for Binary Neural Networks Training
• CVPR 2026Fully Decentralized Certified Unlearning

All Nonconvex Optimization papers

192 papers, page 2 of 4

51. ICML 2025Efficient Curvature-Aware Hypergradient Approximation for Bilevel Optimization
52. ICML 2025Efficient Distributed Optimization under Heavy-Tailed Noise
53. ICML 2025Efficient First-Order Optimization on the Pareto Set for Multi-Objective Learning under Preference Guidance
54. ICML 2025Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
55. ICML 2025Efficient Skill Discovery via Regret-Aware Optimization
56. ICML 2025ELMO : Efficiency via Low-precision and Peak Memory Optimization in Large Output Spaces
57. ICML 2025Empower Structure-Based Molecule Optimization with Gradient Guided Bayesian Flow Networks
58. ICML 2025Enabling Optimal Decisions in Rehearsal Learning under CARE Condition
59. ICML 2025Enhancing Parallelism in Decentralized Stochastic Convex Optimization
60. ICML 2025Ensemble Learned Bloom Filters: Two Oracles are Better than One
61. ICML 2025EquivaMap: Leveraging LLMs for Automatic Equivalence Checking of Optimization Formulations
62. ICML 2025Exploiting Curvature in Online Convex Optimization with Delayed Feedback
63. ICML 2025Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization
64. ICML 2025Extreme Value Policy Optimization for Safe Reinforcement Learning
65. ICML 2025Fast Tensor Completion via Approximate Richardson Iteration
66. ICML 2025Fast, Accurate Manifold Denoising by Tunneling Riemannian Optimization
67. ICML 2025Faster Stochastic Optimization with Arbitrary Delays via Adaptive Asynchronous Mini-Batching
68. ICML 2025Feature-Mapping Topology Optimization with Neural Heaviside Signed Distance Functions
69. ICML 2025Finite-Sample Convergence Bounds for Trust Region Policy Optimization in Mean Field Games
70. ICML 2025Finite-Time Convergence Rates in Stochastic Stackelberg Games with Smooth Algorithmic Agents
71. ICML 2025FunBO: Discovering Acquisition Functions for Bayesian Optimization with FunSearch
72. ICML 2025General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization
73. ICML 2025Generalists vs. Specialists: Evaluating LLMs on Highly-Constrained Biophysical Sequence Optimization Tasks
74. ICML 2025Generalized Smooth Bilevel Optimization with Nonconvex Lower-Level
75. ICML 2025Geometric Algebra Planes: Convex Implicit Neural Volumes
76. ICML 2025Global curvature for second-order optimization of neural networks
77. ICML 2025Global Optimization with a Power-Transformed Objective and Gaussian Smoothing
78. ICML 2025GPTAQ: Efficient Finetuning-Free Quantization for Asymmetric Calibration
79. ICML 2025Gradient Descent Converges Arbitrarily Fast for Logistic Regression via Large and Adaptive Stepsizes
80. ICML 2025Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery
81. ICML 2025HALoS: Hierarchical Asynchronous Local SGD over Slow Networks for Geo-Distributed Large Language Model Training
82. ICML 2025High-Dimensional Tensor Regression With Oracle Properties
83. ICML 2025How Much Can We Forget about Data Contamination?
84. ICML 2025How to set AdamW's weight decay as you scale model and dataset size
85. ICML 2025Hyperband-based Bayesian Optimization for Black-box Prompt Selection
86. ICML 2025Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization
87. ICML 2025Improved Lower Bounds for First-order Stochastic Non-convex Optimization under Markov Sampling
88. ICML 2025Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization
89. ICML 2025Improved Theoretically-Grounded Evolutionary Algorithms for Subset Selection with a Linear Cost Constraint
90. ICML 2025Incremental Gradient Descent with Small Epoch Counts is Surprisingly Slow on Ill-Conditioned Problems
91. ICML 2025Integrating Intermediate Layer Optimization and Projected Gradient Descent for Solving Inverse Problems with Diffusion Models
92. ICML 2025Inverse Optimization via Learning Feasible Regions
93. ICML 2025Joint Learning of Energy-based Models and their Partition Function
94. ICML 2025Joker: Joint Optimization Framework for Lightweight Kernel Machines
95. ICML 2025Knowledge-Guided Wasserstein Distributionally Robust Optimization
96. ICML 2025Kona: An Efficient Privacy-Preservation Framework for KNN Classification by Communication Optimization
97. ICML 2025LangTime: A Language-Guided Unified Model for Time Series Forecasting with Proximal Policy Optimization
98. ICML 2025Latent Variable Estimation in Bayesian Black-Litterman Models
99. ICML 2025Lean and Mean Adaptive Optimization via Subset-Norm and Subspace-Momentum with Convergence Guarantees
100. ICML 2025Learning Bayesian Nash Equilibrium in Auction Games via Approximate Best Response

FAQ

How many Nonconvex Optimization papers were published at NeurIPS, ICLR, ICML and CVPR from 2023 to 2026?

2,330 in total: 346 in 2023, 560 in 2024, 667 in 2025, 757 in 2026.

How many Nonconvex Optimization papers are at NeurIPS 2026?

NeurIPS 2026 has 250 Nonconvex Optimization papers, versus 279 the year before.

How many Nonconvex Optimization papers are at ICLR 2026?

ICLR 2026 has 178 Nonconvex Optimization papers, versus 177 the year before.

How many Nonconvex Optimization papers are at ICML 2026?

ICML 2026 has 286 Nonconvex Optimization papers, versus 192 the year before.

How many Nonconvex Optimization papers are at CVPR 2026?

CVPR 2026 has 43 Nonconvex Optimization papers, versus 19 the year before.

Which conference publishes the most Nonconvex Optimization papers?

NeurIPS, with 958 papers from 2023 to 2026.