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)

Approximation Algorithms for ℓ_0-Low Rank Approximation NeurIPS 2017 Approximation Vector Machines for Large-scale Online Learning JMLR 2017 A Quantum-Inspired Ensemble Method and Quantum-Inspired Forest Regressors ACML 2017 A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates ICML 2017 ASAGA: Asynchronous Parallel SAGA AISTATS 2017 A Sample Complexity Measure with Applications to Learning Optimal Auctions NeurIPS 2017 A SAT Approach to Branchwidth IJCAI 2017 A Scalable Approach to Chasing Multiple Moving Targets with Multiple Agents IJCAI 2017 A Scale Free Algorithm for Stochastic Bandits with Bounded Kurtosis NeurIPS 2017 A Screening Rule for l1-Regularized Ising Model Estimation NeurIPS 2017 A Semismooth Newton Method for Fast, Generic Convex Programming ICML 2017 A Simulated Annealing Based Inexact Oracle for Wasserstein Loss Minimization ICML 2017 A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching CVPR 2017 A Study on Trust Region Update Rules in Newton Methods for Large-scale Linear Classification ACML 2017 A survey of Algorithms and Analysis for Adaptive Online Learning JMLR 2017 Asynchronous Coordinate Descent under More Realistic Assumptions NeurIPS 2017 Asynchronous Parallel Coordinate Minimization for MAP Inference NeurIPS 2017 A Unified Analysis of Stochastic Optimization Methods Using Jump System Theory and Quadratic Constraints COLT 2017 A Unified Computational and Statistical Framework for Nonconvex Low-rank Matrix Estimation AISTATS 2017 A Unified Formulation and Fast Accelerated Proximal Gradient Method for Classification JMLR 2017 A Unified Optimization View on Generalized Matching Pursuit and Frank-Wolfe AISTATS 2017 A Unified Variance Reduction-Based Framework for Nonconvex Low-Rank Matrix Recovery ICML 2017 A Universal Analysis of Large-Scale Regularized Least Squares Solutions NeurIPS 2017 AutoFolio: An Automatically Configured Algorithm Selector (Extended Abstract) IJCAI 2017 Automatic Alignment Between Classroom Lecture Utterances and Slide Components Interspeech 2017