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

541 papers, page 6 of 11

251. ICLR 2025Geometric Inductive Biases of Deep Networks: The Role of Data and Architecture
252. ICLR 2025Global Convergence in Neural ODEs: Impact of Activation Functions
253. ICLR 2025GOAL: A Generalist Combinatorial Optimization Agent Learner
254. ICLR 2025Gradient correlation is a key ingredient to accelerate SGD with momentum
255. ICLR 2025Gradient descent with generalized Newton’s method
256. ICLR 2025How Does Critical Batch Size Scale in Pre-training?
257. ICLR 2025Improved Approximation Algorithms for $k$-Submodular Maximization via Multilinear Extension
258. ICLR 2025Improved Techniques for Optimization-Based Jailbreaking on Large Language Models
259. ICLR 2025Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
260. ICLR 2025Joint Gradient Balancing for Data Ordering in Finite-Sum Multi-Objective Optimization
261. ICLR 2025LancBiO: Dynamic Lanczos-aided Bilevel Optimization via Krylov Subspace
262. ICLR 2025Last Iterate Convergence of Incremental Methods as a Model of Forgetting
263. ICLR 2025Latent Bayesian Optimization via Autoregressive Normalizing Flows
264. ICLR 2025LDAdam: Adaptive Optimization from Low-Dimensional Gradient Statistics
265. ICLR 2025Learning to Explore and Exploit with GNNs for Unsupervised Combinatorial Optimization
266. ICLR 2025Learning to Solve Differential Equation Constrained Optimization Problems
267. ICLR 2025Learning-Guided Rolling Horizon Optimization for Long-Horizon Flexible Job-Shop Scheduling
268. ICLR 2025LICO: Large Language Models for In-Context Molecular Optimization
269. ICLR 2025LLMOPT: Learning to Define and Solve General Optimization Problems from Scratch
270. ICLR 2025Local convergence of simultaneous min-max algorithms to differential equilibrium on Riemannian manifold
271. ICLR 2025Local Loss Optimization in the Infinite Width: Stable Parameterization of Predictive Coding Networks and Target Propagation
272. ICLR 2025Local Steps Speed Up Local GD for Heterogeneous Distributed Logistic Regression
273. ICLR 2025LoRA Done RITE: Robust Invariant Transformation Equilibration for LoRA Optimization
274. ICLR 2025Magnetic Preference Optimization: Achieving Last-iterate Convergence for Language Model Alignment
275. ICLR 2025Mask in the Mirror: Implicit Sparsification
276. ICLR 2025Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity
277. ICLR 2025Methods with Local Steps and Random Reshuffling for Generally Smooth Non-Convex Federated Optimization
278. ICLR 2025MGDA Converges under Generalized Smoothness, Provably
279. ICLR 2025Nesterov acceleration in benignly non-convex landscapes
280. ICLR 2025Neural Dueling Bandits: Preference-Based Optimization with Human Feedback
281. ICLR 2025Neural Exploratory Landscape Analysis for Meta-Black-Box-Optimization
282. ICLR 2025Newton Meets Marchenko-Pastur: Massively Parallel Second-Order Optimization with Hessian Sketching and Debiasing
283. ICLR 2025No Preference Left Behind: Group Distributional Preference Optimization
284. ICLR 2025Non-Equilibrium Dynamics of Hybrid Continuous-Discrete Ground-State Sampling
285. ICLR 2025Nonasymptotic Analysis of Stochastic Gradient Descent with the Richardson–Romberg Extrapolation
286. ICLR 2025Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping
287. ICLR 2025Nonlinear Sequence Embedding by Monotone Variational Inequality
288. ICLR 2025Offline Hierarchical Reinforcement Learning via Inverse Optimization
289. ICLR 2025Offline Model-Based Optimization by Learning to Rank
290. ICLR 2025On Stochastic Contextual Bandits with Knapsacks in Small Budget Regime
291. ICLR 2025On the Almost Sure Convergence of the Stochastic Three Points Algorithm
292. ICLR 2025On the Optimization and Generalization of Two-layer Transformers with Sign Gradient Descent
293. ICLR 2025On the Optimization Landscape of Low Rank Adaptation Methods for Large Language Models
294. ICLR 2025OPTAMI: Global Superlinear Convergence of High-order Methods
295. ICLR 2025Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
296. ICLR 2025Optimization by Parallel Quasi-Quantum Annealing with Gradient-Based Sampling
297. ICLR 2025Optimizing $(L_0, L_1)$-Smooth Functions by Gradient Methods
298. ICLR 2025Optimizing importance weighting in the presence of sub-population shifts
299. ICLR 2025Optimizing Neural Network Representations of Boolean Networks
300. ICLR 2025Optimizing Posterior Samples for Bayesian Optimization via Rootfinding

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.