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)

Stochastic Three-Composite Convex Minimization NeurIPS 2016 Stochastic Variance Reduced Optimization for Nonconvex Sparse Learning ICML 2016 Stochastic Variance Reduction for Nonconvex Optimization ICML 2016 Stochastic Variance Reduction Methods for Saddle-Point Problems NeurIPS 2016 Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja’s Algorithm COLT 2016 Structure-Blind Signal Recovery NeurIPS 2016 Structured Matrix Recovery via the Generalized Dantzig Selector NeurIPS 2016 Structured Sparse Regression via Greedy Hard Thresholding NeurIPS 2016 Structure Learning of Partitioned Markov Networks ICML 2016 Sublabel-Accurate Relaxation of Nonconvex Energies CVPR 2016 Sublinear Time Orthogonal Tensor Decomposition NeurIPS 2016 Sub-sampled Newton Methods with Non-uniform Sampling NeurIPS 2016 Subspace Clustering With Priors via Sparse Quadratically Constrained Quadratic Programming CVPR 2016 Supervised Learning with Tensor Networks NeurIPS 2016 Tensor Decomposition via Joint Matrix Schur Decomposition ICML 2016 Tensor Power Iteration for Multi-Graph Matching CVPR 2016 Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimization CVPR 2016 The Chordal Graph Polytope for Learning Decomposable Models PGM 2016 The Effect of Combination Functions on the Complexity of Relational Bayesian Networks PGM 2016 The Multi-fidelity Multi-armed Bandit NeurIPS 2016 The Next Best Underwater View CVPR 2016 The non-convex Burer-Monteiro approach works on smooth semidefinite programs NeurIPS 2016 The Parallel Knowledge Gradient Method for Batch Bayesian Optimization NeurIPS 2016 The Parameterized Complexity of Approximate Inference in Bayesian Networks PGM 2016 The Power of Optimization from Samples NeurIPS 2016