Skip to content
conftrace_

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
16
133
440
1,353
1,441
2000
'5
'10
'15
'20
'25

Papers (including subtopics)

The FAST Algorithm for Submodular Maximization ICML 2020 The Fast Loaded Dice Roller: A Near-Optimal Exact Sampler for Discrete Probability Distributions AISTATS 2020 The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits AISTATS 2020 The Gradient Complexity of Linear Regression COLT 2020 The Impact of Selfishness in Hypergraph Hedonic Games AAAI 2020 The Kalai-Smorodinsky solution for many-objective Bayesian optimization JMLR 2020 The Maximum Separation Subspace in Sufficient Dimension Reduction with Categorical Response JMLR 2020 The Method of Random Directions Optimization for Stereo Audio Source Separation Interspeech 2020 Themis: Fair and Efficient GPU Cluster Scheduling NSDI 2020 The Nonstochastic Control Problem ALT 2020 The Power of Predictions in Online Control NeurIPS 2020 The Primal-Dual method for Learning Augmented Algorithms NeurIPS 2020 The Quantile Snapshot Scan: Comparing Quantiles of Spatial Data from Two Snapshots in Time AISTATS 2020 The route to chaos in routing games: When is price of anarchy too optimistic? NeurIPS 2020 The Statistical Complexity of Early-Stopped Mirror Descent NeurIPS 2020 The Strong Screening Rule for SLOPE NeurIPS 2020 The Wasserstein Proximal Gradient Algorithm NeurIPS 2020 Thompson Sampling Algorithms for Mean-Variance Bandits ICML 2020 Thompson Sampling for Adversarial Bit Prediction ALT 2020 Thresholding Bandit Problem with Both Duels and Pulls AISTATS 2020 Threshold Treewidth and Hypertree Width IJCAI 2020 Throughput-Optimal Topology Design for Cross-Silo Federated Learning NeurIPS 2020 Thunder: a Fast Coordinate Selection Solver for Sparse Learning NeurIPS 2020 Tight Approximation for Proportional Approval Voting IJCAI 2020 Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance ICML 2020