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)

Bilingual Mutual Information Based Adaptive Training for Neural Machine Translation ACL 2021 BiPointNet: Binary Neural Network for Point Clouds ICLR 2021 BKT-POMDP: Fast Action Selection for User Skill Modelling over Tasks with Multiple Skills IJCAI 2021 Black-Box Control for Linear Dynamical Systems COLT 2021 Black-box density function estimation using recursive partitioning ICML 2021 Black Box Probabilistic Numerics NeurIPS 2021 Black-Box Reductions for Zeroth-Order Gradient Algorithms to Achieve Lower Query Complexity JMLR 2021 Blind Deblurring for Saturated Images CVPR 2021 Boosted CVaR Classification NeurIPS 2021 Boosting Ensemble Accuracy by Revisiting Ensemble Diversity Metrics CVPR 2021 Boosting in the Presence of Massart Noise COLT 2021 Boosting of Contextual Information in ASR for Air-Traffic Call-Sign Recognition Interspeech 2021 Boosting Variational Inference With Locally Adaptive Step-Sizes IJCAI 2021 Boosting with Multiple Sources NeurIPS 2021 Boost then Convolve: Gradient Boosting Meets Graph Neural Networks ICLR 2021 Bootstrapping Fitted Q-Evaluation for Off-Policy Inference ICML 2021 Bootstrapping the Error of Oja's Algorithm NeurIPS 2021 BooVI: Provably Efficient Bootstrapped Value Iteration NeurIPS 2021 BORE: Bayesian Optimization by Density-Ratio Estimation ICML 2021 Bounded-cost Search Using Estimates of Uncertainty IJCAI 2021 Bounded Memory Active Learning through Enriched Queries COLT 2021 Bounds all around: training energy-based models with bidirectional bounds NeurIPS 2021 Breaking the centralized barrier for cross-device federated learning NeurIPS 2021 Breaking the Deadly Triad with a Target Network ICML 2021 Breaking The Dimension Dependence in Sparse Distribution Estimation under Communication Constraints COLT 2021