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)

Dueling Convex Optimization ICML 2021 Dynamic influence maximization NeurIPS 2021 Dynamic Proportional Rankings IJCAI 2021 Dynamic Rebalancing Dockless Bike-Sharing System based on Station Community Discovery IJCAI 2021 Dynamic Sasvi: Strong Safe Screening for Norm-Regularized Least Squares NeurIPS 2021 Dynamics of Stochastic Momentum Methods on Large-scale, Quadratic Models NeurIPS 2021 Dynamic Trace Estimation NeurIPS 2021 EasyASR: A Distributed Machine Learning Platform for End-to-end Automatic Speech Recognition AAAI 2021 Edge Sampling Using Local Network Information JMLR 2021 EF21: A New, Simpler, Theoretically Better, and Practically Faster Error Feedback NeurIPS 2021 Effective Snapshot Compressive-Spectral Imaging via Deep Denoising and Total Variation Priors CVPR 2021 Efficient and Local Parallel Random Walks NeurIPS 2021 Efficient Balanced Treatment Assignments for Experimentation AISTATS 2021 Efficient Bandit Convex Optimization: Beyond Linear Losses COLT 2021 Efficient Coreset Constructions via Sensitivity Sampling ACML 2021 Efficient debiased evidence estimation by multilevel Monte Carlo sampling UAI 2021 Efficient Designs Of SLOPE Penalty Sequences In Finite Dimension AISTATS 2021 Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games ICML 2021 Efficient Empowerment Estimation for Unsupervised Stabilization ICLR 2021 Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination NeurIPS 2021 Efficient greedy coordinate descent via variable partitioning UAI 2021 Efficient Initial Pose-Graph Generation for Global SfM CVPR 2021 Efficient Large Scale Inlier Voting for Geometric Vision Problems ICCV 2021 Efficiently Explaining CSPs with Unsatisfiable Subset Optimization IJCAI 2021 Efficient Message Passing for 0–1 ILPs with Binary Decision Diagrams ICML 2021