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

160 papers, page 2 of 4

51. ICML 2024Dynamic Anisotropic Smoothing for Noisy Derivative-Free Optimization
52. ICML 2024Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond
53. ICML 2024Efficient Algorithms for Sum-Of-Minimum Optimization
54. ICML 2024Efficient Stochastic Approximation of Minimax Excess Risk Optimization
55. ICML 2024Equivariant Deep Weight Space Alignment
56. ICML 2024Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
57. ICML 2024Exploration-Driven Policy Optimization in RLHF: Theoretical Insights on Efficient Data Utilization
58. ICML 2024Exploring the Complexity of Deep Neural Networks through Functional Equivalence
59. ICML 2024FADAS: Towards Federated Adaptive Asynchronous Optimization
60. ICML 2024Faster Adaptive Decentralized Learning Algorithms
61. ICML 2024Federated Optimization with Doubly Regularized Drift Correction
62. ICML 2024Flora: Low-Rank Adapters Are Secretly Gradient Compressors
63. ICML 2024From Generalization Analysis to Optimization Designs for State Space Models
64. ICML 2024From Inverse Optimization to Feasibility to ERM
65. ICML 2024Fundamental Benefit of Alternating Updates in Minimax Optimization
66. ICML 2024Generalized Preference Optimization: A Unified Approach to Offline Alignment
67. ICML 2024Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization
68. ICML 2024High-Dimensional Bayesian Optimization via Semi-Supervised Learning with Optimized Unlabeled Data Sampling
69. ICML 2024High-Probability Bound for Non-Smooth Non-Convex Stochastic Optimization with Heavy Tails
70. ICML 2024High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise
71. ICML 2024How Free is Parameter-Free Stochastic Optimization?
72. ICML 2024How to Make the Gradients Small Privately: Improved Rates for Differentially Private Non-Convex Optimization
73. ICML 2024ILILT: Implicit Learning of Inverse Lithography Technologies
74. ICML 2024Implicit Bias of AdamW: $\ell_\infty$-Norm Constrained Optimization
75. ICML 2024Improved Differentially Private and Lazy Online Convex Optimization: Lower Regret without Smoothness Requirements
76. ICML 2024Improving Robustness to Multiple Spurious Correlations by Multi-Objective Optimization
77. ICML 2024Improving SAM Requires Rethinking its Optimization Formulation
78. ICML 2024In-context Convergence of Transformers
79. ICML 2024In-Context Freeze-Thaw Bayesian Optimization for Hyperparameter Optimization
80. ICML 2024InstructZero: Efficient Instruction Optimization for Black-Box Large Language Models
81. ICML 2024Interpreting and Improving Diffusion Models from an Optimization Perspective
82. ICML 2024Iterative Regularized Policy Optimization with Imperfect Demonstrations
83. ICML 2024Joint Composite Latent Space Bayesian Optimization
84. ICML 2024KernelSHAP-IQ: Weighted Least Square Optimization for Shapley Interactions
85. ICML 2024LASER: Linear Compression in Wireless Distributed Optimization
86. ICML 2024Learning to Remove Cuts in Integer Linear Programming
87. ICML 2024Learning with 3D rotations, a hitchhiker's guide to SO(3)
88. ICML 2024Learning-Rate-Free Stochastic Optimization over Riemannian Manifolds
89. ICML 2024Locally Differentially Private Decentralized Stochastic Bilevel Optimization with Guaranteed Convergence Accuracy
90. ICML 2024LPGD: A General Framework for Backpropagation through Embedded Optimization Layers
91. ICML 2024MALIBO: Meta-learning for Likelihood-free Bayesian Optimization
92. ICML 2024Mitigating Catastrophic Forgetting in Online Continual Learning by Modeling Previous Task Interrelations via Pareto Optimization
93. ICML 2024MLI Formula: A Nearly Scale-Invariant Solution with Noise Perturbation
94. ICML 2024Model Alignment as Prospect Theoretic Optimization
95. ICML 2024Moreau Envelope for Nonconvex Bi-Level Optimization: A Single-Loop and Hessian-Free Solution Strategy
96. ICML 2024No Wrong Turns: The Simple Geometry Of Neural Networks Optimization Paths
97. ICML 2024Non-convex Stochastic Composite Optimization with Polyak Momentum
98. ICML 2024Non-stationary Online Convex Optimization with Arbitrary Delays
99. ICML 2024Offline Multi-Objective Optimization
100. ICML 2024On Convergence of Incremental Gradient for Non-convex Smooth Functions

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.