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)
Combating Collusion Rings Is Hard but Possible
AAAI 2022
Combinatorial Bandits with Linear Constraints: Beyond Knapsacks and Fairness
NeurIPS 2022
Combinatorial Bayesian optimization with random mapping functions to convex polytopes
UAI 2022
Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract)
IJCAI 2022
Combining Constraint Solving and Bayesian Techniques for System Optimization
IJCAI 2022
Combining (Second-Order) Graph-Based and Headed-Span-Based Projective Dependency Parsing
ACL 2022
Communication Acceleration of Local Gradient Methods via an Accelerated Primal-Dual Algorithm with an Inexact Prox
NeurIPS 2022
Competitive Analysis for Multi-Commodity Ski-Rental Problem
IJCAI 2022
Compilation of Aggregates in ASP Systems
AAAI 2022
Complete Policy Regret Bounds for Tallying Bandits
COLT 2022
Complex Momentum for Optimization in Games
AISTATS 2022
Compressible-composable NeRF via Rank-residual Decomposition
NeurIPS 2022
Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs
NeurIPS 2022
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study
AAAI 2022
Computing Wasserstein-p Distance Between Images With Linear Cost
CVPR 2022
Conditional Gradients for the Approximately Vanishing Ideal
AISTATS 2022
Conditional Loss and Deep Euler Scheme for Time Series Generation
AAAI 2022
Confident Approximate Policy Iteration for Efficient Local Planning in q^π-realizable MDPs
NeurIPS 2022
Conflict-Based Steiner Search for Multi-Agent Combinatorial Path Finding
RSS 2022
Conformal Frequency Estimation with Sketched Data
NeurIPS 2022
Congested Bandits: Optimal Routing via Short-term Resets
ICML 2022
Consensus Multiplicative Weights Update: Learning to Learn using Projector-based Game Signatures
ICML 2022
CoNSoLe: Convex Neural Symbolic Learning
NeurIPS 2022
Constrained Discrete Black-Box Optimization using Mixed-Integer Programming
ICML 2022
Constrained Langevin Algorithms with L-mixing External Random Variables
NeurIPS 2022