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 Role of Momentum Parameters in the Optimal Convergence of Adaptive Polyak's Heavy-ball Methods ICLR 2021 The Sample Complexity of Level Set Approximation AISTATS 2021 The Semi-Random Satisfaction of Voting Axioms NeurIPS 2021 The Smoothed Complexity of Computing Kemeny and Slater Rankings AAAI 2021 The Sparse Vector Technique, Revisited COLT 2021 The Symmetry between Arms and Knapsacks: A Primal-Dual Approach for Bandits with Knapsacks ICML 2021 The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound IJCAI 2021 The Unbalanced Gromov Wasserstein Distance: Conic Formulation and Relaxation NeurIPS 2021 Think Global and Act Local: Bayesian Optimisation over High-Dimensional Categorical and Mixed Search Spaces ICML 2021 Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss COLT 2021 Thompson Sampling Algorithms for Cascading Bandits JMLR 2021 Thompson Sampling for Bandits with Clustered Arms IJCAI 2021 Three Operator Splitting with a Nonconvex Loss Function ICML 2021 Three Operator Splitting with Subgradients, Stochastic Gradients, and Adaptive Learning Rates NeurIPS 2021 Thresholded Adaptive Validation: Tuning the Graphical Lasso for Graph Recovery AISTATS 2021 TIDOT: A Teacher Imitation Learning Approach for Domain Adaptation with Optimal Transport IJCAI 2021 Tight Regret Bounds for Infinite-armed Linear Contextual Bandits AISTATS 2021 Tight sampling and discarding bounds for scenario programs with an arbitrary number of removed samples L4DC 2021 Timeline Summarization based on Event Graph Compression via Time-Aware Optimal Transport EMNLP 2021 TMCOSS: Thresholded Multi-Criteria Online Subset Selection for Data-Efficient Autonomous Driving ICCV 2021 TNASP: A Transformer-based NAS Predictor with a Self-evolution Framework NeurIPS 2021 Top-k eXtreme Contextual Bandits with Arm Hierarchy ICML 2021 Topological Machine Learning Methods for Power System Responses to Contingencies AAAI 2021 Toward Determining NFA Equivalence via QBFs (Student Abstract) AAAI 2021 Toward Nearly-Zero-Error Sketching via Compressive Sensing NSDI 2021