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)

Robust Online Control with Model Misspecification L4DC 2022 Robust SDE-Based Variational Formulations for Solving Linear PDEs via Deep Learning ICML 2022 Robust Solutions for Multi-Defender Stackelberg Security Games IJCAI 2022 Robust Sparse Mean Estimation via Sum of Squares COLT 2022 Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks AISTATS 2022 Robust Subset Selection by Greedy and Evolutionary Pareto Optimization IJCAI 2022 Robust Tests in Online Decision-Making AAAI 2022 Robust Training in High Dimensions via Block Coordinate Geometric Median Descent AISTATS 2022 ROOT-SGD: Sharp Nonasymptotics and Asymptotic Efficiency in a Single Algorithm COLT 2022 Rotting Infinitely Many-Armed Bandits ICML 2022 RUMs from Head-to-Head Contests ICML 2022 Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables IJCAI 2022 Runtime Programmable Switches NSDI 2022 Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints ICML 2022 Safe Online Convex Optimization with Unknown Linear Safety Constraints AAAI 2022 Safe Opponent-Exploitation Subgame Refinement NeurIPS 2022 Safe Subgame Resolving for Extensive Form Correlated Equilibrium AAAI 2022 Safety Guarantees for Neural Network Dynamic Systems via Stochastic Barrier Functions NeurIPS 2022 SAGDA: Achieving O(ε^-2) Communication Complexity in Federated Min-Max Learning NeurIPS 2022 Sample Average Approximation for Stochastic Optimization with Dependent Data: Performance Guarantees and Tractability AAAI 2022 Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search NeurIPS 2022 Sample Complexity of Robust Reinforcement Learning with a Generative Model AISTATS 2022 Sample Complexity of the Robust LQG Regulator with Coprime Factors Uncertainty L4DC 2022 Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost ICML 2022 Sampling and Counting Acyclic Orientations in Chordal Graphs (Student Abstract) AAAI 2022