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)

Learning in Hilbert vs. Banach Spaces: A Measure Embedding Viewpoint NeurIPS 2011 Learning Scale Free Networks by Reweighted ℓ_1 regularization AISTATS 2011 Learning Sparse Representations of High Dimensional Data on Large Scale Dictionaries NeurIPS 2011 Lightweight Implementations of Probabilistic Programming Languages Via Transformational Compilation AISTATS 2011 Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation NeurIPS 2011 Linear Submodular Bandits and their Application to Diversified Retrieval NeurIPS 2011 Load Balancing for Mobility-on-Demand Systems RSS 2011 Maximal Cliques that Satisfy Hard Constraints with Application to Deformable Object Model Learning NeurIPS 2011 Maximum Likelihood vs. Sequential Normalized Maximum Likelihood in On-line Density Estimation COLT 2011 Minimax Localization of Structural Information in Large Noisy Matrices NeurIPS 2011 Minimax Policies for Combinatorial Prediction Games COLT 2011 Minimax Regret of Finite Partial-Monitoring Games in Stochastic Environments COLT 2011 Models of Cooperative Teaching and Learning JMLR 2011 Monotone multi-armed bandit allocations COLT 2011 Motion Planning Under Uncertainty In Highly Deformable Environments RSS 2011 Multi-armed bandits on implicit metric spaces NeurIPS 2011 Multi-Bandit Best Arm Identification NeurIPS 2011 Multilinear Subspace Regression: An Orthogonal Tensor Decomposition Approach NeurIPS 2011 Nearest Neighbor based Greedy Coordinate Descent NeurIPS 2011 Neural Reconstruction with Approximate Message Passing (NeuRAMP) NeurIPS 2011 Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction NeurIPS 2011 Neyman-Pearson classification under a strict constraint COLT 2011 Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning NeurIPS 2011 Non-parametric Group Orthogonal Matching Pursuit for Sparse Learning with Multiple Kernels NeurIPS 2011 On fast approximate submodular minimization NeurIPS 2011