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 17 of 38

801. ICML 2025An in depth look at the Procrustes-Wasserstein distance: properties and barycenters
802. ICML 2025Analytical Lyapunov Function Discovery: An RL-based Generative Approach
803. ICML 2025Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster
804. ICML 2025Automatic Differentiation of Optimization Algorithms with Time-Varying Updates
805. ICML 2025Bayesian Optimization from Human Feedback: Near-Optimal Regret Bounds
806. ICML 2025Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity
807. ICML 2025Certifiably Robust Model Evaluation in Federated Learning under Meta-Distributional Shifts
808. ICML 2025Compact Matrix Quantum Group Equivariant Neural Networks
809. ICML 2025Competitively Consistent Clustering
810. ICML 2025Consensus Is All You Get: The Role of Attention in Transformers
811. ICML 2025Constrained Online Convex Optimization with Polyak Feasibility Steps
812. ICML 2025Convergence of Mean-Field Langevin Stochastic Descent-Ascent for Distributional Minimax Optimization
813. ICML 2025Convergence of Policy Mirror Descent Beyond Compatible Function Approximation
814. ICML 2025Decoupled SGDA for Games with Intermittent Strategy Communication
815. ICML 2025Deep Sturm–Liouville: From Sample-Based to 1D Regularization with Learnable Orthogonal Basis Functions
816. ICML 2025Differentiable Quadratic Optimization For the Maximum Independent Set Problem
817. ICML 2025Diffusion Models are Secretly Exchangeable: Parallelizing DDPMs via Auto Speculation
818. ICML 2025Dimension-Free Adaptive Subgradient Methods with Frequent Directions
819. ICML 2025Discrepancy Minimization in Input-Sparsity Time
820. ICML 2025Distributed Conformal Prediction via Message Passing
821. ICML 2025Distributed Event-Based Learning via ADMM
822. ICML 2025Dueling Convex Optimization with General Preferences
823. ICML 2025Efficient Curvature-Aware Hypergradient Approximation for Bilevel Optimization
824. ICML 2025Efficient Distributed Optimization under Heavy-Tailed Noise
825. ICML 2025Efficient First-Order Optimization on the Pareto Set for Multi-Objective Learning under Preference Guidance
826. ICML 2025Emergence in non-neural models: grokking modular arithmetic via average gradient outer product
827. ICML 2025End-to-End Learning Framework for Solving Non-Markovian Optimal Control
828. ICML 2025Enforcing Idempotency in Neural Networks
829. ICML 2025Enhancing Performance of Explainable AI Models with Constrained Concept Refinement
830. ICML 2025Ensemble Learned Bloom Filters: Two Oracles are Better than One
831. ICML 2025Exact risk curves of signSGD in High-Dimensions: quantifying preconditioning and noise-compression effects
832. ICML 2025Expected Variational Inequalities
833. ICML 2025Exploiting Curvature in Online Convex Optimization with Delayed Feedback
834. ICML 2025Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization
835. ICML 2025Extreme Value Policy Optimization for Safe Reinforcement Learning
836. ICML 2025Fast Tensor Completion via Approximate Richardson Iteration
837. ICML 2025Faster Stochastic Optimization with Arbitrary Delays via Adaptive Asynchronous Mini-Batching
838. ICML 2025Features are fate: a theory of transfer learning in high-dimensional regression
839. ICML 2025FedECADO: A Dynamical System Model of Federated Learning
840. ICML 2025Finding Wasserstein Ball Center: Efficient Algorithm and The Applications in Fairness
841. ICML 2025Flat-LoRA: Low-Rank Adaptation over a Flat Loss Landscape
842. ICML 2025Floating-Point Neural Networks Can Represent Almost All Floating-Point Functions
843. ICML 2025Fully Dynamic Embedding into $\ell_p$ Spaces
844. ICML 2025General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization
845. ICML 2025Generalization of noisy SGD in unbounded non-convex settings
846. ICML 2025Generalization Performance of Ensemble Clustering: From Theory to Algorithm
847. ICML 2025Generalized additive models via direct optimization of regularized decision stump forests
848. ICML 2025Generalized Smooth Bilevel Optimization with Nonconvex Lower-Level
849. ICML 2025Global curvature for second-order optimization of neural networks
850. ICML 2025Gradient Flow Provably Learns Robust Classifiers for Orthonormal GMMs

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.