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)
Estimate Sequences for Stochastic Composite Optimization: Variance Reduction, Acceleration, and Robustness to Noise
JMLR 2020
Estimating Reachable Sets with Scenario Optimization
L4DC 2020
Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms
AAAI 2020
Estimating the Error of Randomized Newton Methods: A Bootstrap Approach
ICML 2020
Evaluating and Rewarding Teamwork Using Cooperative Game Abstractions
NeurIPS 2020
Evaluating Approval-Based Multiwinner Voting in Terms of Robustness to Noise
IJCAI 2020
Evaluating Committees for Representative Democracies: the Distortion and Beyond
IJCAI 2020
Evaluating Natural Language Generation via Unbalanced Optimal Transport
IJCAI 2020
Evolutionary Topology Search for Tensor Network Decomposition
ICML 2020
Exact and Efficient Inference for Collective Flow Diffusion Model via Minimum Convex Cost Flow Algorithm
AAAI 2020
Experimental Design for Optimization of Orthogonal Projection Pursuit Models
AAAI 2020
Explicit Gradient Learning for Black-Box Optimization
ICML 2020
Exploiting Conic Affinity Measures to Design Speech Enhancement Systems Operating in Unseen Noise Conditions
Interspeech 2020
Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous Bandits
NeurIPS 2020
Exploiting Model Sparsity in Adaptive MPC: A Compressed Sensing Viewpoint
L4DC 2020
Exploration by Optimisation in Partial Monitoring
COLT 2020
Exploration Through Reward Biasing: Reward-Biased Maximum Likelihood Estimation for Stochastic Multi-Armed Bandits
ICML 2020
Exploratory Combinatorial Optimization with Reinforcement Learning
AAAI 2020
Explore Aggressively, Update Conservatively: Stochastic Extragradient Methods with Variable Stepsize Scaling
NeurIPS 2020
Exponentiated Gradient Meets Gradient Descent
ALT 2020
Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints
IJCAI 2020
Extrapolating the profile of a finite population
COLT 2020
Eyes-Closed Safety Kernels: Safety of Autonomous Systems Under Loss of Observability
RSS 2020
Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives
AAAI 2020
Fair Division: The Computer Scientist’s Perspective
IJCAI 2020