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 1 of 4

1. ICML 2025A Bregman Proximal Viewpoint on Neural Operators
2. ICML 2025A Comprehensive Framework for Analyzing the Convergence of Adam: Bridging the Gap with SGD
3. ICML 2025A First-order Generative Bilevel Optimization Framework for Diffusion Models
4. ICML 2025A Generalization Result for Convergence in Learning-to-Optimize
5. ICML 2025A Memory Efficient Randomized Subspace Optimization Method for Training Large Language Models
6. ICML 2025A Near Linear Query Lower Bound for Submodular Maximization
7. ICML 2025A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional Optimization
8. ICML 2025A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization
9. ICML 2025A Unified Framework for Entropy Search and Expected Improvement in Bayesian Optimization
10. ICML 2025Accelerating PDE-Constrained Optimization by the Derivative of Neural Operators
11. ICML 2025Achieving Linear Speedup and Near-Optimal Complexity for Decentralized Optimization over Row-stochastic Networks
12. ICML 2025Active Learning of Deep Neural Networks via Gradient-Free Cutting Planes
13. ICML 2025Adaptive Partitioning Schemes for Optimistic Optimization
14. ICML 2025Addressing Concept Mislabeling in Concept Bottleneck Models Through Preference Optimization
15. ICML 2025Aequa: Fair Model Rewards in Collaborative Learning via Slimmable Networks
16. ICML 2025AMPO: Active Multi Preference Optimization for Self-play Preference Selection
17. ICML 2025An Online Adaptive Sampling Algorithm for Stochastic Difference-of-convex Optimization with Time-varying Distributions
18. ICML 2025Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster
19. ICML 2025Attention-Only Transformers via Unrolled Subspace Denoising
20. ICML 2025Autoformulation of Mathematical Optimization Models Using LLMs
21. ICML 2025Automatic Differentiation of Optimization Algorithms with Time-Varying Updates
22. ICML 2025BackSlash: Rate Constrained Optimized Training of Large Language Models
23. ICML 2025BARK: A Fully Bayesian Tree Kernel for Black-box Optimization
24. ICML 2025Behavior-Regularized Diffusion Policy Optimization for Offline Reinforcement Learning
25. ICML 2025BILBO: BILevel Bayesian Optimization
26. ICML 2025BOPO: Neural Combinatorial Optimization via Best-anchored and Objective-guided Preference Optimization
27. ICML 2025BSO: Binary Spiking Online Optimization Algorithm
28. ICML 2025Clipped SGD Algorithms for Performative Prediction: Tight Bounds for Stochastic Bias and Remedies
29. ICML 2025Clipping Improves Adam-Norm and AdaGrad-Norm when the Noise Is Heavy-Tailed
30. ICML 2025COExpander: Adaptive Solution Expansion for Combinatorial Optimization
31. ICML 2025Compute or Load KV Cache? Why Not Both?
32. ICML 2025ConfPO: Exploiting Policy Model Confidence for Critical Token Selection in Preference Optimization
33. ICML 2025Consensus Based Stochastic Optimal Control
34. ICML 2025Constant Stepsize Local GD for Logistic Regression: Acceleration by Instability
35. ICML 2025Constrained Online Convex Optimization with Polyak Feasibility Steps
36. ICML 2025Contextual Optimization Under Model Misspecification: A Tractable and Generalizable Approach
37. ICML 2025Convergence of Mean-Field Langevin Stochastic Descent-Ascent for Distributional Minimax Optimization
38. ICML 2025Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
39. ICML 2025Cover learning for large-scale topology representation
40. ICML 2025Density Ratio Estimation-based Bayesian Optimization with Semi-Supervised Learning
41. ICML 2025Differentiable Quadratic Optimization For the Maximum Independent Set Problem
42. ICML 2025Differentiable Structure Learning with Ancestral Constraints
43. ICML 2025Direct Density Ratio Optimization: A Statistically Consistent Approach to Aligning Large Language Models
44. ICML 2025Discrepancy Minimization in Input-Sparsity Time
45. ICML 2025Distributed Event-Based Learning via ADMM
46. ICML 2025Distributed Retraction-Free and Communication-Efficient Optimization on the Stiefel Manifold
47. ICML 2025DTZO: Distributed Trilevel Zeroth Order Learning with Provable Non-Asymptotic Convergence
48. ICML 2025Dueling Convex Optimization with General Preferences
49. ICML 2025EARL-BO: Reinforcement Learning for Multi-Step Lookahead, High-Dimensional Bayesian Optimization
50. ICML 2025Efficient Bisection Projection to Ensure Neural-Network Solution Feasibility for Optimization over General Set

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.