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)

Private Non-smooth ERM and SCO in Subquadratic Steps NeurIPS 2021 Private Stochastic Convex Optimization: Optimal Rates in L1 Geometry ICML 2021 Probabilistic DAG search UAI 2021 Probabilistic robust linear quadratic regulators with Gaussian processes L4DC 2021 Probabilistic Sequential Shrinking: A Best Arm Identification Algorithm for Stochastic Bandits with Corruptions ICML 2021 Problem Dependent View on Structured Thresholding Bandit Problems ICML 2021 Profiling Pareto Front With Multi-Objective Stein Variational Gradient Descent NeurIPS 2021 Projected Stochastic Gradient Langevin Algorithms for Constrained Sampling and Non-Convex Learning COLT 2021 Projection-Free Bandit Optimization with Privacy Guarantees AAAI 2021 Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks JMLR 2021 Projection-free Online Learning in Dynamic Environments AAAI 2021 Projection-free Online Learning over Strongly Convex Sets AAAI 2021 Projection-Free Optimization on Uniformly Convex Sets AISTATS 2021 Projection Robust Wasserstein Barycenters ICML 2021 Projection techniques to update the truncated SVD of evolving matrices with applications ICML 2021 PROMPT: Probabilistic Motion Primitives based Trajectory Planning RSS 2021 PROPm Allocations of Indivisible Goods to Multiple Agents IJCAI 2021 Proportionally Representative Participatory Budgeting with Ordinal Preferences AAAI 2021 Proportional Participatory Budgeting with Additive Utilities NeurIPS 2021 Proportional Representation under Single-Crossing Preferences Revisited AAAI 2021 Provably Eﬃcient Actor-Critic for Risk-Sensitive and Robust Adversarial RL: A Linear-Quadratic Case AISTATS 2021 Provably Faster Algorithms for Bilevel Optimization NeurIPS 2021 Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size AAAI 2021 Provably Sample Efficient Reinforcement Learning in Competitive Linear Quadratic Systems L4DC 2021 Proximal and Sparse Resolution of Constrained Dynamic Equations RSS 2021