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)

Dynamic Assortment Optimization with Changing Contextual Information JMLR 2020 Dynamic Multi-Robot Task Allocation under Uncertainty and Temporal Constraints RSS 2020 Dynamic Programming for Predict+Optimise AAAI 2020 Dynamic Regret of Convex and Smooth Functions NeurIPS 2020 Dynamic Submodular Maximization NeurIPS 2020 Early and Efficient Identification of Useless Constraint Propagation for Alldifferent Constraints IJCAI 2020 ECLIPSE: An Extreme-Scale Linear Program Solver for Web-Applications ICML 2020 Effective Dimension Adaptive Sketching Methods for Faster Regularized Least-Squares Optimization NeurIPS 2020 Effectively Unbiased FID and Inception Score and Where to Find Them CVPR 2020 Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability AAAI 2020 Efficient Algorithms for Learning Revenue-Maximizing Two-Part Tariffs IJCAI 2020 Efficient and Robust High-Dimensional Linear Contextual Bandits IJCAI 2020 Efficient and Robust Shape Correspondence via Sparsity-Enforced Quadratic Assignment CVPR 2020 Efficient Contextual Bandits with Continuous Actions NeurIPS 2020 Efficient Continuous Pareto Exploration in Multi-Task Learning ICML 2020 Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning NeurIPS 2020 Efficient Heuristic Search for M-Modes Inference PGM 2020 Efficiently Enumerating Substrings with Statistically Significant Frequencies of Locally Optimal Occurrences in Gigantic String AAAI 2020 Efficiently sampling functions from Gaussian process posteriors ICML 2020 Efficiently Solving MDPs with Stochastic Mirror Descent ICML 2020 Efficient MDI Adaptation for n-Gram Language Models Interspeech 2020 Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Trees NeurIPS 2020 Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent NeurIPS 2020 Efficient Parameter Estimation of Truncated Boolean Product Distributions COLT 2020 Efficient Parametric Multi-Fidelity Surface Mapping RSS 2020