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)

Rearrangement on Lattices with Swaps: Optimality Structures and Efficient Algorithms RSS 2021 Reasoning-Based Learning of Interpretable ML Models IJCAI 2021 Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits NeurIPS 2021 Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility AAAI 2021 Reduced-Rank Regression with Operator Norm Error COLT 2021 Refined approachability algorithms and application to regret minimization with global costs JMLR 2021 Regime Switching Bandits NeurIPS 2021 Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints ICML 2021 Regret Bounds for Adaptive Nonlinear Control L4DC 2021 Regret Bounds for Gaussian-Process Optimization in Large Domains NeurIPS 2021 Regret Minimization in Heavy-Tailed Bandits COLT 2021 Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach ICML 2021 Regret-optimal measurement-feedback control L4DC 2021 Regularized ERM on random subspaces AISTATS 2021 Regularized Online Allocation Problems: Fairness and Beyond ICML 2021 Regularized Submodular Maximization at Scale ICML 2021 Regulating Greed Over Time in Multi-Armed Bandits JMLR 2021 Reinforcement Learning for Cost-Aware Markov Decision Processes ICML 2021 Reinforcement Learning for Mean Field Games with Strategic Complementarities AISTATS 2021 Reinforcement Learning of Sequential Price Mechanisms AAAI 2021 Rejection Sampling for Weighted Jaccard Similarity Revisited AAAI 2021 Relational Boosted Bandits AAAI 2021 Relaxed Core Stability in Fractional Hedonic Games IJCAI 2021 Reliable Intensity Vector Selection for Multi-Source Direction-of-Arrival Estimation Using a Single Acoustic Vector Sensor Interspeech 2021 Replica Exchange for Non-Convex Optimization JMLR 2021