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)

Extreme k-Center Clustering AAAI 2021 Facility’s Perspective to Fair Facility Location Problems AAAI 2021 FACS: Fast Code-based Algorithm for Coalition Structure Generation (Student Abstract) AAAI 2021 Fair Algorithms for Multi-Agent Multi-Armed Bandits NeurIPS 2021 Fair and Efficient Allocations under Lexicographic Preferences AAAI 2021 Fair and Efficient Allocations under Subadditive Valuations AAAI 2021 Fair and Efficient Allocations with Limited Demands AAAI 2021 Fair and Efficient Online Allocations with Normalized Valuations AAAI 2021 Fair and Efficient Resource Allocation with Partial Information IJCAI 2021 Fair and Interpretable Algorithmic Hiring using Evolutionary Many Objective Optimization AAAI 2021 Fair and Truthful Mechanisms for Dichotomous Valuations AAAI 2021 Fair Exploration via Axiomatic Bargaining NeurIPS 2021 Fairness and Bias in Online Selection ICML 2021 Fairness in Influence Maximization through Randomization AAAI 2021 Fair Pairwise Exchange among Groups IJCAI 2021 Fair Scheduling for Time-dependent Resources NeurIPS 2021 Fair Sortition Made Transparent NeurIPS 2021 Fair Stable Matchings Under Correlated Preferences (Student Abstract) AAAI 2021 Far-Field Speaker Localization and Adaptive GLMB Tracking Interspeech 2021 Fast Algorithms for L_∞-constrained S-rectangular Robust MDPs NeurIPS 2021 Fast Algorithms for Stackelberg Prediction Game with Least Squares Loss ICML 2021 Fast and accurate randomized algorithms for low-rank tensor decompositions NeurIPS 2021 Fast and Compact Bilinear Pooling by Shifted Random Maclaurin AAAI 2021 Fast and Feature-Complete Differentiable Physics Engine for Articulated Rigid Bodies with Contact Constraints RSS 2021 Fast and Light Bandwidth Testing for Internet Users NSDI 2021