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)

Representative Proxy Voting AAAI 2021 Representer Theorems in Banach Spaces: Minimum Norm Interpolation, Regularized Learning and Semi-Discrete Inverse Problems JMLR 2021 Reproducing kernel Hilbert C*-module and kernel mean embeddings JMLR 2021 Reserve Price Optimization for First Price Auctions in Display Advertising ICML 2021 Resource Allocation in Multi-armed Bandit Exploration: Overcoming Sublinear Scaling with Adaptive Parallelism ICML 2021 Responsibility Attribution in Parameterized Markovian Models AAAI 2021 Restricted Domains of Dichotomous Preferences with Possibly Incomplete Information AAAI 2021 Rethinking the Variational Interpretation of Accelerated Optimization Methods NeurIPS 2021 Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes NeurIPS 2021 Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks – A Complexity Analysis AAAI 2021 Revenue-Incentive Tradeoffs in Dynamic Reserve Pricing ICML 2021 Revenue maximization via machine learning with noisy data NeurIPS 2021 Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices AAAI 2021 Revisiting Projection-free Online Learning: the Strongly Convex Case AISTATS 2021 Revisiting Smoothed Online Learning NeurIPS 2021 Revisiting the Role of Euler Numerical Integration on Acceleration and Stability in Convex Optimization AISTATS 2021 Revitalizing Optimization for 3D Human Pose and Shape Estimation: A Sparse Constrained Formulation ICCV 2021 Reward Biased Maximum Likelihood Estimation for Reinforcement Learning L4DC 2021 Reward-Free Model-Based Reinforcement Learning with Linear Function Approximation NeurIPS 2021 Riemannian Convex Potential Maps ICML 2021 Riemannian Stochastic Recursive Momentum Method for non-Convex Optimization IJCAI 2021 Risk Bounds and Calibration for a Smart Predict-then-Optimize Method NeurIPS 2021 Robust Allocations with Diversity Constraints NeurIPS 2021 Robust Auction Design in the Auto-bidding World NeurIPS 2021 Robust Contextual Bandits via Bootstrapping AAAI 2021