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

757 papers, page 6 of 16

251. ICML 2026Autoregressive Direct Preference Optimization
252. ICML 2026Balanced LoRA: Removing Parameter Invariance to Accelerate Convergence
253. ICML 2026Bilevel Optimization over Saddle Points of Zero-Sum Markov Games
254. ICML 2026Black-Box Combinatorial Optimization with Order-Invariant Reinforcement Learning
255. ICML 2026Boosting CVaR Policy Optimization with Quantile Gradients
256. ICML 2026Bregman meets Lévy: Stochastic Mirror Descent with Heavy-Tailed Noise in Continuous and Discrete Time
257. ICML 2026Bridging Spherical Black-Box Optimizers
258. ICML 2026Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad
259. ICML 2026Can Computational Reducibility Lead to Transferable Models for Graph Combinatorial Optimization?
260. ICML 2026Certificate-Guided Pruning for Stochastic Lipschitz Optimization
261. ICML 2026CIRBench: Evaluating Large Language Models as LLVM IR Optimizers
262. ICML 2026Clipping Makes Distributed and Federated Asynchronous SGD Robust to Stragglers
263. ICML 2026Compact Conformal Subgraphs
264. ICML 2026Complexity of Decentralized Optimization with Mixed Affine Constraints
265. ICML 2026Conflicting Biases at the Edge of Stability: Norm versus Sharpness Regularization
266. ICML 2026Conformal Prediction for Early Stopping in Mixed Integer Optimization
267. ICML 2026Constructing Industrial-Scale Optimization Modeling Benchmark
268. ICML 2026Context Tuning for In-Context Optimization
269. ICML 2026Convergence Analysis of Decentralized Hessian-/Jacobian-Free Algorithm for Nonconvex Stochastic Bilevel Optimization
270. ICML 2026Convergence Analysis of the Lion Optimizer in Centralized and Distributed Settings
271. ICML 2026Convergence of Steepest Descent and Adam under Non-Uniform Smoothness
272. ICML 2026Convergence Rate Analysis of the AdamW-Style Shampoo: Unifying One-Sided and Two-Sided Preconditioning
273. ICML 2026Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
274. ICML 2026Convex Basins in Single-Index Model Loss Landscapes: Applications to Robust Recovery under Strong Adversarial Corruption
275. ICML 2026Cost-aware Stopping for Bayesian Optimization
276. ICML 2026CurvZO: Adaptive Curvature-Guided Sparse Zeroth-Order Optimization for Efficient LLM Fine-Tuning
277. ICML 2026DASH: Faster Shampoo via Batched Block Preconditioning and Efficient Inverse-Root Solvers
278. ICML 2026Data Agent: Learning to Select Data via End-to-End Dynamic Optimization
279. ICML 2026Data Reconstruction: Identifiability and Optimization with Sample Splitting
280. ICML 2026Data-driven Mixed Integer Optimization through Probabilistic Multi-variable Branching
281. ICML 2026DB-KSVD: Scalable Alternating Optimization for Disentangling High-Dimensional Embedding Spaces
282. ICML 2026DDSVM: A Differentiable Framework for Deep Support Vector Machines with Iterative Geometry-Aware Optimization
283. ICML 2026Decision-focused Sparse Tangent Portfolio Optimization
284. ICML 2026DecomPose: Disentangling Cross-Category Optimization Contention for Category-Level 6D Object Pose Estimation
285. ICML 2026Decoupling Variance and Scale-Invariant Updates in Adaptive Gradient Descent for Unified Vector and Matrix Optimization
286. ICML 2026Delayed Momentum Aggregation: Communication-efficient Byzantine-robust Federated Learning with Partial Participation
287. ICML 2026Depth over Fidelity in Fixed-Budget Noisy Evolution Strategies
288. ICML 2026Depth-Progressive Monotonic Learning without Global Backpropagation
289. ICML 2026Design Linear Constrained Neural Layers with Implicit Convex Optimization
290. ICML 2026Detecting Fluent Optimization-Based Adversarial Prompts via Sequential Entropy Changes
291. ICML 2026DiffStyle3D: Consistent 3D Gaussian Stylization via Attention Optimization
292. ICML 2026Diffusion-based learning framework for Constrained Nonconvex Optimization with Weighted Bootstrapped Refinement
293. ICML 2026Dimension-Independent Convergence of Underdamped Langevin Monte Carlo in KL Divergence
294. ICML 2026DisjunctiveNet: Neural Symbolic Learning via Differentiable Convexified Optimization Layers
295. ICML 2026Distributed Stochastic $K$-Level Optimization Over Networks
296. ICML 2026Distributionally Robust Set Representation Learning Under Inference-Time Element Corruption
297. ICML 2026Divide and Learn: Multi-Objective Combinatorial Optimization at Scale
298. ICML 2026Do Transformers Need Three Projections? Systematic Study of QKV Variants
299. ICML 2026Do We Need Adam? Surprisingly Strong and Sparse Reinforcement Learning with SGD in LLMs
300. ICML 2026DREAM: A Unified Framework for Drift-Corrected Federated Multi-Objective Learning

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.