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 5 of 11

201. ICLR 2025ADMM for Structured Fractional Minimization
202. ICLR 2025Adversarial Policy Optimization for Offline Preference-based Reinforcement Learning
203. ICLR 2025Adversarial Search Engine Optimization for Large Language Models
204. ICLR 2025Aioli: A Unified Optimization Framework for Language Model Data Mixing
205. ICLR 2025An Asynchronous Bundle Method for Distributed Learning Problems
206. ICLR 2025An Effective Manifold-based Optimization Method for Distributionally Robust Classification
207. ICLR 2025Approximation algorithms for combinatorial optimization with predictions
208. ICLR 2025Attention with Markov: A Curious Case of Single-layer Transformers
209. ICLR 2025Bayesian Optimization via Continual Variational Last Layer Training
210. ICLR 2025Beyond Linear Approximations: A Novel Pruning Approach for Attention Matrix
211. ICLR 2025Bi-Factorial Preference Optimization: Balancing Safety-Helpfulness in Language Models
212. ICLR 2025Boosting Neural Combinatorial Optimization for Large-Scale Vehicle Routing Problems
213. ICLR 2025Boosting Perturbed Gradient Ascent for Last-Iterate Convergence in Games
214. ICLR 2025Bounds on $L_p$ Errors in Density Ratio Estimation via $f$-Divergence Loss Functions
215. ICLR 2025BP-Modified Local Loss for Efficient Training of Deep Neural Networks
216. ICLR 2025Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation
217. ICLR 2025Can Reinforcement Learning Solve Asymmetric Combinatorial-Continuous Zero-Sum Games?
218. ICLR 2025Cauchy-Schwarz Regularizers
219. ICLR 2025Causal Discovery via Bayesian Optimization
220. ICLR 2025CHiP: Cross-modal Hierarchical Direct Preference Optimization for Multimodal LLMs
221. ICLR 2025Collaborative Discrete-Continuous Black-Box Prompt Learning for Language Models
222. ICLR 2025Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
223. ICLR 2025CONGO: Compressive Online Gradient Optimization
224. ICLR 2025Controllable Unlearning for Image-to-Image Generative Models via $\epsilon$-Constrained Optimization
225. ICLR 2025Convergence of Distributed Adaptive Optimization with Local Updates
226. ICLR 2025Decentralized Optimization with Coupled Constraints
227. ICLR 2025Decision Information Meets Large Language Models: The Future of Explainable Operations Research
228. ICLR 2025Deconstructing What Makes a Good Optimizer for Autoregressive Language Models
229. ICLR 2025Deep Distributed Optimization for Large-Scale Quadratic Programming
230. ICLR 2025DeepTAGE: Deep Temporal-Aligned Gradient Enhancement for Optimizing Spiking Neural Networks
231. ICLR 2025Differentially private optimization for non-decomposable objective functions
232. ICLR 2025Diffusion Models are Evolutionary Algorithms
233. ICLR 2025Dimension Agnostic Neural Processes
234. ICLR 2025DiSK: Differentially Private Optimizer with Simplified Kalman Filter for Noise Reduction
235. ICLR 2025DLEFT-MKC: Dynamic Late Fusion Multiple Kernel Clustering with Robust Tensor Learning via Min-Max Optimization
236. ICLR 2025Do Stochastic, Feel Noiseless: Stable Stochastic Optimization via a Double Momentum Mechanism
237. ICLR 2025Does SGD really happen in tiny subspaces?
238. ICLR 2025Earlier Tokens Contribute More: Learning Direct Preference Optimization From Temporal Decay Perspective
239. ICLR 2025Efficient and Robust Neural Combinatorial Optimization via Wasserstein-Based Coresets
240. ICLR 2025Efficient Interpolation between Extragradient and Proximal Methods for Weak MVIs
241. ICLR 2025Efficient Sparse PCA via Block-Diagonalization
242. ICLR 2025Entropy-based Activation Function Optimization: A Method on Searching Better Activation Functions
243. ICLR 2025Fair Submodular Cover
244. ICLR 2025Few for Many: Tchebycheff Set Scalarization for Many-Objective Optimization
245. ICLR 2025FlashRNN: I/O-Aware Optimization of Traditional RNNs on modern hardware
246. ICLR 2025FLOPS: Forward Learning with OPtimal Sampling
247. ICLR 2025From Decoupling to Adaptive Transformation: a Wider Optimization Space for PTQ
248. ICLR 2025From Promise to Practice: Realizing High-performance Decentralized Training
249. ICLR 2025Functional Homotopy: Smoothing Discrete Optimization via Continuous Parameters for LLM Jailbreak Attacks
250. ICLR 2025Generating Likely Counterfactuals Using Sum-Product Networks

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.