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

667 papers, page 7 of 14

301. ICML 2025Learning Robust Neural Processes with Risk-Averse Stochastic Optimization
302. ICML 2025Linear convergence of Sinkhorn's algorithm for generalized static Schrödinger bridge
303. ICML 2025LLM Data Selection and Utilization via Dynamic Bi-level Optimization
304. ICML 2025Maximizing Intermediate Checkpoint Value in LLM Pretraining with Bayesian Optimization
305. ICML 2025MERIT: Maximum-normalized Element-wise Ratio for Language Model Large-batch Training
306. ICML 2025Meta-Black-Box-Optimization through Offline Q-function Learning
307. ICML 2025MetaOptimize: A Framework for Optimizing Step Sizes and Other Meta-parameters
308. ICML 2025MITIGATING OVER-EXPLORATION IN LATENT SPACE OPTIMIZATION USING LES
309. ICML 2025MixMin: Finding Data Mixtures via Convex Minimization
310. ICML 2025Model Immunization from a Condition Number Perspective
311. ICML 2025Multi-Objective Causal Bayesian Optimization
312. ICML 2025Multi-Timescale Dynamics Model Bayesian Optimization for Plasma Stabilization in Tokamaks
313. ICML 2025Multidimensional Adaptive Coefficient for Inference Trajectory Optimization in Flow and Diffusion
314. ICML 2025Multiobjective distribution matching
315. ICML 2025Natural Perturbations for Black-box Training of Neural Networks by Zeroth-Order Optimization
316. ICML 2025Nesterov Method for Asynchronous Pipeline Parallel Optimization
317. ICML 2025Neural Event-Triggered Control with Optimal Scheduling
318. ICML 2025Neural Solver Selection for Combinatorial Optimization
319. ICML 2025Non-Asymptotic and Non-Lipschitzian Bounds on Optimal Values in Stochastic Optimization Under Heavy Tails
320. ICML 2025Nonconvex Theory of $M$-estimators with Decomposable Regularizers
321. ICML 2025Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness
322. ICML 2025On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
323. ICML 2025On The Concurrence of Layer-wise Preconditioning Methods and Provable Feature Learning
324. ICML 2025On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning
325. ICML 2025One-Step Generalization Ratio Guided Optimization for Domain Generalization
326. ICML 2025Online Conformal Prediction via Online Optimization
327. ICML 2025Optimal Transport Barycenter via Nonconvex-Concave Minimax Optimization
328. ICML 2025Optimization for Neural Operators can Benefit from Width
329. ICML 2025Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees
330. ICML 2025Optimization Proxies using Limited Labeled Data and Training Time -- A Semi-Supervised Bayesian Neural Network Approach
331. ICML 2025PARQ: Piecewise-Affine Regularized Quantization
332. ICML 2025PipeOffload: Improving Scalability of Pipeline Parallelism with Memory Optimization
333. ICML 2025Position: Iterative Online-Offline Joint Optimization is Needed to Manage Complex LLM Copyright Risks
334. ICML 2025Posterior Inference with Diffusion Models for High-dimensional Black-box Optimization
335. ICML 2025Preconditioned Riemannian Gradient Descent Algorithm for Low-Multilinear-Rank Tensor Completion
336. ICML 2025Preference Optimization for Combinatorial Optimization Problems
337. ICML 2025Privacy-Preserving Federated Convex Optimization: Balancing Partial-Participation and Efficiency via Noise Cancellation
338. ICML 2025Probabilistic Group Mask Guided Discrete Optimization for Incremental Learning
339. ICML 2025Provable Benefit of Random Permutations over Uniform Sampling in Stochastic Coordinate Descent
340. ICML 2025Provable Policy Gradient for Robust Average-Reward MDPs Beyond Rectangularity
341. ICML 2025Quantum Optimization via Gradient-Based Hamiltonian Descent
342. ICML 2025R.I.P.: Better Models by Survival of the Fittest Prompts
343. ICML 2025Radio: Rate–Distortion Optimization for Large Language Model Compression
344. ICML 2025Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
345. ICML 2025Rapid Overfitting of Multi-Pass SGD in Stochastic Convex Optimization
346. ICML 2025Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization
347. ICML 2025Reducing Variance of Stochastic Optimization for Approximating Nash Equilibria in Normal-Form Games
348. ICML 2025Refining Adaptive Zeroth-Order Optimization at Ease
349. ICML 2025Regularized Langevin Dynamics for Combinatorial Optimization
350. ICML 2025Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness

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.