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

736 papers, page 10 of 15

451. ICML 2025Secant Line Search for Frank-Wolfe Algorithms
452. ICML 2025SERENA: A Unified Stochastic Recursive Variance Reduced Gradient Framework for Riemannian Non-Convex Optimization
453. ICML 2025Simple Policy Optimization
454. ICML 2025Simplicity Bias and Optimization Threshold in Two-Layer ReLU Networks
455. ICML 2025SkipGPT: Each Token is One of a Kind
456. ICML 2025Solving Zero-Sum Convex Markov Games
457. ICML 2025Sparse Training from Random Initialization: Aligning Lottery Ticket Masks using Weight Symmetry
458. ICML 2025Sparse-pivot: Dynamic correlation clustering for node insertions
459. ICML 2025Stacey: Promoting Stochastic Steepest Descent via Accelerated $\ell_p$-Smooth Nonconvex Optimization
460. ICML 2025Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints
461. ICML 2025Structured Preconditioners in Adaptive Optimization: A Unified Analysis
462. ICML 2025Subspace Optimization for Large Language Models with Convergence Guarantees
463. ICML 2025The Global Convergence Time of Stochastic Gradient Descent in Non-Convex Landscapes: Sharp Estimates via Large Deviations
464. ICML 2025The Sharpness Disparity Principle in Transformers for Accelerating Language Model Pre-Training
465. ICML 2025The Sparse-Plus-Low-Rank Quasi-Newton Method for Entropic-Regularized Optimal Transport
466. ICML 2025The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training
467. ICML 2025Tilted Sharpness-Aware Minimization
468. ICML 2025ToMA: Token Merge with Attention for Diffusion Models
469. ICML 2025Toward a Unified Theory of Gradient Descent under Generalized Smoothness
470. ICML 2025Towards Universal Offline Black-Box Optimization via Learning Language Model Embeddings
471. ICML 2025TSP: A Two-Sided Smoothed Primal-Dual Method for Nonconvex Bilevel Optimization
472. ICML 2025Unconstrained Robust Online Convex Optimization
473. ICML 2025Understanding High-Dimensional Bayesian Optimization
474. ICML 2025Unified Breakdown Analysis for Byzantine Robust Gossip
475. ICML 2025Variance-Reduced Forward-Reflected-Backward Splitting Methods for Nonmonotone Generalized Equations
476. ICML 2025Wasserstein Policy Optimization
477. ICML 2025When Maximum Entropy Misleads Policy Optimization
478. ICML 2025When to Forget? Complexity Trade-offs in Machine Unlearning
479. ICML 2024A Diffusion Model Framework for Unsupervised Neural Combinatorial Optimization
480. ICML 2024A Doubly Recursive Stochastic Compositional Gradient Descent Method for Federated Multi-Level Compositional Optimization
481. ICML 2024A Geometric Decomposition of Finite Games: Convergence vs. Recurrence under Exponential Weights
482. ICML 2024A Global Geometric Analysis of Maximal Coding Rate Reduction
483. ICML 2024A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
484. ICML 2024A New Linear Scaling Rule for Private Adaptive Hyperparameter Optimization
485. ICML 2024A New Theoretical Perspective on Data Heterogeneity in Federated Optimization
486. ICML 2024A Study of First-Order Methods with a Deterministic Relative-Error Gradient Oracle
487. ICML 2024A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles
488. ICML 2024Absolute Policy Optimization: Enhancing Lower Probability Bound of Performance with High Confidence
489. ICML 2024Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
490. ICML 2024Accelerating Convergence of Score-Based Diffusion Models, Provably
491. ICML 2024Accelerating Look-ahead in Bayesian Optimization: Multilevel Monte Carlo is All you Need
492. ICML 2024ACPO: A Policy Optimization Algorithm for Average MDPs with Constraints
493. ICML 2024Activation-Descent Regularization for Input Optimization of ReLU Networks
494. ICML 2024Adaptive-Gradient Policy Optimization: Enhancing Policy Learning in Non-Smooth Differentiable Simulations
495. ICML 2024Advancing Dynamic Sparse Training by Exploring Optimization Opportunities
496. ICML 2024An Iterative Min-Min Optimization Method for Sparse Bayesian Learning
497. ICML 2024An Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization
498. ICML 2024Autonomous Sparse Mean-CVaR Portfolio Optimization
499. ICML 2024Barrier Algorithms for Constrained Non-Convex Optimization
500. ICML 2024Bayesian Optimization of Function Networks with Partial Evaluations

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.