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
98 papers, page 1 of 2
- ICML 2023A Distribution Optimization Framework for Confidence Bounds of Risk Measures
- ICML 2023A Fully First-Order Method for Stochastic Bilevel Optimization
- ICML 2023A Theoretical Analysis of the Learning Dynamics under Class Imbalance
- ICML 2023Accelerated Cyclic Coordinate Dual Averaging with Extrapolation for Composite Convex Optimization
- ICML 2023Accelerated Infeasibility Detection of Constrained Optimization and Fixed-Point Iterations
- ICML 2023Accelerated Stochastic Optimization Methods under Quasar-convexity
- ICML 2023Adaptively Weighted Data Augmentation Consistency Regularization for Robust Optimization under Concept Shift
- ICML 2023Analysis of Error Feedback in Federated Non-Convex Optimization with Biased Compression: Fast Convergence and Partial Participation
- ICML 2023Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization
- ICML 2023Automatically Auditing Large Language Models via Discrete Optimization
- ICML 2023Averaged Method of Multipliers for Bi-Level Optimization without Lower-Level Strong Convexity
- ICML 2023Bandit Online Linear Optimization with Hints and Queries
- ICML 2023Best of Both Worlds Policy Optimization
- ICML 2023Beyond Lipschitz Smoothness: A Tighter Analysis for Nonconvex Optimization
- ICML 2023Beyond Uniform Lipschitz Condition in Differentially Private Optimization
- ICML 2023Bilevel Optimization with Coupled Decision-Dependent Distributions
- ICML 2023Bit Allocation using Optimization
- ICML 2023Buying Information for Stochastic Optimization
- ICML 2023CO-BED: Information-Theoretic Contextual Optimization via Bayesian Experimental Design
- ICML 2023Competitive Gradient Optimization
- ICML 2023Compressed Decentralized Proximal Stochastic Gradient Method for Nonconvex Composite Problems with Heterogeneous Data
- ICML 2023Constrained Causal Bayesian Optimization
- ICML 2023Constrained Efficient Global Optimization of Expensive Black-box Functions
- ICML 2023Constrained Optimization via Exact Augmented Lagrangian and Randomized Iterative Sketching
- ICML 2023Convergence of First-Order Methods for Constrained Nonconvex Optimization with Dependent Data
- ICML 2023Critical Points and Convergence Analysis of Generative Deep Linear Networks Trained with Bures-Wasserstein Loss
- ICML 2023Cut your Losses with Squentropy
- ICML 2023Cyclic Block Coordinate Descent With Variance Reduction for Composite Nonconvex Optimization
- ICML 2023DADAO: Decoupled Accelerated Decentralized Asynchronous Optimization
- ICML 2023Decentralized Stochastic Bilevel Optimization with Improved per-Iteration Complexity
- ICML 2023Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback
- ICML 2023DIFF2: Differential Private Optimization via Gradient Differences for Nonconvex Distributed Learning
- ICML 2023Differentially Private Stochastic Convex Optimization under a Quantile Loss Function
- ICML 2023Diffusion Models for Black-Box Optimization
- ICML 2023Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost
- ICML 2023DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule
- ICML 2023Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time
- ICML 2023EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compression
- ICML 2023Efficient displacement convex optimization with particle gradient descent
- ICML 2023Efficient Exploration via Epistemic-Risk-Seeking Policy Optimization
- ICML 2023End-to-End Learning for Stochastic Optimization: A Bayesian Perspective
- ICML 2023Escaping saddle points in zeroth-order optimization: the power of two-point estimators
- ICML 2023Fast as CHITA: Neural Network Pruning with Combinatorial Optimization
- ICML 2023Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
- ICML 2023Faster Rates of Convergence to Stationary Points in Differentially Private Optimization
- ICML 2023Federated Online and Bandit Convex Optimization
- ICML 2023FedHPO-Bench: A Benchmark Suite for Federated Hyperparameter Optimization
- ICML 2023Generalized Polyak Step Size for First Order Optimization with Momentum
- ICML 2023Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization
- ICML 2023Generative Pretraining for Black-Box Optimization
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.