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

736 papers, page 2 of 15

51. ICML 2026Convergence Rate Analysis of the AdamW-Style Shampoo: Unifying One-Sided and Two-Sided Preconditioning
52. ICML 2026Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
53. ICML 2026Convex Basins in Single-Index Model Loss Landscapes: Applications to Robust Recovery under Strong Adversarial Corruption
54. ICML 2026Cost-aware Stopping for Bayesian Optimization
55. ICML 2026CurvZO: Adaptive Curvature-Guided Sparse Zeroth-Order Optimization for Efficient LLM Fine-Tuning
56. ICML 2026DASH: Faster Shampoo via Batched Block Preconditioning and Efficient Inverse-Root Solvers
57. ICML 2026Data Agent: Learning to Select Data via End-to-End Dynamic Optimization
58. ICML 2026Data Reconstruction: Identifiability and Optimization with Sample Splitting
59. ICML 2026Data-driven Mixed Integer Optimization through Probabilistic Multi-variable Branching
60. ICML 2026DB-KSVD: Scalable Alternating Optimization for Disentangling High-Dimensional Embedding Spaces
61. ICML 2026DDSVM: A Differentiable Framework for Deep Support Vector Machines with Iterative Geometry-Aware Optimization
62. ICML 2026Decision-focused Sparse Tangent Portfolio Optimization
63. ICML 2026DecomPose: Disentangling Cross-Category Optimization Contention for Category-Level 6D Object Pose Estimation
64. ICML 2026Decoupling Variance and Scale-Invariant Updates in Adaptive Gradient Descent for Unified Vector and Matrix Optimization
65. ICML 2026Delayed Momentum Aggregation: Communication-efficient Byzantine-robust Federated Learning with Partial Participation
66. ICML 2026Depth over Fidelity in Fixed-Budget Noisy Evolution Strategies
67. ICML 2026Depth-Progressive Monotonic Learning without Global Backpropagation
68. ICML 2026Design Linear Constrained Neural Layers with Implicit Convex Optimization
69. ICML 2026Detecting Fluent Optimization-Based Adversarial Prompts via Sequential Entropy Changes
70. ICML 2026DiffStyle3D: Consistent 3D Gaussian Stylization via Attention Optimization
71. ICML 2026Diffusion-based learning framework for Constrained Nonconvex Optimization with Weighted Bootstrapped Refinement
72. ICML 2026Dimension-Independent Convergence of Underdamped Langevin Monte Carlo in KL Divergence
73. ICML 2026DisjunctiveNet: Neural Symbolic Learning via Differentiable Convexified Optimization Layers
74. ICML 2026Distributed Stochastic $K$-Level Optimization Over Networks
75. ICML 2026Distributionally Robust Set Representation Learning Under Inference-Time Element Corruption
76. ICML 2026Divide and Learn: Multi-Objective Combinatorial Optimization at Scale
77. ICML 2026Do Transformers Need Three Projections? Systematic Study of QKV Variants
78. ICML 2026Do We Need Adam? Surprisingly Strong and Sparse Reinforcement Learning with SGD in LLMs
79. ICML 2026DREAM: A Unified Framework for Drift-Corrected Federated Multi-Objective Learning
80. ICML 2026DREAM: Dual-Standard Semantic Homogeneity with Dynamic Optimization for Graph Learning with Label Noise
81. ICML 2026Dual Quaternion SE(3) Synchronization with Recovery Guarantees
82. ICML 2026Dynamic Symmetric Point Tracking: Tackling Non-ideal Reference in Analog In-memory Training
83. ICML 2026ECCO: Evidence-Driven Causal Reasoning for Compiler Optimization
84. ICML 2026Efficient Diffusion Models under Nonconvex Equality and Inequality constraints via Landing
85. ICML 2026Efficient Diffusion Models via Time Step Optimization with Consistent Training and Inference Constraints
86. ICML 2026Efficient Distributionally Robust Assortment Optimization in MNL Bandits
87. ICML 2026Eliminating Solution Bias in Differentially Private Optimization
88. ICML 2026Evolution of Benchmark: Black-Box Optimization Benchmark Design through Large Language Model
89. ICML 2026Exploiting weight-space symmetries for approximating curvature
90. ICML 2026FAB: A First-Order AB-based Gradient Algorithm for Distributed Bilevel Optimization over Time-Varying Directed Graphs
91. ICML 2026Failure-Driven Workflow Refinement
92. ICML 2026Fast Spectrally Sparse Signal Reconstruction via Jacobi-Preconditioned Gradient Descent
93. ICML 2026FedCDWA: Decoupled Federated Prototype Distillation with Hierarchical Wasserstein Aggregation
94. ICML 2026Federated Bilevel Performative Prediction
95. ICML 2026FIBER: A Differentially Private Optimizer with Filter-Aware Innovation Bias Correction
96. ICML 2026Finding Stationary Points by Comparisons
97. ICML 2026Finite-time Convergence Analysis of Actor-Critic with Evolving Reward
98. ICML 2026Flat Minima and Generalization: Insights from Stochastic Convex Optimization
99. ICML 2026Flatland: The Adventures of Gradient Descent with Large Step Sizes
100. ICML 2026Flatness-Aware Stochastic Gradient Langevin Dynamics

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.