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)
Boosting Single Image Super-Resolution via Partial Channel Shifting
ICCV 2023
Boosting Summarization with Normalizing Flows and Aggressive Training
EMNLP 2023
Boosting the Cycle Counting Power of Graph Neural Networks with I$^2$-GNNs
ICLR 2023
Boosting Verified Training for Robust Image Classifications via Abstraction
CVPR 2023
Boosting with Tempered Exponential Measures
NeurIPS 2023
Boost Transformer-based Language Models with GPU-Friendly Sparsity and Quantization
ACL 2023
Bootstrap in High Dimension with Low Computation
ICML 2023
Bort: Towards Explainable Neural Networks with Bounded Orthogonal Constraint
ICLR 2023
Bottleneck Structure in Learned Features: Low-Dimension vs Regularity Tradeoff
NeurIPS 2023
Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed Spaces
NeurIPS 2023
Boundary Graph Neural Networks for 3D Simulations
AAAI 2023
Boundary Unlearning: Rapid Forgetting of Deep Networks via Shifting the Decision Boundary
CVPR 2023
Bounding Evidence and Estimating Log-Likelihood in VAE
AISTATS 2023
Bounding the Family-Wise Error Rate in Local Causal Discovery Using Rademacher Averages (Extended Abstract)
IJCAI 2023
Bounding training data reconstruction in DP-SGD
NeurIPS 2023
BPipe: Memory-Balanced Pipeline Parallelism for Training Large Language Models
ICML 2023
BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization
NeurIPS 2023
Branch-Price-and-Cut for Causal Discovery
CLeaR 2023
Brauer’s Group Equivariant Neural Networks
ICML 2023
BREAK: Breaking the Dialogue State Tracking Barrier with Beam Search and Re-ranking
ACL 2023
Breaking a Classical Barrier for Classifying Arbitrary Test Examples in the Quantum Model
AISTATS 2023
Breaking the Communication-Privacy-Accuracy Tradeoff with f-Differential Privacy
NeurIPS 2023
Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation
COLT 2023
Breaking the Lower Bound with (Little) Structure: Acceleration in Non-Convex Stochastic Optimization with Heavy-Tailed Noise
COLT 2023
Breaking through Deterministic Barriers: Randomized Pruning Mask Generation and Selection
EMNLP 2023