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)

Recovering the Optimal Solution by Dual Random Projection COLT 2013 Recurrent networks of coupled Winner-Take-All oscillators for solving constraint satisfaction problems NeurIPS 2013 Recursive Estimation of the Stein Center of SPD Matrices and Its Applications ICCV 2013 Reflection methods for user-friendly submodular optimization NeurIPS 2013 Regression-tree Tuning in a Streaming Setting NeurIPS 2013 Regret based Robust Solutions for Uncertain Markov Decision Processes NeurIPS 2013 Regularization-Free Principal Curve Estimation JMLR 2013 Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima NeurIPS 2013 Relative Volume Constraints for Single View 3D Reconstruction CVPR 2013 Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees COLT 2013 Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization ICML 2013 Revisiting the PnP Problem: A Fast, General and Optimal Solution ICCV 2013 Robust Canonical Time Warping for the Alignment of Grossly Corrupted Sequences CVPR 2013 Robust Data-Driven Dynamic Programming NeurIPS 2013 Robust learning of low-dimensional dynamics from large neural ensembles NeurIPS 2013 Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matching NeurIPS 2013 Robust Regression on MapReduce ICML 2013 Robust Sparse Principal Component Regression under the High Dimensional Elliptical Model NeurIPS 2013 Robust Transfer Principal Component Analysis with Rank Constraints NeurIPS 2013 Robust Tucker Tensor Decomposition for Effective Image Representation ICCV 2013 Rotation, Scaling and Deformation Invariant Scattering for Texture Discrimination CVPR 2013 Rounding Methods for Discrete Linear Classification ICML 2013 Safe Screening of Non-Support Vectors in Pathwise SVM Computation ICML 2013 Scalable Influence Estimation in Continuous-Time Diffusion Networks NeurIPS 2013 Scalable Simple Random Sampling and Stratified Sampling ICML 2013