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)

Real-time prioritized kinematic control under inequality constraints for redundant manipulators RSS 2011 Regression on Fixed-Rank Positive Semidefinite Matrices: A Riemannian Approach JMLR 2011 Regularized Laplacian Estimation and Fast Eigenvector Approximation NeurIPS 2011 Reinforcement Learning using Kernel-Based Stochastic Factorization NeurIPS 2011 Revisiting MAP Estimation, Message Passing and Perfect Graphs AISTATS 2011 Robust approachability and regret minimization in games with partial monitoring COLT 2011 Robust Approximate Bilinear Programming for Value Function Approximation JMLR 2011 Robust Lasso with missing and grossly corrupted observations NeurIPS 2011 RTRMC: A Riemannian trust-region method for low-rank matrix completion NeurIPS 2011 Safe Learning: bridging the gap between Bayes, MDL and statistical learning theory via empirical convexity COLT 2011 Scalable Training of Mixture Models via Coresets NeurIPS 2011 Semi-supervised Learning by Higher Order Regularization AISTATS 2011 Shaping Level Sets with Submodular Functions NeurIPS 2011 Signal Estimation Under Random Time-Warpings and Nonlinear Signal Alignment NeurIPS 2011 SpaRCS: Recovering low-rank and sparse matrices from compressive measurements NeurIPS 2011 Sparse Estimation with Structured Dictionaries NeurIPS 2011 Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation NeurIPS 2011 Sparse Manifold Clustering and Embedding NeurIPS 2011 Sparse recovery by thresholded non-negative least squares NeurIPS 2011 Sparse Recovery with Brownian Sensing NeurIPS 2011 Sparsity Regret Bounds for Individual Sequences in Online Linear Regression COLT 2011 Statistical Optimization of Non-Negative Matrix Factorization AISTATS 2011 Statistical Performance of Convex Tensor Decomposition NeurIPS 2011 Statistical Tests for Optimization Efficiency NeurIPS 2011 Stochastic convex optimization with bandit feedback NeurIPS 2011