Theory · optimization papers, 2023–2026

Key findings

• Theory · optimization went from 123 papers in 2023 to 584 in 2026, roughly 4.7x in three years.
• NeurIPS publishes the most Theory · optimization work: 778 papers from 2023 to 2026, 42% of the four-venue total.
• The fastest-growing overlap is with Low-Rank Adaptation: papers tagged with both rose from 0 in 2023 to 31 in 2026.
• Among the 5 topics under Theory and Statistics, it ranks #1 by 2026 paper count; the fastest grower in the group, Theory · learning theory, is up 5.6x versus 4.7x here.

Representative papers

Spread across years and venues so every edition shows up

• NeurIPS 2026A Mechanistic Investigation of Theory of Mind in a Large Language Model
• ICML 2026A Direct Second-Order Method for Solving Two-Player Zero-Sum Games
• ICLR 2026A Convergence Analysis of Adaptive Optimizers under Floating-point Quantization
• CVPR 2026TriSim Tri-Dimensional Similarity Modeling with Extreme Value Theory for False-Negative
• NeurIPS 20253BASiL: An Algorithmic Framework for Sparse plus Low-Rank Compression of LLMs
• ICML 2025Active Learning of Deep Neural Networks via Gradient-Free Cutting Planes
• ICLR 2025A Coefficient Makes SVRG Effective
• CVPR 2025Dynamic Stereotype Theory Induced Micro-expression Recognition with Oriented Deformation
• NeurIPS 2024A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem
• ICML 2024A Statistical Theory of Regularization-Based Continual Learning
• ICLR 2024A Discretization Framework for Robust Contextual Stochastic Optimization
• NeurIPS 2023[Re] Bandit Theory and Thompson Sampling-guided Directed Evolution for Sequence Optimization
• ICML 2023Averaged Method of Multipliers for Bi-Level Optimization without Lower-Level Strong Convexity
• ICLR 2023Adaptive Optimization in the $\infty$-Width Limit
• CVPR 2023Deep Hashing With Minimal-Distance-Separated Hash Centers
• NeurIPS 2026Avoiding Obfuscation with Prover-Estimator Debate
• ICML 2026A General Framework for Dynamic Consistent Submodular Maximization
• ICLR 2026A Memory-Efficient Hierarchical Algorithm for Large-scale Optimal Transport Problems
• CVPR 2026FedAdamom Adaptive Momentum for Improved Generalization in Federated Optimization
• NeurIPS 2025A Beyond-Worst-Case Analysis of Greedy k-means++

All Theory · optimization papers

670 papers, page 8 of 14

351. ICML 2025When to Forget? Complexity Trade-offs in Machine Unlearning
352. ICML 2025Widening the Network Mitigates the Impact of Data Heterogeneity on FedAvg
353. NeurIPS 20253BASiL: An Algorithmic Framework for Sparse plus Low-Rank Compression of LLMs
354. NeurIPS 2025A Beyond-Worst-Case Analysis of Greedy k-means++
355. NeurIPS 2025A Computationally Viable Numerical Gradient-based Technique for Optimal Covering Problems
356. NeurIPS 2025A Difference-of-Convex Functions Approach to Energy-Based Iterative Reasoning
357. NeurIPS 2025A Geometric Analysis of PCA
358. NeurIPS 2025A Gradient Guided Diffusion Framework for Chance Constrained Programming
359. NeurIPS 2025A Learning-Augmented Dynamic Programming Approach for Orienteering Problem with Time Windows
360. NeurIPS 2025A Minimalist Example of Edge-of-Stability and Progressive Sharpening
361. NeurIPS 2025A Near-Optimal Algorithm for Decentralized Convex-Concave Finite-Sum Minimax Optimization
362. NeurIPS 2025A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees
363. NeurIPS 2025A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
364. NeurIPS 2025A Single-Loop Gradient Algorithm for Pessimistic Bilevel Optimization via Smooth Approximation
365. NeurIPS 2025A Statistical Theory of Contrastive Learning via Approximate Sufficient Statistics
366. NeurIPS 2025A Tale of Two Symmetries: Exploring the Loss Landscape of Equivariant Models
367. NeurIPS 2025A Theoretical Framework for Grokking: Interpolation followed by Riemannian Norm Minimisation
368. NeurIPS 2025A Theory for Worst-Case vs. Average-Case Guarantees for LLMs
369. NeurIPS 2025A Unified Analysis of Stochastic Gradient Descent with Arbitrary Data Permutations and Beyond
370. NeurIPS 2025A Unified Stability Analysis of SAM vs SGD: Role of Data Coherence and Emergence of Simplicity Bias
371. NeurIPS 2025Accelerated Distance-adaptive Methods for Hölder Smooth and Convex Optimization
372. NeurIPS 2025Accelerating Block Coordinate Descent for LLM Finetuning via Landscape Expansion
373. NeurIPS 2025Accelerating Model-Free Optimization via Averaging of Cost Samples
374. NeurIPS 2025Accelerating Optimization via Differentiable Stopping Time
375. NeurIPS 2025Acceleration via silver step-size on Riemannian manifolds with applications to Wasserstein space
376. NeurIPS 2025Adam Reduces a Unique Form of Sharpness: Theoretical Insights Near the Minimizer Manifold
377. NeurIPS 2025Adaptive Algorithms with Sharp Convergence Rates for Stochastic Hierarchical Optimization
378. NeurIPS 2025Adaptive Frontier Exploration on Graphs with Applications to Network-Based Disease Testing
379. NeurIPS 2025Adaptive Riemannian ADMM for Nonsmooth Optimization: Optimal Complexity without Smoothing
380. NeurIPS 2025Affine-Invariant Global Non-Asymptotic Convergence Analysis of BFGS under Self-Concordance
381. NeurIPS 2025Agnostic Active Learning Is Always Better Than Passive Learning
382. NeurIPS 2025Alternating Gradient Flows: A Theory of Feature Learning in Two-layer Neural Networks
383. NeurIPS 2025An Adaptive Algorithm for Bilevel Optimization on Riemannian Manifolds
384. NeurIPS 2025An Analytical Theory of Spectral Bias in the Learning Dynamics of Diffusion Models
385. NeurIPS 2025An Ellipsoid Algorithm for Online Convex Optimization
386. NeurIPS 2025Analog In-memory Training on General Non-ideal Resistive Elements: The Impact of Response Functions
387. NeurIPS 2025Any-stepsize Gradient Descent for Separable Data under Fenchel–Young Losses
388. NeurIPS 2025Approximation theory for 1-Lipschitz ResNets
389. NeurIPS 2025ASGO: Adaptive Structured Gradient Optimization
390. NeurIPS 2025Attention-based clustering
391. NeurIPS 2025Autoencoding Random Forests
392. NeurIPS 2025Balancing Gradient and Hessian Queries in Non-Convex Optimization
393. NeurIPS 2025Bayesian Optimization with Preference Exploration using a Monotonic Neural Network Ensemble
394. NeurIPS 2025Benign Overfitting in Single-Head Attention
395. NeurIPS 2025Better NTK Conditioning: A Free Lunch from (ReLU) Nonlinear Activation in Wide Neural Networks
396. NeurIPS 2025Beyond Random: Automatic Inner-loop Optimization in Dataset Distillation
397. NeurIPS 2025Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions
398. NeurIPS 2025Bilevel Optimization for Adversarial Learning Problems: Sharpness, Generation, and Beyond
399. NeurIPS 2025Block Coordinate Descent for Neural Networks Provably Finds Global Minima
400. NeurIPS 2025Bootstrap Your Uncertainty: Adaptive Robust Classification Driven by Optimal-Transport

FAQ

How many Theory · optimization papers were published at NeurIPS, ICLR, ICML and CVPR from 2023 to 2026?

1,871 in total: 123 in 2023, 494 in 2024, 670 in 2025, 584 in 2026.

How many Theory · optimization papers are at NeurIPS 2026?

NeurIPS 2026 has 119 Theory · optimization papers, versus 318 the year before.

How many Theory · optimization papers are at ICLR 2026?

ICLR 2026 has 244 Theory · optimization papers, versus 196 the year before.

How many Theory · optimization papers are at ICML 2026?

ICML 2026 has 214 Theory · optimization papers, versus 147 the year before.

How many Theory · optimization papers are at CVPR 2026?

CVPR 2026 has 7 Theory · optimization papers, versus 9 the year before.

Which conference publishes the most Theory · optimization papers?

NeurIPS, with 778 papers from 2023 to 2026.