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

279 papers, page 1 of 6

1. NeurIPS 2025$\texttt{STRCMP}$: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization
2. NeurIPS 20253BASiL: An Algorithmic Framework for Sparse plus Low-Rank Compression of LLMs
3. NeurIPS 2025A Beyond-Worst-Case Analysis of Greedy k-means++
4. NeurIPS 2025A Computationally Viable Numerical Gradient-based Technique for Optimal Covering Problems
5. NeurIPS 2025A geometric framework for momentum-based optimizers for low-rank training
6. NeurIPS 2025A Gradient Guidance Perspective on Stepwise Preference Optimization for Diffusion Models
7. NeurIPS 2025A Gradient Guided Diffusion Framework for Chance Constrained Programming
8. NeurIPS 2025A Minimalist Example of Edge-of-Stability and Progressive Sharpening
9. NeurIPS 2025A Near-Optimal Algorithm for Decentralized Convex-Concave Finite-Sum Minimax Optimization
10. NeurIPS 2025A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees
11. NeurIPS 2025A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
12. NeurIPS 2025A Single-Loop Gradient Algorithm for Pessimistic Bilevel Optimization via Smooth Approximation
13. NeurIPS 2025A Stable Whitening Optimizer for Efficient Neural Network Training
14. NeurIPS 2025A Tale of Two Symmetries: Exploring the Loss Landscape of Equivariant Models
15. NeurIPS 2025A Unified Analysis of Stochastic Gradient Descent with Arbitrary Data Permutations and Beyond
16. NeurIPS 2025A Unified Stability Analysis of SAM vs SGD: Role of Data Coherence and Emergence of Simplicity Bias
17. NeurIPS 2025Accelerated Distance-adaptive Methods for Hölder Smooth and Convex Optimization
18. NeurIPS 2025Accelerating Model-Free Optimization via Averaging of Cost Samples
19. NeurIPS 2025Accelerating Optimization via Differentiable Stopping Time
20. NeurIPS 2025Ada-R1: Hybrid-CoT via Bi-Level Adaptive Reasoning Optimization
21. NeurIPS 2025Adaptive Algorithms with Sharp Convergence Rates for Stochastic Hierarchical Optimization
22. NeurIPS 2025Adaptive Riemannian ADMM for Nonsmooth Optimization: Optimal Complexity without Smoothing
23. NeurIPS 2025Advancing Expert Specialization for Better MoE
24. NeurIPS 2025Adversary Aware Optimization for Robust Defense
25. NeurIPS 2025Affine-Invariant Global Non-Asymptotic Convergence Analysis of BFGS under Self-Concordance
26. NeurIPS 2025An Adaptive Algorithm for Bilevel Optimization on Riemannian Manifolds
27. NeurIPS 2025An Ellipsoid Algorithm for Online Convex Optimization
28. NeurIPS 2025Any-stepsize Gradient Descent for Separable Data under Fenchel–Young Losses
29. NeurIPS 2025ARECHO: Autoregressive Evaluation via Chain-Based Hypothesis Optimization for Speech Multi-Metric Estimation
30. NeurIPS 2025ASGO: Adaptive Structured Gradient Optimization
31. NeurIPS 2025Attention-based clustering
32. NeurIPS 2025Auto-Connect: Connectivity-Preserving RigFormer with Direct Preference Optimization
33. NeurIPS 2025Autoencoding Random Forests
34. NeurIPS 2025Balanced Token Pruning: Accelerating Vision Language Models Beyond Local Optimization
35. NeurIPS 2025Balancing Gradient and Hessian Queries in Non-Convex Optimization
36. NeurIPS 2025Bayesian Optimization with Preference Exploration using a Monotonic Neural Network Ensemble
37. NeurIPS 2025BayeSQP: Bayesian Optimization through Sequential Quadratic Programming
38. NeurIPS 2025Beyond $\tilde{O}(\sqrt{T})$ Constraint Violation for Online Convex Optimization with Adversarial Constraints
39. NeurIPS 2025Beyond Random: Automatic Inner-loop Optimization in Dataset Distillation
40. NeurIPS 2025Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions
41. NeurIPS 2025Bilevel Optimization for Adversarial Learning Problems: Sharpness, Generation, and Beyond
42. NeurIPS 2025Boosting Resilience of Large Language Models through Causality-Driven Robust Optimization
43. NeurIPS 2025Bootstrap Your Uncertainty: Adaptive Robust Classification Driven by Optimal-Transport
44. NeurIPS 2025Breaking the Frozen Subspace: Importance Sampling for Low-Rank Optimization in LLM Pretraining
45. NeurIPS 2025BundleFlow: Deep Menus for Combinatorial Auctions by Diffusion-Based Optimization
46. NeurIPS 2025CAMO: Convergence-Aware Multi-Fidelity Bayesian Optimization
47. NeurIPS 2025CHPO: Constrained Hybrid-action Policy Optimization for Reinforcement Learning
48. NeurIPS 2025CoIDO: Efficient Data Selection for Visual Instruction Tuning via Coupled Importance-Diversity Optimization
49. NeurIPS 2025Complexity Scaling Laws for Neural Models using Combinatorial Optimization
50. NeurIPS 2025ComPO: Preference Alignment via Comparison Oracles

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.