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

541 papers, page 4 of 11

151. ICLR 2026Sobolev Gradient Ascent for Optimal Transport: Barycenter Optimization and Convergence Analysis
152. ICLR 2026Soft Quality-Diversity Optimization
153. ICLR 2026SparseEval: Efficient Evaluation of Large Language Models by Sparse Optimization
154. ICLR 2026Special Unitary Parameterized Estimators of Rotation
155. ICLR 2026SPRIG: Improving Large Language Model Performance by System Prompt Optimization
156. ICLR 2026Stop Guessing: Choosing the Optimization-Consistent Uncertainty Measurement for Evidential Deep Learning
157. ICLR 2026Strong Correlations Induce Cause Only Predictions in Transformer Training
158. ICLR 2026Strongly Convex Sets in Riemannian Manifolds
159. ICLR 2026Submodular Function Minimization with Dueling Oracle
160. ICLR 2026SVD Provably Denoises Nearest Neighbor Data
161. ICLR 2026Symmetry-Aware Bayesian Optimization via Max Kernels
162. ICLR 2026Taming Score-Based Denoisers in ADMM: A Convergent Plug-and-Play Framework
163. ICLR 2026TAO-Attack: Toward Advanced Optimization-Based Jailbreak Attacks for Large Language Models
164. ICLR 2026Task-free Adaptive Meta Black-box Optimization
165. ICLR 2026The Potential of Second-Order Optimization for LLMs: A Study with Full Gauss-Newton
166. ICLR 2026Token-Importance Guided Direct Preference Optimization
167. ICLR 2026Towards Dynamic Interleaving Optimizers
168. ICLR 2026Towards Learned Optimization Free Lunch
169. ICLR 2026Towards Real-World Routing with Neural Combinatorial Optimization
170. ICLR 2026Understanding and improving Shampoo and SOAP via Kullback-Leibler Minimization
171. ICLR 2026Uni-DPO: A Unified Paradigm for Dynamic Preference Optimization of LLMs
172. ICLR 2026Unified Analyses for Hierarchical Federated Learning: Topology Selection under Data Heterogeneity
173. ICLR 2026Unifying Formal Explanations: A Complexity-Theoretic Perspective
174. ICLR 2026Unifying Stable Optimization and Reference Regularization in RLHF
175. ICLR 2026Unlocking the Potential of Weighting Methods in Federated Learning Through Communication Compression
176. ICLR 2026Why DPO is a Misspecified Estimator and How to Fix It
177. ICLR 2026WILD-Diffusion: A WDRO Inspired Training Method for Diffusion Models under Limited Data
178. ICLR 2026XQC: Well-conditioned Optimization Accelerates Deep Reinforcement Learning
179. ICLR 2025$\phi$-Update: A Class of Policy Update Methods with Policy Convergence Guarantee
180. ICLR 2025$q$-exponential family for policy optimization
181. ICLR 2025A Coefficient Makes SVRG Effective
182. ICLR 2025A Common Pitfall of Margin-based Language Model Alignment: Gradient Entanglement
183. ICLR 2025A Deep Generative Learning Approach for Two-stage Adaptive Robust Optimization
184. ICLR 2025A New Perspective on Shampoo's Preconditioner
185. ICLR 2025A Stochastic Approach to the Subset Selection Problem via Mirror Descent
186. ICLR 2025A Theoretical Analysis of Self-Supervised Learning for Vision Transformers
187. ICLR 2025A Tight Convergence Analysis of Inexact Stochastic Proximal Point Algorithm for Stochastic Composite Optimization Problems
188. ICLR 2025A Truncated Newton Method for Optimal Transport
189. ICLR 2025A Unified Theory of Quantum Neural Network Loss Landscapes
190. ICLR 2025Accelerated Over-Relaxation Heavy-Ball Method: Achieving Global Accelerated Convergence with Broad Generalization
191. ICLR 2025Accelerated training through iterative gradient propagation along the residual path
192. ICLR 2025Achieving Dimension-Free Communication in Federated Learning via Zeroth-Order Optimization
193. ICLR 2025AdaGrad under Anisotropic Smoothness
194. ICLR 2025Adam Exploits $\ell_\infty$-geometry of Loss Landscape via Coordinate-wise Adaptivity
195. ICLR 2025ADAM Optimization with Adaptive Batch Selection
196. ICLR 2025Adaptive backtracking line search
197. ICLR 2025Adaptive Data Optimization: Dynamic Sample Selection with Scaling Laws
198. ICLR 2025Adaptive Methods through the Lens of SDEs: Theoretical Insights on the Role of Noise
199. ICLR 2025Adaptive Pruning of Pretrained Transformer via Differential Inclusions
200. ICLR 2025ADMM for Nonconvex Optimization under Minimal Continuity Assumption

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.