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)

Backpropagation Path Search On Adversarial Transferability ICCV 2023 Backpropagation through Combinatorial Algorithms: Identity with Projection Works ICLR 2023 Backstepping Temporal Difference Learning ICLR 2023 Back Transcription as a Method for Evaluating Robustness of Natural Language Understanding Models to Speech Recognition Errors EMNLP 2023 Backward Feature Correction: How Deep Learning Performs Deep (Hierarchical) Learning COLT 2023 BADGE: Speeding Up BERT Inference after Deployment via Block-wise Bypasses and Divergence-based Early Exiting ACL 2023 BAD-NeRF: Bundle Adjusted Deblur Neural Radiance Fields CVPR 2023 Bagging in overparameterized learning: Risk characterization and risk monotonization JMLR 2023 Bagging is an Optimal PAC Learner COLT 2023 Balanced Energy Regularization Loss for Out-of-Distribution Detection CVPR 2023 Balanced Off-Policy Evaluation for Personalized Pricing AISTATS 2023 Balanced Training for Sparse GANs NeurIPS 2023 Balancing Lexical and Semantic Quality in Abstractive Summarization ACL 2023 Bamboo: Making Preemptible Instances Resilient for Affordable Training of Large DNNs NSDI 2023 Bandit Learnability can be Undecidable COLT 2023 Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular Bandits ICML 2023 Bandit Submodular Maximization for Multi-Robot Coordination in Unpredictable and Partially Observable Environments RSS 2023 Bandits with costly reward observations UAI 2023 Bandits with Knapsacks: Advice on Time-Varying Demands ICML 2023 Bandit Task Assignment with Unknown Processing Time NeurIPS 2023 Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning ICML 2023 BANSAC: A Dynamic BAyesian Network for Adaptive SAmple Consensus ICCV 2023 BARA: Efficient Incentive Mechanism with Online Reward Budget Allocation in Cross-Silo Federated Learning IJCAI 2023 BaRe-ESA: A Riemannian Framework for Unregistered Human Body Shapes ICCV 2023 Barlow Constrained Optimization for Visual Question Answering WACV 2023