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)
Fast and More Powerful Selective Inference for Sparse High-Order Interaction Model
AAAI 2022
Fast and Provable Nonconvex Tensor RPCA
ICML 2022
Fast and Robust Online Inference with Stochastic Gradient Descent via Random Scaling
AAAI 2022
Fast and Robust Rank Aggregation against Model Misspecification
JMLR 2022
Fast and Scalable Spike and Slab Variable Selection in High-Dimensional Gaussian Processes
AISTATS 2022
Fast Approximations for Job Shop Scheduling: A Lagrangian Dual Deep Learning Method
AAAI 2022
Fast Aquatic Swimmer Optimization with Differentiable Projective Dynamics and Neural Network Hydrodynamic Models
ICML 2022
Fast Bayesian Estimation of Point Process Intensity as Function of Covariates
NeurIPS 2022
Fast Convex Optimization for Two-Layer ReLU Networks: Equivalent Model Classes and Cone Decompositions
ICML 2022
Fast Differentiable Matrix Square Root
ICLR 2022
Fast Distributionally Robust Learning with Variance-Reduced Min-Max Optimization
AISTATS 2022
Faster Algorithms for Learning Convex Functions
ICML 2022
Faster non-convex federated learning via global and local momentum
UAI 2022
Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization
AISTATS 2022
Faster online calibration without randomization: interval forecasts and the power of two choices
COLT 2022
Faster Perturbed Stochastic Gradient Methods for Finding Local Minima
ALT 2022
Faster Rates, Adaptive Algorithms, and Finite-Time Bounds for Linear Composition Optimization and Gradient TD Learning
AISTATS 2022
Faster Rates of Private Stochastic Convex Optimization
ALT 2022
FasterRisk: Fast and Accurate Interpretable Risk Scores
NeurIPS 2022
Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity
AISTATS 2022
Faster Stochastic Algorithms for Minimax Optimization under Polyak-{\L}ojasiewicz Condition
NeurIPS 2022
Fast Few-shot Debugging for NLU Test Suites
ACL 2022
Fast Finite Width Neural Tangent Kernel
ICML 2022
Fast Fourier Transform Reductions for Bayesian Network Inference
AISTATS 2022
Fast Grad-TTS: Towards Efficient Diffusion-Based Speech Generation on CPU
Interspeech 2022