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)
Factual Knowledge Assessment of Language Models Using Distractors
COLING 2025
Factual Knowledge in Language Models: Robustness and Anomalies under Simple Temporal Context Variations
ACL 2025
FADE: Why Bad Descriptions Happen to Good Features
ACL 2025
Fail2Progress: Learning from Real-World Robot Failures with Stein Variational Inference
CoRL 2025
FairICP: Encouraging Equalized Odds via Inverse Conditional Permutation
ICML 2025
Fairness Overfitting in Machine Learning: An Information-Theoretic Perspective
ICML 2025
Falcon: Faster and Parallel Inference of Large Language Models Through Enhanced Semi-Autoregressive Drafting and Custom-Designed Decoding Tree
AAAI 2025
False Coverage Proportion Control for Conformal Prediction
ICML 2025
Fast, Accurate Manifold Denoising by Tunneling Riemannian Optimization
ICML 2025
Fast Algorithm for Constrained Linear Inverse Problems
JMLR 2025
FAST: A Lightweight Mechanism Unleashing Arbitrary Client Participation in Federated Learning
IJCAI 2025
Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play
COLT 2025
Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity
ICML 2025
Fast and Reliable $N - k$ Contingency Screening with Input-Convex Neural Networks
L4DC 2025
Fast and Slow Streams for Online Time Series Forecasting Without Information Leakage
ICLR 2025
Fast and Synchronous Crash Consistency with Metadata Write-Once File System
OSDI 2025
Fast Bayesian Optimization of Function Networks with Partial Evaluations
AutoML 2025
Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction
JMLR 2025
Fast Contiguous Somatic Hypermutations for Single-Objective Optimisation and Multi-Objective Optimisation Via Decomposition
AAAI 2025
Fast Convergence of $Φ$-Divergence Along the Unadjusted Langevin Algorithm and Proximal Sampler
ALT 2025
Fast Convergence of Softmax Policy Mirror Ascent
AISTATS 2025
FastCuRL: Curriculum Reinforcement Learning with Stage-wise Context Scaling for Efficient Training R1-like Reasoning Models
EMNLP 2025
Faster Algorithms for Agnostically Learning Disjunctions and their Implications
COLT 2025
Faster Algorithms for Structured Linear and Kernel Support Vector Machines
ICLR 2025
Faster Cascades via Speculative Decoding
ICLR 2025