Nonconvex Optimization papers, 2023–2026
Convergence and landscapes
Scope: NeurIPS, ICLR, ICML and CVPR, 2023–2026. 2,330 papers are tagged with this topic.
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.
Papers per venue
Counts by year and venue
| Year | NeurIPS | ICLR | ICML | CVPR | Total |
|---|---|---|---|---|---|
| 2023 | 154 | 79 | 98 | 15 | 346 |
| 2024 | 275 | 107 | 160 | 18 | 560 |
| 2025 | 279 | 177 | 192 | 19 | 667 |
| 2026 | 250 | 178 | 286 | 43 | 757 |
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 44 of 47
- ICML 2023Open-VCLIP: Transforming CLIP to an Open-vocabulary Video Model via Interpolated Weight Optimization
- ICML 2023Optimal Shrinkage for Distributed Second-Order Optimization
- ICML 2023Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
- ICML 2023Optimization for Amortized Inverse Problems
- ICML 2023PASTA: Pessimistic Assortment Optimization
- ICML 2023Quantized Distributed Training of Large Models with Convergence Guarantees
- ICML 2023Quantum Lower Bounds for Finding Stationary Points of Nonconvex Functions
- ICML 2023Randomized Gaussian Process Upper Confidence Bound with Tighter Bayesian Regret Bounds
- ICML 2023Revisiting Domain Randomization via Relaxed State-Adversarial Policy Optimization
- ICML 2023Revisiting Sampling for Combinatorial Optimization
- ICML 2023Second-Order Optimization with Lazy Hessians
- ICML 2023Self-Attention Amortized Distributional Projection Optimization for Sliced Wasserstein Point-Cloud Reconstruction
- ICML 2023Semi Bandit dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees.
- ICML 2023Single Point-Based Distributed Zeroth-Order Optimization with a Non-Convex Stochastic Objective Function
- ICML 2023SLAMB: Accelerated Large Batch Training with Sparse Communication
- ICML 2023Stochastic Marginal Likelihood Gradients using Neural Tangent Kernels
- ICML 2023Straightening Out the Straight-Through Estimator: Overcoming Optimization Challenges in Vector Quantized Networks
- ICML 2023Submodular Order Functions and Assortment Optimization
- ICML 2023SurCo: Learning Linear SURrogates for COmbinatorial Nonlinear Optimization Problems
- ICML 2023Target-based Surrogates for Stochastic Optimization
- ICML 2023Tight Certification of Adversarially Trained Neural Networks via Nonconvex Low-Rank Semidefinite Relaxations
- ICML 2023Towards Practical Preferential Bayesian Optimization with Skew Gaussian Processes
- ICML 2023Transformer-based Stagewise Decomposition for Large-Scale Multistage Stochastic Optimization
- ICML 2023Two Losses Are Better Than One: Faster Optimization Using a Cheaper Proxy
- ICML 2023Understand and Modularize Generator Optimization in ELECTRA-style Pretraining
- ICML 2023User-level Private Stochastic Convex Optimization with Optimal Rates
- NeurIPS 2023(Amplified) Banded Matrix Factorization: A unified approach to private training
- NeurIPS 2023[Re] Bandit Theory and Thompson Sampling-guided Directed Evolution for Sequence Optimization
- NeurIPS 20232Direction: Theoretically Faster Distributed Training with Bidirectional Communication Compression
- NeurIPS 2023A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings
- NeurIPS 2023A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting
- NeurIPS 2023A Finite-Particle Convergence Rate for Stein Variational Gradient Descent
- NeurIPS 2023A Single-Loop Accelerated Extra-Gradient Difference Algorithm with Improved Complexity Bounds for Constrained Minimax Optimization
- NeurIPS 2023A Unified Approach for Maximizing Continuous DR-submodular Functions
- NeurIPS 2023A Unified Discretization Framework for Differential Equation Approach with Lyapunov Arguments for Convex Optimization
- NeurIPS 2023A Unified Framework for Rank-based Loss Minimization
- NeurIPS 2023Accelerated Quasi-Newton Proximal Extragradient: Faster Rate for Smooth Convex Optimization
- NeurIPS 2023Accelerated Zeroth-order Method for Non-Smooth Stochastic Convex Optimization Problem with Infinite Variance
- NeurIPS 2023Achieving $\mathcal{O}(\epsilon^{-1.5})$ Complexity in Hessian/Jacobian-free Stochastic Bilevel Optimization
- NeurIPS 2023Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance Reduction
- NeurIPS 2023Advancing Bayesian Optimization via Learning Correlated Latent Space
- NeurIPS 2023An Alternating Optimization Method for Bilevel Problems under the Polyak-Łojasiewicz Condition
- NeurIPS 2023An Exploration-by-Optimization Approach to Best of Both Worlds in Linear Bandits
- NeurIPS 2023An Optimal Structured Zeroth-order Algorithm for Non-smooth Optimization
- NeurIPS 2023An Optimization-based Approach To Node Role Discovery in Networks: Approximating Equitable Partitions
- NeurIPS 2023AutoGO: Automated Computation Graph Optimization for Neural Network Evolution
- NeurIPS 2023Batch Bayesian Optimization For Replicable Experimental Design
- NeurIPS 2023Bias in Evaluation Processes: An Optimization-Based Model
- NeurIPS 2023Bicriteria Approximation Algorithms for the Submodular Cover Problem
- NeurIPS 2023Bilevel Optimization with a Lower-level Contraction: Optimal Sample Complexity without Warm-Start
Ask about this trend from Claude or Cursor
Connect the Paperlist MCP and your assistant can pull the numbers on this page while you draft a survey, pick a direction or plan a submission: papers per year and venue, growth, the fastest-rising sub-themes and representative papers, shaped around your question.
Copy this prompt into your assistant
Use paperlist to show how Nonconvex Optimization papers grew at NeurIPS from 2023 to 2026, and which year jumped the most.
Tool the assistant calls: get_topic_stats {"topic": "nonconvex-optimization"}
Set up Paperlist MCP in two minutes (Claude Code, Cursor, Codex, ChatGPT)
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.