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
736 papers, page 9 of 15
- ICML 2025Multi-Objective Causal Bayesian Optimization
- ICML 2025Multi-Timescale Dynamics Model Bayesian Optimization for Plasma Stabilization in Tokamaks
- ICML 2025Multidimensional Adaptive Coefficient for Inference Trajectory Optimization in Flow and Diffusion
- ICML 2025Multiobjective distribution matching
- ICML 2025Natural Perturbations for Black-box Training of Neural Networks by Zeroth-Order Optimization
- ICML 2025Nesterov Method for Asynchronous Pipeline Parallel Optimization
- ICML 2025Neural Event-Triggered Control with Optimal Scheduling
- ICML 2025Neural Solver Selection for Combinatorial Optimization
- ICML 2025Non-Asymptotic and Non-Lipschitzian Bounds on Optimal Values in Stochastic Optimization Under Heavy Tails
- ICML 2025Nonconvex Theory of $M$-estimators with Decomposable Regularizers
- ICML 2025Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness
- ICML 2025On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
- ICML 2025On The Concurrence of Layer-wise Preconditioning Methods and Provable Feature Learning
- ICML 2025On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning
- ICML 2025One-Step Generalization Ratio Guided Optimization for Domain Generalization
- ICML 2025Online Conformal Prediction via Online Optimization
- ICML 2025Optimal Transport Barycenter via Nonconvex-Concave Minimax Optimization
- ICML 2025Optimization for Neural Operators can Benefit from Width
- ICML 2025Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees
- ICML 2025Optimization Proxies using Limited Labeled Data and Training Time -- A Semi-Supervised Bayesian Neural Network Approach
- ICML 2025PARQ: Piecewise-Affine Regularized Quantization
- ICML 2025PipeOffload: Improving Scalability of Pipeline Parallelism with Memory Optimization
- ICML 2025Position: Iterative Online-Offline Joint Optimization is Needed to Manage Complex LLM Copyright Risks
- ICML 2025Posterior Inference with Diffusion Models for High-dimensional Black-box Optimization
- ICML 2025Preconditioned Riemannian Gradient Descent Algorithm for Low-Multilinear-Rank Tensor Completion
- ICML 2025Preference Optimization for Combinatorial Optimization Problems
- ICML 2025Privacy-Preserving Federated Convex Optimization: Balancing Partial-Participation and Efficiency via Noise Cancellation
- ICML 2025Probabilistic Group Mask Guided Discrete Optimization for Incremental Learning
- ICML 2025Provable Benefit of Random Permutations over Uniform Sampling in Stochastic Coordinate Descent
- ICML 2025Provable Policy Gradient for Robust Average-Reward MDPs Beyond Rectangularity
- ICML 2025Quantum Optimization via Gradient-Based Hamiltonian Descent
- ICML 2025R.I.P.: Better Models by Survival of the Fittest Prompts
- ICML 2025Radio: Rate–Distortion Optimization for Large Language Model Compression
- ICML 2025Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
- ICML 2025Rapid Overfitting of Multi-Pass SGD in Stochastic Convex Optimization
- ICML 2025Recommendations with Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization
- ICML 2025Reducing Variance of Stochastic Optimization for Approximating Nash Equilibria in Normal-Form Games
- ICML 2025Refining Adaptive Zeroth-Order Optimization at Ease
- ICML 2025Regularized Langevin Dynamics for Combinatorial Optimization
- ICML 2025Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness
- ICML 2025Revolve: Optimizing AI Systems by Tracking Response Evolution in Textual Optimization
- ICML 2025Riemannian Diffusion Adaptation for Distributed Optimization on Manifolds
- ICML 2025Right Now, Wrong Then: Non-Stationary Direct Preference Optimization under Preference Drift
- ICML 2025Ringmaster ASGD: The First Asynchronous SGD with Optimal Time Complexity
- ICML 2025Robust Sparsification via Sensitivity
- ICML 2025ROPO: Robust Preference Optimization for Large Language Models
- ICML 2025SAFE: Finding Sparse and Flat Minima to Improve Pruning
- ICML 2025Sassha: Sharpness-aware Adaptive Second-order Optimization with Stable Hessian Approximation
- ICML 2025Scaffold with Stochastic Gradients: New Analysis with Linear Speed-Up
- ICML 2025Scalable Meta-Learning via Mixed-Mode Differentiation
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.