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)

Stochastic Stein Discrepancies NeurIPS 2020 Stochastic Subspace Cubic Newton Method ICML 2020 Stochastic Variance-Reduced Algorithms for PCA with Arbitrary Mini-Batch Sizes AISTATS 2020 Strategic Campaign Management in Apportionment Elections IJCAI 2020 Strategies for Cooperative UAVs Using Model Predictive Control IJCAI 2020 Strategy-Proof and Non-Wasteful Multi-Unit Auction via Social Network AAAI 2020 StratLearner: Learning a Strategy for Misinformation Prevention in Social Networks NeurIPS 2020 Streaming k-Submodular Maximization under Noise subject to Size Constraint ICML 2020 Streaming Submodular Maximization under a k-Set System Constraint ICML 2020 Stronger and Faster Wasserstein Adversarial Attacks ICML 2020 Structural Decompositions of Epistemic Logic Programs AAAI 2020 Structure Adaptive Algorithms for Stochastic Bandits ICML 2020 Structured Linear Contextual Bandits: A Sharp and Geometric Smoothed Analysis ICML 2020 Structured Policy Iteration for Linear Quadratic Regulator ICML 2020 Subgraph Isomorphism Meets Cutting Planes: Solving With Certified Solutions IJCAI 2020 Sublinear Optimal Policy Value Estimation in Contextual Bandits AISTATS 2020 Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces NeurIPS 2020 Submodel Decomposition for Solving Limited Memory Influence Diagrams (Student Abstract) AAAI 2020 Submodular Bandit Problem Under Multiple Constraints UAI 2020 Submodular Maximization Through Barrier Functions NeurIPS 2020 Submodular Meta-Learning NeurIPS 2020 Sub-sampling for Efficient Non-Parametric Bandit Exploration NeurIPS 2020 Subset Selection by Pareto Optimization with Recombination AAAI 2020 Subsidy Allocations in the Presence of Income Shocks AAAI 2020 Sufficient dimension reduction for classification using principal optimal transport direction NeurIPS 2020