Mathematics & Optimization
19,283 papers (0 classified directly here)
Subtopics · a paper can sit in several, so these overlap
Papers per year
1
2
8
13
8
24
100
100
125
139
182
227
311
530
574
599
676
880
1,053
1,491
1,739
1,880
1,904
2,070
2,345
1,785
517
2000
'5
'10
'15
'20
'25
Papers (including subtopics)
Multi-objective Model-based Policy Search for Data-efficient Learning with Sparse Rewards
CoRL 2018
Multi-Objective Optimization Through Pareto Minimal Correction Subsets
IJCAI 2018
Multi-Path Transport for RDMA in Datacenters
NSDI 2018
{Multi-Player Bandits Revisited}
ALT 2018
Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games
NeurIPS 2018
Multi-Robot Motion Planning with Dynamics Guided by Multi-Agent Search
IJCAI 2018
Multi-scale Nystrom Method
AISTATS 2018
Multi-Scale Weighted Nuclear Norm Image Restoration
CVPR 2018
Multi-Sentence Compression with Word Vertex-Labeled Graphs and Integer Linear Programming
NAACL 2018
Multi-talker Speech Separation Based on Permutation Invariant Training and Beamforming
Interspeech 2018
Multitask Boosting for Survival Analysis with Competing Risks
NeurIPS 2018
Multi-Task Learning by Maximizing Statistical Dependence
CVPR 2018
Multiwinner Voting with Fairness Constraints
IJCAI 2018
Multiwinner Voting with Restricted Admissible Sets: Complexity and Strategyproofness
IJCAI 2018
Mutual Information Neural Estimation
ICML 2018
NAIS-Net: Stable Deep Networks from Non-Autonomous Differential Equations
NeurIPS 2018
Narrative Schema Stability in News Text
COLING 2018
N-ary Relation Extraction using Graph-State LSTM
EMNLP 2018
Natasha 2: Faster Non-Convex Optimization Than SGD
NeurIPS 2018
Nearly Optimal Robust Subspace Tracking
ICML 2018
Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes
NeurIPS 2018
Near-Optimal Budgeted Data Exchange for Distributed Loop Closure Detection
RSS 2018
Near Optimal Frequent Directions for Sketching Dense and Sparse Matrices
ICML 2018
Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models
NeurIPS 2018
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities
COLT 2018