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)

Achieving Envy-freeness and Equitability with Monetary Transfers AAAI 2021 Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously ICML 2021 Achieving Proportionality up to the Maximin Item with Indivisible Goods AAAI 2021 Achieving Robustness in Classification Using Optimal Transport With Hinge Regularization CVPR 2021 A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms NeurIPS 2021 ACMo: Angle-Calibrated Moment Methods for Stochastic Optimization AAAI 2021 A comparative study on sampling with replacement vs Poisson sampling in optimal subsampling AISTATS 2021 A Complexity-theoretic Analysis of Green Pickup-and-Delivery Problems AAAI 2021 A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering NeurIPS 2021 A Continuous Mapping For Augmentation Design NeurIPS 2021 Active Learning for Distributionally Robust Level-Set Estimation ICML 2021 Active Slices for Sliced Stein Discrepancy ICML 2021 Adapting to Delays and Data in Adversarial Multi-Armed Bandits ICML 2021 Adapting to function difficulty and growth conditions in private optimization NeurIPS 2021 Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous Feedback AAAI 2021 Adaptive Experimental Design for Optimizing Combinatorial Structures IJCAI 2021 Adaptive Extra-Gradient Methods for Min-Max Optimization and Games ICLR 2021 Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements NeurIPS 2021 Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities AAAI 2021 Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium COLT 2021 Adaptive Newton Sketch: Linear-time Optimization with Quadratic Convergence and Effective Hessian Dimensionality ICML 2021 Adaptive Risk Sensitive Model Predictive Control with Stochastic Search L4DC 2021 Adaptive Sampling for Fast Constrained Maximization of Submodular Functions AISTATS 2021 Adaptivity in Adaptive Submodularity COLT 2021 A Data Driven, Convex Optimization Approach to Learning Koopman Operators L4DC 2021