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

177 papers, page 1 of 4

1. ICLR 2025$\phi$-Update: A Class of Policy Update Methods with Policy Convergence Guarantee
2. ICLR 2025$q$-exponential family for policy optimization
3. ICLR 2025A Coefficient Makes SVRG Effective
4. ICLR 2025A Common Pitfall of Margin-based Language Model Alignment: Gradient Entanglement
5. ICLR 2025A Deep Generative Learning Approach for Two-stage Adaptive Robust Optimization
6. ICLR 2025A New Perspective on Shampoo's Preconditioner
7. ICLR 2025A Stochastic Approach to the Subset Selection Problem via Mirror Descent
8. ICLR 2025A Theoretical Analysis of Self-Supervised Learning for Vision Transformers
9. ICLR 2025A Tight Convergence Analysis of Inexact Stochastic Proximal Point Algorithm for Stochastic Composite Optimization Problems
10. ICLR 2025A Truncated Newton Method for Optimal Transport
11. ICLR 2025A Unified Theory of Quantum Neural Network Loss Landscapes
12. ICLR 2025Accelerated Over-Relaxation Heavy-Ball Method: Achieving Global Accelerated Convergence with Broad Generalization
13. ICLR 2025Accelerated training through iterative gradient propagation along the residual path
14. ICLR 2025Achieving Dimension-Free Communication in Federated Learning via Zeroth-Order Optimization
15. ICLR 2025AdaGrad under Anisotropic Smoothness
16. ICLR 2025Adam Exploits $\ell_\infty$-geometry of Loss Landscape via Coordinate-wise Adaptivity
17. ICLR 2025ADAM Optimization with Adaptive Batch Selection
18. ICLR 2025Adaptive backtracking line search
19. ICLR 2025Adaptive Data Optimization: Dynamic Sample Selection with Scaling Laws
20. ICLR 2025Adaptive Methods through the Lens of SDEs: Theoretical Insights on the Role of Noise
21. ICLR 2025Adaptive Pruning of Pretrained Transformer via Differential Inclusions
22. ICLR 2025ADMM for Nonconvex Optimization under Minimal Continuity Assumption
23. ICLR 2025ADMM for Structured Fractional Minimization
24. ICLR 2025Adversarial Policy Optimization for Offline Preference-based Reinforcement Learning
25. ICLR 2025Adversarial Search Engine Optimization for Large Language Models
26. ICLR 2025Aioli: A Unified Optimization Framework for Language Model Data Mixing
27. ICLR 2025An Asynchronous Bundle Method for Distributed Learning Problems
28. ICLR 2025An Effective Manifold-based Optimization Method for Distributionally Robust Classification
29. ICLR 2025Approximation algorithms for combinatorial optimization with predictions
30. ICLR 2025Attention with Markov: A Curious Case of Single-layer Transformers
31. ICLR 2025Bayesian Optimization via Continual Variational Last Layer Training
32. ICLR 2025Beyond Linear Approximations: A Novel Pruning Approach for Attention Matrix
33. ICLR 2025Bi-Factorial Preference Optimization: Balancing Safety-Helpfulness in Language Models
34. ICLR 2025Boosting Neural Combinatorial Optimization for Large-Scale Vehicle Routing Problems
35. ICLR 2025Boosting Perturbed Gradient Ascent for Last-Iterate Convergence in Games
36. ICLR 2025Bounds on $L_p$ Errors in Density Ratio Estimation via $f$-Divergence Loss Functions
37. ICLR 2025BP-Modified Local Loss for Efficient Training of Deep Neural Networks
38. ICLR 2025Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation
39. ICLR 2025Can Reinforcement Learning Solve Asymmetric Combinatorial-Continuous Zero-Sum Games?
40. ICLR 2025Cauchy-Schwarz Regularizers
41. ICLR 2025Causal Discovery via Bayesian Optimization
42. ICLR 2025CHiP: Cross-modal Hierarchical Direct Preference Optimization for Multimodal LLMs
43. ICLR 2025Collaborative Discrete-Continuous Black-Box Prompt Learning for Language Models
44. ICLR 2025Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
45. ICLR 2025CONGO: Compressive Online Gradient Optimization
46. ICLR 2025Controllable Unlearning for Image-to-Image Generative Models via $\epsilon$-Constrained Optimization
47. ICLR 2025Convergence of Distributed Adaptive Optimization with Local Updates
48. ICLR 2025Decentralized Optimization with Coupled Constraints
49. ICLR 2025Decision Information Meets Large Language Models: The Future of Explainable Operations Research
50. ICLR 2025Deconstructing What Makes a Good Optimizer for Autoregressive Language Models

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.