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)

(Probably) Concave Graph Matching NeurIPS 2018 Profitable Bandits ACML 2018 Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity ICML 2018 Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy ICML 2018 Provable Estimation of the Number of Blocks in Block Models AISTATS 2018 Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function NAACL 2018 Provable Variational Inference for Constrained Log-Submodular Models NeurIPS 2018 Provably Correct Algorithms for Matrix Column Subset Selection with Selectively Sampled Data JMLR 2018 Provably Correct Automatic Sub-Differentiation for Qualified Programs NeurIPS 2018 Proximal SCOPE for Distributed Sparse Learning NeurIPS 2018 Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence ALT 2018 Pyconstruct: Constraint Programming Meets Structured Prediction IJCAI 2018 Quadratic Decomposable Submodular Function Minimization NeurIPS 2018 Quadrature-based features for kernel approximation NeurIPS 2018 Quantifying Algorithmic Improvements over Time IJCAI 2018 Quantum Divide-and-Conquer Anchoring for Separable Non-negative Matrix Factorization IJCAI 2018 Randomized Block Cubic Newton Method ICML 2018 Recurrent World Models Facilitate Policy Evolution NeurIPS 2018 Reduced Cost Fixing for Maximum Satisfiability IJCAI 2018 Refining the Confidence Level for Optimistic Bandit Strategies JMLR 2018 Regional Multi-Armed Bandits AISTATS 2018 Regret Bounds for Online Portfolio Selection with a Cardinality Constraint NeurIPS 2018 Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator NeurIPS 2018 Regularized Optimal Transport and the Rot Mover's Distance JMLR 2018 Reinforcement Learning for Solving the Vehicle Routing Problem NeurIPS 2018