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)
BOBCAT: Bilevel Optimization-Based Computerized Adaptive Testing
IJCAI 2021
Boosting for Online Convex Optimization
ICML 2021
Bootstrapping Battery-free Wireless Networks: Efficient Neighbor Discovery and Synchronization in the Face of Intermittency
NSDI 2021
BOSS: A Bi-directional Search Technique for Optimal Coalition Structure Generation with Minimal Overlapping (Student Abstract)
AAAI 2021
Bounded-cost Search Using Estimates of Uncertainty
IJCAI 2021
Bounded Predicates in Description Logics with Counting
IJCAI 2021
Bounded Risk-Sensitive Markov Games: Forward Policy Design and Inverse Reward Learning with Iterative Reasoning and Cumulative Prospect Theory
AAAI 2021
Branch and Price for Bus Driver Scheduling with Complex Break Constraints
AAAI 2021
Breaking the Linear Iteration Cost Barrier for Some Well-known Conditional Gradient Methods Using MaxIP Data-structures
NeurIPS 2021
Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs
NeurIPS 2021
Budget-Constrained Coalition Strategies with Discounting
IJCAI 2021
Budgeted and Non-Budgeted Causal Bandits
AISTATS 2021
Budget Feasible Mechanisms Over Graphs
AAAI 2021
Byzantine-Resilient High-Dimensional SGD with Local Iterations on Heterogeneous Data
ICML 2021
Caerus: NIMBLE Task Scheduling for Serverless Analytics
NSDI 2021
Calculating the optimal step of arc-eager parsing for non-projective trees
EACL 2021
Calibrated Adaptive Probabilistic ODE Solvers
AISTATS 2021
Calibrated and Partially Calibrated Semi-Generalized Homographies
ICCV 2021
Can we globally optimize cross-validation loss? Quasiconvexity in ridge regression
NeurIPS 2021
Capturing Delayed Feedback in Conversion Rate Prediction via Elapsed-Time Sampling
AAAI 2021
Cardinality constrained submodular maximization for random streams
NeurIPS 2021
Cardinality-Regularized Hawkes-Granger Model
NeurIPS 2021
Cascade Size Distributions: Why They Matter and How to Compute Them Efficiently
AAAI 2021
Causal Bandits with Unknown Graph Structure
NeurIPS 2021
Certainty Equivalent Perception-Based Control
L4DC 2021