conftrace_

Optimization

14,850 papers (55 classified directly here)

Subtopics · a paper can sit in several, so these overlap

Continuous Optimization (4,424) Stochastic Methods (2,991) Combinatorial Optimization (2,615) Online Algorithms (2,404) Optimization (1,521) Game Theory (1,046) Convex Optimization (864) Discrete Optimization (721) Optimal Transport (474) Sparse Optimization (416) Optimal Control (271) Global Optimization (200) Non-Convex Optimization (182) Distributed Learning (164) Approximation Algorithms (162) Multi-Objective Optimization (151) Distributed Optimization (136) Bayesian Optimization (132) Theory (109) Compressed Sensing (102) Algorithms (89) Robust Optimization (86) Submodular Optimization (77) Kernel Methods (75) Evolutionary Algorithm (72) Linear Programming (54) Tensor Decomposition (48) Bilevel Optimization (42) Integer Programming (38) Matrix Completion (33) Algorithm (21) Regularization (11)

Papers per year

1

2

6

6

5

16

67

72

80

102

133

171

219

398

425

440

487

649

812

1,162

1,353

1,487

1,474

1,600

1,870

1,441

372

2000

'5

'10

'15

'20

'25

Papers (including subtopics)

Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem COLT 2019 Bayesian Functional Optimisation with Shape Prior AAAI 2019 Bayesian optimisation under uncertain inputs AISTATS 2019 Bayesian Optimization Meets Riemannian Manifolds in Robot Learning CoRL 2019 Bayesian Optimization of Composite Functions ICML 2019 Bayesian Optimization under Heavy-tailed Payoffs NeurIPS 2019 Bayesian Optimization with Binary Auxiliary Information UAI 2019 Bayesian Optimization with Unknown Search Space NeurIPS 2019 Bayesian Parameter Estimation for Nonlinear Dynamics Using Sensitivity Analysis IJCAI 2019 Be Greedy: How Chromatic Number meets Regret Minimization in Graph Bandits UAI 2019 Best Answers over Incomplete Data : Complexity and First-Order Rewritings IJCAI 2019 Best of many worlds: Robust model selection for online supervised learning AISTATS 2019 Better Algorithms for Stochastic Bandits with Adversarial Corruptions COLT 2019 Better generalization with less data using robust gradient descent ICML 2019 Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio ICML 2019 Beyond Alternating Updates for Matrix Factorization with Inertial Bregman Proximal Gradient Algorithms NeurIPS 2019 Beyond Backprop: Online Alternating Minimization with Auxiliary Variables ICML 2019 Beyond Gradient Descent for Regularized Segmentation Losses CVPR 2019 Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization NeurIPS 2019 Beyond Volumetric Albedo -- A Surface Optimization Framework for Non-Line-Of-Sight Imaging CVPR 2019 Bézier Simplex Fitting: Describing Pareto Fronts of´ Simplicial Problems with Small Samples in Multi-Objective Optimization AAAI 2019 Binarsity: a penalization for one-hot encoded features in linear supervised learning JMLR 2019 BiOWA for Preference Aggregation with Bipolar Scales: Application to Fair Optimization in Combinatorial Domains IJCAI 2019 Blended Conditonal Gradients ICML 2019 Blended Matching Pursuit NeurIPS 2019