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 benefits of sharing: a cloud-aided performance-driven framework to learn optimal feedback policies L4DC 2021 The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood COLT 2021 The Complexity Landscape of Claim-Augmented Argumentation Frameworks AAAI 2021 The complexity of nonconvex-strongly-concave minimax optimization UAI 2021 The Complexity of Sparse Tensor PCA NeurIPS 2021 The Decoupled Extended Kalman Filter for Dynamic Exponential-Family Factorization Models JMLR 2021 The Effects of Mild Over-parameterization on the Optimization Landscape of Shallow ReLU Neural Networks COLT 2021 The ensmallen library for flexible numerical optimization JMLR 2021 The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle NeurIPS 2021 The Impact of Data on the Stability of Learning-Based Control L4DC 2021 The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities COLT 2021 The Lazy Online Subgradient Algorithm is Universal on Strongly Convex Domains NeurIPS 2021 The Limits of Min-Max Optimization Algorithms: Convergence to Spurious Non-Critical Sets ICML 2021 The Limits of Optimal Pricing in the Dark NeurIPS 2021 The Many Faces of Adversarial Risk NeurIPS 2021 The Maximin Support Method: An Extension of the D’Hondt Method to Approval-Based Multiwinner Elections AAAI 2021 The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication COLT 2021 Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives AAAI 2021 Theory of Spectral Method for Union of Subspaces-Based Random Geometry Graph ICML 2021 The Parameterized Complexity of Connected Fair Division IJCAI 2021 The Pareto Frontier of model selection for general Contextual Bandits NeurIPS 2021 The Power of Adaptivity for Stochastic Submodular Cover ICML 2021 The Power of Factorial Powers: New Parameter settings for (Stochastic) Optimization ACML 2021 The Price of Anarchy in ROSCAS with Risk Averse Agents AAAI 2021 The Price of Connectivity in Fair Division AAAI 2021