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)

Large-Scale Optimization Algorithms for Sparse Conditional Gaussian Graphical Models AISTATS 2016 Large-Scale Price Optimization via Network Flow NeurIPS 2016 Large-Scale Semantic 3D Reconstruction: An Adaptive Multi-Resolution Model for Multi-Class Volumetric Labeling CVPR 2016 LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain NeurIPS 2016 Learning Acyclic Directed Mixed Graphs from Observations and Interventions PGM 2016 Learning Additive Exponential Family Graphical Models via ℓ_2,1-norm Regularized M-Estimation NeurIPS 2016 Learning Algorithms for Second-Price Auctions with Reserve JMLR 2016 Learning Bayesian networks with ancestral constraints NeurIPS 2016 Learning Combinatorial Functions from Pairwise Comparisons COLT 2016 Learning from Multiway Data: Simple and Efficient Tensor Regression ICML 2016 Learning in Games: Robustness of Fast Convergence NeurIPS 2016 Learning Kernels with Random Features NeurIPS 2016 Learning Simple Auctions COLT 2016 Learning Sparse Additive Models with Interactions in High Dimensions AISTATS 2016 Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization ICML 2016 Learning Sparse Gaussian Graphical Models with Overlapping Blocks NeurIPS 2016 Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods NeurIPS 2016 Learning Tree Structured Potential Games NeurIPS 2016 Leveraging Sparsity for Efficient Submodular Data Summarization NeurIPS 2016 Limits on Sparse Support Recovery via Linear Sketching with Random Expander Matrices AISTATS 2016 Linear Contextual Bandits with Knapsacks NeurIPS 2016 Linear Convergence of Randomized Feasible Descent Methods Under the Weak Strong Convexity Assumption JMLR 2016 Linearized Alternating Direction Method of Multipliers for Constrained Nonconvex Regularized Optimization ACML 2016 Linear-Memory and Decomposition-Invariant Linearly Convergent Conditional Gradient Algorithm for Structured Polytopes NeurIPS 2016 Linear Relaxations for Finding Diverse Elements in Metric Spaces NeurIPS 2016