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

2,330 papers, page 8 of 47

351. ICML 2026Iterated Population Based Training with Task-Agnostic Restarts
352. ICML 2026Iterative Robust Satisficing: Minimizing Performance Degradation Under Distribution Shift
353. ICML 2026Joint Learning in the Gaussian Single Index Model
354. ICML 2026KernelFoundry: Hardware-Aware Evolutionary GPU Kernel Optimization
355. ICML 2026L-SR1: Learned Symmetric-Rank-One Preconditioning
356. ICML 2026Langevin Rollout Optimization for Modelic Reinforcement Learning
357. ICML 2026Last-iterate Convergence of ADMM on Multi-affine Quadratic Equality Constrained Problem
358. ICML 2026Latent Space Robust Optimization of Neural Processes with Aligned Stratified Order-Statistic Loss Reduction
359. ICML 2026Layer-wise Gradient Disentanglement: Decoupling Semantics and Preferences in Direct Preference Optimization
360. ICML 2026Learning Credal Ensembles via Distributionally Robust Optimization
361. ICML 2026Learning Dynamics of Zeroth-Order Optimization: A Kernel Perspective
362. ICML 2026Learning from Comparison: Constrained Projection Policy Optimization for Pareto-Front Improvement
363. ICML 2026Learning High-Dimensional Parity Functions with Product Networks using Gradient Descent
364. ICML 2026Learning Permutation from Structure Without Supervision
365. ICML 2026Learning Rate Annealing Improves Tuning Robustness in Stochastic Optimization
366. ICML 2026Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts
367. ICML 2026Learning-to-Optimize via Deep Unfolded Flows
368. ICML 2026LILO: Bayesian Optimization with Natural Language Feedback
369. ICML 2026LiMuon: Light and Fast Muon Optimizer for Large Models
370. ICML 2026Linear-Core Surrogates: Smooth Loss Functions with Linear Rates for Classification and Structured Prediction
371. ICML 2026Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noises
372. ICML 2026LK Losses: Direct Acceptance Rate Optimization for Speculative Decoding
373. ICML 2026Local Constrained Bayesian Optimization
374. ICML 2026Local Minima in Quadratic-Penalty Relaxations of Binary Linear Programs
375. ICML 2026Local-Minima-Preserving Polynomial Relaxation of Ising Problems
376. ICML 2026Lookahead Path Likelihood Optimization for Diffusion LLMs
377. ICML 2026Loss-Aware Distributionally Robust Optimization via Trainable Optimal Transport Ambiguity Sets
378. ICML 2026Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
379. ICML 2026LS$^{2}$MC-GDA: A Smoothed Algorithm for Federated Stochastic Multi-Level Compositional Minimax Optimization
380. ICML 2026M+Adam: Low-Precision Training via Additive–Multiplicative Optimization
381. ICML 2026MaxSAT-Based Compression for Tsetlin Machines
382. ICML 2026Mean Flow Policy Optimization
383. ICML 2026Memory Savings at What Cost? A Study of Alternatives to Backpropagation
384. ICML 2026Meta-Black-Box Optimization Can Do Search Guidance for Expensive Constrained Multi-Objective Optimization
385. ICML 2026MineDraft: A Framework for Batch Parallel Speculative Decoding
386. ICML 2026MiniMax Learning of Interpretable Factored Stochastic Policies from Conjoint Data, with Uncertainty Quantification
387. ICML 2026Minimizing Upper Confidence Bounds: A Data-Driven Framework for Stochastic Programming
388. ICML 2026Mirror Descent Under Generalized Smoothness
389. ICML 2026Mirror Mean-Field Langevin Dynamics
390. ICML 2026Mitigating Staleness in Asynchronous Pipeline Parallelism via Basis Rotation
391. ICML 2026MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-regularized Optimization
392. ICML 2026MuCO: Generative Peptide Cyclization Empowered by Multi-stage Conformation Optimization
393. ICML 2026Multi-Objective Bayesian Optimization via Adaptive $\varepsilon$-Constraint Decomposition
394. ICML 2026Nash Equilibria in Games with Playerwise Concave Coupling Constraints: Existence and Computation
395. ICML 2026Natural Hypergradient Descent: Algorithm Design, Convergence Analysis, and Parallel Implementation
396. ICML 2026Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0,L_1)$-Smoothness
397. ICML 2026Neural QAOA$^2$: Differentiable Joint Graph Partitioning and Parameter Initialization for Quantum Combinatorial Optimization
398. ICML 2026Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization
399. ICML 2026Non-Parametric Optimization for Scalable Learning in Stochastic Decision Problems
400. ICML 2026Nonconvex Low-Rank Tensor Representation with Deep Priors for Multiview Subspace Clustering

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.