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)

Secretary and Online Matching Problems with Machine Learned Advice NeurIPS 2020 Selecting Portfolios Directly Using Recurrent Reinforcement Learning (Student Abstract) AAAI 2020 Selecting Voting Locations for Fun and Profit IJCAI 2020 Self-Concordant Analysis of Frank-Wolfe Algorithms ICML 2020 Self-Guided Evolution Strategies with Historical Estimated Gradients IJCAI 2020 Selling Data at an Auction under Privacy Constraints UAI 2020 Semantic Correspondence as an Optimal Transport Problem CVPR 2020 Semantic Matching for Sequence-to-Sequence Learning EMNLP 2020 Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems IJCAI 2020 Semi-bandit Optimization in the Dispersed Setting UAI 2020 Semi-supervised New Event Type Induction and Event Detection EMNLP 2020 Sensor Placement for Spatial Gaussian Processes with Integral Observations UAI 2020 Sequence Generation with Optimal-Transport-Enhanced Reinforcement Learning AAAI 2020 Sequential Bayesian Experimental Design with Variable Cost Structure NeurIPS 2020 Simple and Fast Algorithm for Binary Integer and Online Linear Programming NeurIPS 2020 Simple and sharp analysis of k-means|| ICML 2020 Sinkhorn Barycenter via Functional Gradient Descent NeurIPS 2020 Sliding Window Algorithms for k-Clustering Problems NeurIPS 2020 SLIP: Learning to predict in unknown dynamical systems with long-term memory NeurIPS 2020 Small Nash Equilibrium Certificates in Very Large Games NeurIPS 2020 Smart Forgetting for Safe Online Learning with Gaussian Processes L4DC 2020 Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems AAAI 2020 Smart Voting IJCAI 2020 Smooth Contextual Bandits: Bridging the Parametric and Non-differentiable Regret Regimes COLT 2020 Smooth Shells: Multi-Scale Shape Registration With Functional Maps CVPR 2020