Skip to content
conftrace_

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
52
352
828
3,646
5,854
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

Thompson Sampling for Unsupervised Sequential Selection ACML 2020 Thompson Sampling via Local Uncertainty ICML 2020 Thresholding Bandit Problem with Both Duels and Pulls AISTATS 2020 Threshold Treewidth and Hypertree Width IJCAI 2020 Throughput-Optimal Topology Design for Cross-Silo Federated Learning NeurIPS 2020 Thunder: a Fast Coordinate Selection Solver for Sparse Learning NeurIPS 2020 Thunderbolt: Throughput-Optimized, Quality-of-Service-Aware Power Capping at Scale OSDI 2020 Tight Analysis of Privacy and Utility Tradeoff in Approximate Differential Privacy AISTATS 2020 Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance ICML 2020 Tight Convergence Rate of Gradient Descent for Eigenvalue Computation IJCAI 2020 Tightening Exploration in Upper Confidence Reinforcement Learning ICML 2020 Tighter Theory for Local SGD on Identical and Heterogeneous Data AISTATS 2020 Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits NeurIPS 2020 Tight last-iterate convergence rates for no-regret learning in multi-player games NeurIPS 2020 Tight Lower Bounds for Combinatorial Multi-Armed Bandits COLT 2020 Tight Nonparametric Convergence Rates for Stochastic Gradient Descent under the Noiseless Linear Model NeurIPS 2020 Time-Aware Transformer-based Network for Clinical Notes Series Prediction MLHC 2020 Time-Bounded Mission Planning in Time-Varying Domains with Semi-MDPs and Gaussian Processes CoRL 2020 Time-Inconsistent Planning: Simple Motivation Is Hard to Find AAAI 2020 TKD: Temporal Knowledge Distillation for Active Perception WACV 2020 To Avoid the Pitfall of Missing Labels in Feature Selection: A Generative Model Gives the Answer AAAI 2020 Token-level Adaptive Training for Neural Machine Translation EMNLP 2020 Top-k Combinatorial Bandits with Full-Bandit Feedback ALT 2020 Topic Balancing with Additive Regularization of Topic Models ACL 2020 Topic Modeling via Full Dependence Mixtures ICML 2020