Optimization & Theory
43,292 papers (3 classified directly here)
Subtopics · a paper can sit in several, so these overlap
Optimization (17,731)
Learning Theory (6,809)
Bayesian Inference (6,267)
Theory (5,579)
Statistical Learning (4,564)
Neural Network Optimization (4,155)
Stochastic Processes (2,948)
Stochastic Methods (1,283)
Loss Functions (1,220)
Distributed Learning (1,202)
Online Algorithms (1,013)
Statistics (822)
Generalization (376)
Information Theory (370)
Sample Complexity (282)
Sparse Optimization (241)
Game Theory (151)
Convex Optimization (132)
Optimal Transport (104)
Robust Optimization (84)
Distributed Optimization (73)
Approximation Algorithms (33)
Papers per year
1
14
29
44
31
52
189
195
212
235
352
382
457
787
816
828
1,066
1,391
1,913
3,012
3,646
4,303
4,450
5,357
6,155
5,854
1,521
2000
'5
'10
'15
'20
'25
Papers (including subtopics)
Think-on-Graph 2.0: Deep and Faithful Large Language Model Reasoning with Knowledge-guided Retrieval Augmented Generation
ICLR 2025
ThinkSLM: Towards Reasoning in Small Language Models
EMNLP 2025
Think Smarter not Harder: Adaptive Reasoning with Inference Aware Optimization
ICML 2025
ThinkSwitcher: When to Think Hard, When to Think Fast
EMNLP 2025
ThinK: Thinner Key Cache by Query-Driven Pruning
ICLR 2025
ThinkTuning: Instilling Cognitive Reflections without Distillation
EMNLP 2025
Think while You Generate: Discrete Diffusion with Planned Denoising
ICLR 2025
Thompson Sampling for Bandit Convex Optimisation
COLT 2025
Thought calibration: Efficient and confident test-time scaling
EMNLP 2025
ThoughtProbe: Classifier-Guided LLM Thought Space Exploration via Probing Representations
EMNLP 2025
ThoughtSculpt: Reasoning with Intermediate Revision and Search
NAACL 2025
Three Mechanisms of Feature Learning in a Linear Network
ICLR 2025
Threshold Filtering Packing for Supervised Fine-Tuning: Training Related Samples within Packs
NAACL 2025
Threshold UCT: Cost-Constrained Monte Carlo Tree Search with Pareto Curves
AAAI 2025
Through the Valley: Path to Effective Long CoT Training for Small Language Models
EMNLP 2025
TidalDecode: Fast and Accurate LLM Decoding with Position Persistent Sparse Attention
ICLR 2025
TIGER: Time-frequency Interleaved Gain Extraction and Reconstruction for Efficient Speech Separation
ICLR 2025
Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
AISTATS 2025
Tight and Fast Bounds for Multi-Label Learning
ICML 2025
Tight Bounds for Noisy Computation of High-Influence Functions, Connectivity, and Threshold
COLT 2025
Tight Clusters Make Specialized Experts
ICLR 2025
Tightening Robustness Verification of MaxPool-based Neural Networks via Minimizing the Over-Approximation Zone
CVPR 2025
Tighter Privacy Auditing of DP-SGD in the Hidden State Threat Model
ICLR 2025
Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
ICLR 2025
Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
IJCAI 2025