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

2,330 papers, page 2 of 47

51. ICLR 2026AutoQD: Automatic Discovery of Diverse Behaviors with Quality-Diversity Optimization
52. ICLR 2026Behavioral Embeddings of Programs: A Quasi-Dynamic Approach for Optimization Prediction
53. ICLR 2026BEP: A Binary Error Propagation Algorithm for Binary Neural Networks Training
54. ICLR 2026Beyond Short Steps in Frank-Wolfe Algorithms
55. ICLR 2026Bilevel Optimization with Lower-Level Uniform Convexity: Theory and Algorithm
56. ICLR 2026Binomial Gradient-Based Meta-Learning for Enhanced Meta-Gradient Estimation
57. ICLR 2026Birch SGD: A Tree Graph Framework for Local and Asynchronous SGD Methods
58. ICLR 2026BoGrape: Bayesian optimization over graphs with shortest-path encoded
59. ICLR 2026Breaking the Correlation Plateau: On the Optimization and Capacity Limits of Attention-Based Regressors
60. ICLR 2026Bridging Draft Policy Misalignment: Group Tree Optimization for Speculative Decoding
61. ICLR 2026Byzantine-Robust Federated Learning with Learnable Aggregation Weights
62. ICLR 2026Cautious Weight Decay
63. ICLR 2026Clipped Gradient Methods for Nonsmooth Convex Optimization under Heavy-Tailed Noise: A Refined Analysis
64. ICLR 2026Combinatorial Bandit Bayesian Optimization for Tensor Outputs
65. ICLR 2026Communication-Efficient Decentralized Optimization via Double-Communication Symmetric ADMM
66. ICLR 2026Completed Hyperparameter Transfer across Modules, Width, Depth, Batch and Duration
67. ICLR 2026Composite Optimization with Error Feedback: the Dual Averaging Approach
68. ICLR 2026ConRep4CO: Contrastive Representation Learning of Combinatorial Optimization Instances across Types
69. ICLR 2026Constraint-guided Hardware-aware NAS through Gradient Modification
70. ICLR 2026Continuous Chain of Thought Enables Parallel Exploration and Reasoning
71. ICLR 2026Converge Faster, Talk Less: Hessian-Informed Federated Zeroth-Order Optimization
72. ICLR 2026Convergence Dynamics of Over-Parameterized Score Matching for a Single Gaussian
73. ICLR 2026Convergence of an actor-critic gradient flow for entropy regularised MDPs in general spaces
74. ICLR 2026Convergence of Muon with Newton-Schulz
75. ICLR 2026Convergence of Regret Matching in Potential Games and Constrained Optimization
76. ICLR 2026Corner Gradient Descent
77. ICLR 2026Decentralized Nonconvex Optimization under Heavy-Tailed Noise: Normalization and Optimal Convergence
78. ICLR 2026Deep FlexQP: Accelerated Nonlinear Programming via Deep Unfolding
79. ICLR 2026DeMo: Decoupled Momentum Optimization
80. ICLR 2026Derandomized Online-to-Non-convex Conversion for Stochastic Weakly Convex Optimization
81. ICLR 2026Diffusion-DFL: Decision-focused Diffusion Models for Stochastic Optimization
82. ICLR 2026Discount Model Search for Quality Diversity Optimization in High-Dimensional Measure Spaces
83. ICLR 2026Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval
84. ICLR 2026Discovering Hierarchical Software Engineering Agents via Bandit Optimization
85. ICLR 2026Discrete Diffusion Trajectory Alignment via Stepwise Decomposition
86. ICLR 2026DNT: a Deeply Normalized Transformer that can be trained by Momentum SGD
87. ICLR 2026DR-SAC: Distributionally Robust Soft Actor-Critic for Reinforcement Learning under Uncertainty
88. ICLR 2026DTO-KD: Dynamic Trade-off Optimization for Effective Knowledge Distillation
89. ICLR 2026Dual Optimistic Ascent (PI Control) is the Augmented Lagrangian Method in Disguise
90. ICLR 2026EAMET: ROBUST MASSIVE MODEL EDITING VIA EMBEDDING ALIGNMENT OPTIMIZATION
91. ICLR 2026Efficient Multi-objective Prompt Optimization via Pure-exploration Bandits
92. ICLR 2026Efficient Sliced Wasserstein Distance Computation via Adaptive Bayesian Optimization
93. ICLR 2026Efficient Submodular Maximization for Sums of Concave over Modular Functions
94. ICLR 2026Egalitarian Gradient Descent: A Simple Approach to Accelerated Grokking
95. ICLR 2026Entropic Confinement and Mode Connectivity in Overparameterized Neural Networks
96. ICLR 2026Error Feedback for Muon and Friends
97. ICLR 2026Fast Data Mixture Optimization via Gradient Descent
98. ICLR 2026Fast Frank–Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
99. ICLR 2026Faster Gradient Methods for Highly-smooth Stochastic Bilevel Optimization
100. ICLR 2026FastGRPO: Accelerating Policy Optimization via Concurrency-aware Speculative Decoding and Online Draft 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.