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)

Multi-Component Nonnegative Matrix Factorization IJCAI 2017 Multi-Information Source Optimization NeurIPS 2017 Multilevel Clustering via Wasserstein Means ICML 2017 Multi-objective Bandits: Optimizing the Generalized Gini Index ICML 2017 Multi-Objective Non-parametric Sequential Prediction NeurIPS 2017 Multi-Observation Elicitation COLT 2017 Multi-output Polynomial Networks and Factorization Machines NeurIPS 2017 Multiscale Quantization for Fast Similarity Search NeurIPS 2017 Multiscale Strategies for Computing Optimal Transport JMLR 2017 Multi-View Decision Processes: The Helper-AI Problem NeurIPS 2017 Multi-Way Multi-Level Kernel Modeling for Neuroimaging Classification CVPR 2017 Multiwinner Rules on Paths From k-Borda to Chamberlin–Courant IJCAI 2017 Nash Equilibria in Concurrent Games with Lexicographic Preferences IJCAI 2017 Natasha: Faster Non-Convex Stochastic Optimization via Strongly Non-Convex Parameter ICML 2017 Near-Feasible Stable Matchings with Budget Constraints IJCAI 2017 Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration NeurIPS 2017 Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection AISTATS 2017 Nearly Optimal Robust Matrix Completion ICML 2017 Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration COLT 2017 Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem NeurIPS 2017 Near-Optimal Design of Experiments via Regret Minimization ICML 2017 Near Optimal Sketching of Low-Rank Tensor Regression NeurIPS 2017 Net-Trim: Convex Pruning of Deep Neural Networks with Performance Guarantee NeurIPS 2017 Networked Fairness in Cake Cutting IJCAI 2017 Never Abandon Minorities: Exhaustive Extraction of Bursty Phrases on Microblogs Using Set Cover Problem EMNLP 2017