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

1,871 papers, page 30 of 38

1451. NeurIPS 2024A robust inlier identification algorithm for point cloud registration via $\mathbf{\ell_0}$-minimization
1452. NeurIPS 2024A two-scale Complexity Measure for Deep Learning Models
1453. NeurIPS 2024Accelerating Matroid Optimization through Fast Imprecise Oracles
1454. NeurIPS 2024Accelerating Non-Maximum Suppression: A Graph Theory Perspective
1455. NeurIPS 2024Acceleration Exists! Optimization Problems When Oracle Can Only Compare Objective Function Values
1456. NeurIPS 2024Achieving Linear Convergence with Parameter-Free Algorithms in Decentralized Optimization
1457. NeurIPS 2024Achieving Near-Optimal Convergence for Distributed Minimax Optimization with Adaptive Stepsizes
1458. NeurIPS 2024Adam with model exponential moving average is effective for nonconvex optimization
1459. NeurIPS 2024Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization
1460. NeurIPS 2024Adaptive Proximal Gradient Method for Convex Optimization
1461. NeurIPS 2024Adaptive Variance Reduction for Stochastic Optimization under Weaker Assumptions
1462. NeurIPS 2024Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
1463. NeurIPS 2024Algebraic Positional Encodings
1464. NeurIPS 2024ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models
1465. NeurIPS 2024An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
1466. NeurIPS 2024An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
1467. NeurIPS 2024An Improved Empirical Fisher Approximation for Natural Gradient Descent
1468. NeurIPS 2024Approximately Pareto-optimal Solutions for Bi-Objective k-Clustering
1469. NeurIPS 2024Approximating the Top Eigenvector in Random Order Streams
1470. NeurIPS 2024Are Multiple Instance Learning Algorithms Learnable for Instances?
1471. NeurIPS 2024B-ary Tree Push-Pull Method is Provably Efficient for Distributed Learning on Heterogeneous Data
1472. NeurIPS 2024BAdam: A Memory Efficient Full Parameter Optimization Method for Large Language Models
1473. NeurIPS 2024Bayes-optimal learning of an extensive-width neural network from quadratically many samples
1474. NeurIPS 2024Bayesian Nonparametrics Meets Data-Driven Distributionally Robust Optimization
1475. NeurIPS 2024Bayesian Optimization of Functions over Node Subsets in Graphs
1476. NeurIPS 2024Bayesian Strategic Classification
1477. NeurIPS 2024Benign overfitting in leaky ReLU networks with moderate input dimension
1478. NeurIPS 2024Bias in Motion: Theoretical Insights into the Dynamics of Bias in SGD Training
1479. NeurIPS 2024Binary Search with Distributional Predictions
1480. NeurIPS 2024Boundary Decomposition for Nadir Objective Vector Estimation
1481. NeurIPS 2024BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning
1482. NeurIPS 2024Byzantine Robustness and Partial Participation Can Be Achieved at Once: Just Clip Gradient Differences
1483. NeurIPS 2024C-GAIL: Stabilizing Generative Adversarial Imitation Learning with Control Theory
1484. NeurIPS 2024Can neural operators always be continuously discretized?
1485. NeurIPS 2024Catastrophic Goodhart: regularizing RLHF with KL divergence does not mitigate heavy-tailed reward misspecification
1486. NeurIPS 2024Clustering with Non-adaptive Subset Queries
1487. NeurIPS 2024CoBo: Collaborative Learning via Bilevel Optimization
1488. NeurIPS 2024Collaboration! Towards Robust Neural Methods for Routing Problems
1489. NeurIPS 2024Communication-Efficient Federated Group Distributionally Robust Optimization
1490. NeurIPS 2024Computing the Bias of Constant-step Stochastic Approximation with Markovian Noise
1491. NeurIPS 2024Conformal Inverse Optimization
1492. NeurIPS 2024Constrained Sampling with Primal-Dual Langevin Monte Carlo
1493. NeurIPS 2024Contextual Linear Optimization with Bandit Feedback
1494. NeurIPS 2024Continuous Partitioning for Graph-Based Semi-Supervised Learning
1495. NeurIPS 2024Contracting with a Learning Agent
1496. NeurIPS 2024Controlling Continuous Relaxation for Combinatorial Optimization
1497. NeurIPS 2024Controlling Multiple Errors Simultaneously with a PAC-Bayes Bound
1498. NeurIPS 2024Convergence Analysis of Split Federated Learning on Heterogeneous Data
1499. NeurIPS 2024Convolutions and More as Einsum: A Tensor Network Perspective with Advances for Second-Order Methods
1500. NeurIPS 2024Cost-aware Bayesian Optimization via the Pandora's Box Gittins Index

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.