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)
Improving the Privacy and Practicality of Objective Perturbation for Differentially Private Linear Learners
NeurIPS 2023
Improving word mover’s distance by leveraging self-attention matrix
EMNLP 2023
IMPsys: An Intelligent Mold Processing System for Smart Factory
IJCAI 2023
Incentive-aware Contextual Pricing with Non-parametric Market Noise
AISTATS 2023
Incentive-Boosted Federated Crowdsourcing
AAAI 2023
Incentivizing Exploration with Linear Contexts and Combinatorial Actions
ICML 2023
Incremental Aggregated Riemannian Gradient Method for Distributed PCA
AISTATS 2023
Individually Fair Learning with One-Sided Feedback
ICML 2023
Infinite-dimensional optimization and Bayesian nonparametric learning of stochastic differential equations
JMLR 2023
InfoOT: Information Maximizing Optimal Transport
ICML 2023
Information Design in Multi-Agent Reinforcement Learning
NeurIPS 2023
Information-Directed Selection for Top-Two Algorithms
COLT 2023
Information-guided Planning: An Online Approach for Partially Observable Problems
NeurIPS 2023
INGENIOUS: Using Informative Data Subsets for Efficient Pre-Training of Language Models
EMNLP 2023
Injecting Multimodal Information into Rigid Protein Docking via Bi-level Optimization
NeurIPS 2023
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games
AISTATS 2023
Instance-Optimality in Interactive Decision Making: Toward a Non-Asymptotic Theory
COLT 2023
InstOptima: Evolutionary Multi-objective Instruction Optimization via Large Language Model-based Instruction Operators
EMNLP 2023
Intrinsic Sliced Wasserstein Distances for Comparing Collections of Probability Distributions on Manifolds and Graphs
ICML 2023
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?
IJCAI 2023
iPlanner: Imperative Path Planning
RSS 2023
ISAAC Newton: Input-based Approximate Curvature for Newton's Method
ICLR 2023
Is Consensus Acceleration Possible in Decentralized Optimization over Slowly Time-Varying Networks?
ICML 2023
Ising-Traffic: Using Ising Machine Learning to Predict Traffic Congestion under Uncertainty
AAAI 2023
Is Learning in Games Good for the Learners?
NeurIPS 2023