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 7 of 15

301. ICML 2025Aequa: Fair Model Rewards in Collaborative Learning via Slimmable Networks
302. ICML 2025AMPO: Active Multi Preference Optimization for Self-play Preference Selection
303. ICML 2025An Online Adaptive Sampling Algorithm for Stochastic Difference-of-convex Optimization with Time-varying Distributions
304. ICML 2025Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster
305. ICML 2025Attention-Only Transformers via Unrolled Subspace Denoising
306. ICML 2025Autoformulation of Mathematical Optimization Models Using LLMs
307. ICML 2025Automatic Differentiation of Optimization Algorithms with Time-Varying Updates
308. ICML 2025BackSlash: Rate Constrained Optimized Training of Large Language Models
309. ICML 2025BARK: A Fully Bayesian Tree Kernel for Black-box Optimization
310. ICML 2025Behavior-Regularized Diffusion Policy Optimization for Offline Reinforcement Learning
311. ICML 2025BILBO: BILevel Bayesian Optimization
312. ICML 2025BOPO: Neural Combinatorial Optimization via Best-anchored and Objective-guided Preference Optimization
313. ICML 2025BSO: Binary Spiking Online Optimization Algorithm
314. ICML 2025Clipped SGD Algorithms for Performative Prediction: Tight Bounds for Stochastic Bias and Remedies
315. ICML 2025Clipping Improves Adam-Norm and AdaGrad-Norm when the Noise Is Heavy-Tailed
316. ICML 2025COExpander: Adaptive Solution Expansion for Combinatorial Optimization
317. ICML 2025Compute or Load KV Cache? Why Not Both?
318. ICML 2025ConfPO: Exploiting Policy Model Confidence for Critical Token Selection in Preference Optimization
319. ICML 2025Consensus Based Stochastic Optimal Control
320. ICML 2025Constant Stepsize Local GD for Logistic Regression: Acceleration by Instability
321. ICML 2025Constrained Online Convex Optimization with Polyak Feasibility Steps
322. ICML 2025Contextual Optimization Under Model Misspecification: A Tractable and Generalizable Approach
323. ICML 2025Convergence of Mean-Field Langevin Stochastic Descent-Ascent for Distributional Minimax Optimization
324. ICML 2025Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
325. ICML 2025Cover learning for large-scale topology representation
326. ICML 2025Density Ratio Estimation-based Bayesian Optimization with Semi-Supervised Learning
327. ICML 2025Differentiable Quadratic Optimization For the Maximum Independent Set Problem
328. ICML 2025Differentiable Structure Learning with Ancestral Constraints
329. ICML 2025Direct Density Ratio Optimization: A Statistically Consistent Approach to Aligning Large Language Models
330. ICML 2025Discrepancy Minimization in Input-Sparsity Time
331. ICML 2025Distributed Event-Based Learning via ADMM
332. ICML 2025Distributed Retraction-Free and Communication-Efficient Optimization on the Stiefel Manifold
333. ICML 2025DTZO: Distributed Trilevel Zeroth Order Learning with Provable Non-Asymptotic Convergence
334. ICML 2025Dueling Convex Optimization with General Preferences
335. ICML 2025EARL-BO: Reinforcement Learning for Multi-Step Lookahead, High-Dimensional Bayesian Optimization
336. ICML 2025Efficient Bisection Projection to Ensure Neural-Network Solution Feasibility for Optimization over General Set
337. ICML 2025Efficient Curvature-Aware Hypergradient Approximation for Bilevel Optimization
338. ICML 2025Efficient Distributed Optimization under Heavy-Tailed Noise
339. ICML 2025Efficient First-Order Optimization on the Pareto Set for Multi-Objective Learning under Preference Guidance
340. ICML 2025Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
341. ICML 2025Efficient Skill Discovery via Regret-Aware Optimization
342. ICML 2025ELMO : Efficiency via Low-precision and Peak Memory Optimization in Large Output Spaces
343. ICML 2025Empower Structure-Based Molecule Optimization with Gradient Guided Bayesian Flow Networks
344. ICML 2025Enabling Optimal Decisions in Rehearsal Learning under CARE Condition
345. ICML 2025Enhancing Parallelism in Decentralized Stochastic Convex Optimization
346. ICML 2025Ensemble Learned Bloom Filters: Two Oracles are Better than One
347. ICML 2025EquivaMap: Leveraging LLMs for Automatic Equivalence Checking of Optimization Formulations
348. ICML 2025Exploiting Curvature in Online Convex Optimization with Delayed Feedback
349. ICML 2025Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization
350. ICML 2025Extreme Value Policy Optimization for Safe Reinforcement 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.