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)
Submodular + Concave
NeurIPS 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
ICML 2021
Submodular Span, with Applications to Conditional Data Summarization
AAAI 2021
Suboptimal coverings for continuous spaces of control tasks
L4DC 2021
Sum-product laws and efficient algorithms for imprecise Markov chains
UAI 2021
Supervised Tree-Wasserstein Distance
ICML 2021
Support Recovery of Sparse Signals from a Mixture of Linear Measurements
NeurIPS 2021
Surprisingly Popular Voting Recovers Rankings, Surprisingly!
IJCAI 2021
Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information
COLT 2021
Symbolic Dynamic Programming for Continuous State MDPs with Linear Program Transitions
IJCAI 2021
Symbolic Regression via Deep Reinforcement Learning Enhanced Genetic Programming Seeding
NeurIPS 2021
Symbolic Search for Oversubscription Planning
AAAI 2021
Symmetric Component Caching for Model Counting on Combinatorial Instances
AAAI 2021
Symmetric Wasserstein autoencoders
UAI 2021
Synchronization of Group-Labelled Multi-Graphs
ICCV 2021
Synthesizing Good-Enough Strategies for LTLf Specifications
IJCAI 2021
Synthetic Design: An Optimization Approach to Experimental Design with Synthetic Controls
NeurIPS 2021
System Performance as a Function of Calibration Methods, Sample Size and Sampling Variability in Likelihood Ratio-Based Forensic Voice Comparison
Interspeech 2021
Taming Communication and Sample Complexities in Decentralized Policy Evaluation for Cooperative Multi-Agent Reinforcement Learning
NeurIPS 2021
Tango: Declarative Semantics for Multiagent Communication Protocols
IJCAI 2021
Task-Optimal Exploration in Linear Dynamical Systems
ICML 2021
Teaching the Old Dog New Tricks: Supervised Learning with Constraints
AAAI 2021
TenIPS: Inverse Propensity Sampling for Tensor Completion
AISTATS 2021
Testing Group Fairness via Optimal Transport Projections
ICML 2021
Text AutoAugment: Learning Compositional Augmentation Policy for Text Classification
EMNLP 2021