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

2,330 papers, page 23 of 47

1101. ICML 2025Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
1102. ICML 2025Rapid Overfitting of Multi-Pass SGD in Stochastic Convex Optimization
1103. ICML 2025Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization
1104. ICML 2025Reducing Variance of Stochastic Optimization for Approximating Nash Equilibria in Normal-Form Games
1105. ICML 2025Refining Adaptive Zeroth-Order Optimization at Ease
1106. ICML 2025Regularized Langevin Dynamics for Combinatorial Optimization
1107. ICML 2025Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness
1108. ICML 2025Revolve: Optimizing AI Systems by Tracking Response Evolution in Textual Optimization
1109. ICML 2025Riemannian Diffusion Adaptation for Distributed Optimization on Manifolds
1110. ICML 2025Right Now, Wrong Then: Non-Stationary Direct Preference Optimization under Preference Drift
1111. ICML 2025Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity
1112. ICML 2025Robust Sparsification via Sensitivity
1113. ICML 2025ROPO: Robust Preference Optimization for Large Language Models
1114. ICML 2025SAFE: Finding Sparse and Flat Minima to Improve Pruning
1115. ICML 2025Sassha: Sharpness-aware Adaptive Second-order Optimization with Stable Hessian Approximation
1116. ICML 2025Scaffold with Stochastic Gradients: New Analysis with Linear Speed-Up
1117. ICML 2025Scalable Meta-Learning via Mixed-Mode Differentiation
1118. ICML 2025Secant Line Search for Frank-Wolfe Algorithms
1119. ICML 2025SERENA: A Unified Stochastic Recursive Variance Reduced Gradient Framework for Riemannian Non-Convex Optimization
1120. ICML 2025Simple Policy Optimization
1121. ICML 2025Simplicity Bias and Optimization Threshold in Two-Layer ReLU Networks
1122. ICML 2025SkipGPT: Each Token is One of a Kind
1123. ICML 2025Solving Zero-Sum Convex Markov Games
1124. ICML 2025Sparse Training from Random Initialization: Aligning Lottery Ticket Masks using Weight Symmetry
1125. ICML 2025Sparse-pivot: Dynamic correlation clustering for node insertions
1126. ICML 2025Stacey: Promoting Stochastic Steepest Descent via Accelerated $\ell_p$-Smooth Nonconvex Optimization
1127. ICML 2025Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints
1128. ICML 2025Structured Preconditioners in Adaptive Optimization: A Unified Analysis
1129. ICML 2025Subspace Optimization for Large Language Models with Convergence Guarantees
1130. ICML 2025The Global Convergence Time of Stochastic Gradient Descent in Non-Convex Landscapes: Sharp Estimates via Large Deviations
1131. ICML 2025The Sharpness Disparity Principle in Transformers for Accelerating Language Model Pre-Training
1132. ICML 2025The Sparse-Plus-Low-Rank Quasi-Newton Method for Entropic-Regularized Optimal Transport
1133. ICML 2025The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training
1134. ICML 2025Tilted Sharpness-Aware Minimization
1135. ICML 2025ToMA: Token Merge with Attention for Diffusion Models
1136. ICML 2025Toward a Unified Theory of Gradient Descent under Generalized Smoothness
1137. ICML 2025Towards Universal Offline Black-Box Optimization via Learning Language Model Embeddings
1138. ICML 2025TSP: A Two-Sided Smoothed Primal-Dual Method for Nonconvex Bilevel Optimization
1139. ICML 2025Unconstrained Robust Online Convex Optimization
1140. ICML 2025Understanding High-Dimensional Bayesian Optimization
1141. ICML 2025Unified Breakdown Analysis for Byzantine Robust Gossip
1142. ICML 2025Variance-Reduced Forward-Reflected-Backward Splitting Methods for Nonmonotone Generalized Equations
1143. ICML 2025Wasserstein Policy Optimization
1144. ICML 2025When Maximum Entropy Misleads Policy Optimization
1145. ICML 2025When to Forget? Complexity Trade-offs in Machine Unlearning
1146. NeurIPS 2025$\texttt{STRCMP}$: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization
1147. NeurIPS 20253BASiL: An Algorithmic Framework for Sparse plus Low-Rank Compression of LLMs
1148. NeurIPS 2025A Beyond-Worst-Case Analysis of Greedy k-means++
1149. NeurIPS 2025A Computationally Viable Numerical Gradient-based Technique for Optimal Covering Problems
1150. NeurIPS 2025A geometric framework for momentum-based optimizers for low-rank training

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.