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)

Black-Box Inference for Non-Linear Latent Force Models AISTATS 2020 Black-box Off-policy Estimation for Infinite-Horizon Reinforcement Learning ICLR 2020 Black-Box Optimization with Local Generative Surrogates NeurIPS 2020 Black Box Submodular Maximization: Discrete and Continuous Settings AISTATS 2020 Black-Box Variational Inference as a Parametric Approximation to Langevin Dynamics ICML 2020 Block-Wisely Supervised Neural Architecture Search With Knowledge Distillation CVPR 2020 Blur Aware Calibration of Multi-Focus Plenoptic Camera CVPR 2020 Boosting-Based Reliable Model Reuse ACML 2020 Boosting First-Order Methods by Shifting Objective: New Schemes with Faster Worst-Case Rates NeurIPS 2020 Boosting for Control of Dynamical Systems ICML 2020 Boosting Frank-Wolfe by Chasing Gradients ICML 2020 Bootstrapping neural processes NeurIPS 2020 BOSS: Bayesian Optimization over String Spaces NeurIPS 2020 BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization NeurIPS 2020 Boundary thickness and robustness in learning models NeurIPS 2020 Bounded Incentives in Manipulating the Probabilistic Serial Rule AAAI 2020 Bounding the expected run-time of nonconvex optimization with early stopping UAI 2020 Bounds and Complexity Results for Learning Coalition-Based Interaction Functions in Networked Social Systems AAAI 2020 Bounds in query learning COLT 2020 Bounds on Over-Parameterization for Guaranteed Existence of Descent Paths in Shallow ReLU Networks ICLR 2020 BOWL: Bayesian Optimization for Weight Learning in Probabilistic Soft Logic AAAI 2020 Brain Metastasis Segmentation Network Trained with Robustness to Annotations with Multiple False Negatives MIDL 2020 Branch and Bound for Piecewise Linear Neural Network Verification JMLR 2020 BRDF-Reconstruction in Photogrammetry Studio Setups WACV 2020 Breaking Reversibility Accelerates Langevin Dynamics for Non-Convex Optimization NeurIPS 2020