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

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)

Fair Division Through Information Withholding AAAI 2020 Fairness in Streaming Submodular Maximization: Algorithms and Hardness NeurIPS 2020 Fair regression with Wasserstein barycenters NeurIPS 2020 Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint NeurIPS 2020 Fast Algorithms for Computational Optimal Transport and Wasserstein Barycenter AISTATS 2020 Fast and Accurate Non-Projective Dependency Tree Linearization ACL 2020 Fast and Efficient Boolean Matrix Factorization by Geometric Segmentation AAAI 2020 Fast and Parallel Decomposition of Constraint Satisfaction Problems IJCAI 2020 Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints ICML 2020 Fast computation of Nash Equilibria in Imperfect Information Games ICML 2020 Fast Convergence of Langevin Dynamics on Manifold: Geodesics meet Log-Sobolev NeurIPS 2020 Fast Deterministic CUR Matrix Decomposition with Accuracy Assurance ICML 2020 Fast Differentiable Sorting and Ranking ICML 2020 Fast Epigraphical Projection-based Incremental Algorithms for Wasserstein Distributionally Robust Support Vector Machine NeurIPS 2020 Faster algorithms for Markov equivalence UAI 2020 Faster Graph Embeddings via Coarsening ICML 2020 Faster Projection-free Online Learning COLT 2020 Faster Randomized Infeasible Interior Point Methods for Tall/Wide Linear Programs NeurIPS 2020 Faster saddle-point optimization for solving large-scale Markov decision processes L4DC 2020 Faster Wasserstein Distance Estimation with the Sinkhorn Divergence NeurIPS 2020 Fast Exact Matrix Completion: A Unified Optimization Framework for Matrix Completion JMLR 2020 Fast Markov chain Monte Carlo algorithms via Lie groups AISTATS 2020 Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients JMLR 2020 Fast OSCAR and OWL Regression via Safe Screening Rules ICML 2020 Fast Postprocessing for Difficult Discrete Energy Minimization Problems WACV 2020