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)
Fast and Robust Shortest Paths on Manifolds Learned from Data
AISTATS 2019
Fast and Stable Maximum Likelihood Estimation for Incomplete Multinomial Models
ICML 2019
Fast Decomposable Submodular Function Minimization using Constrained Total Variation
NeurIPS 2019
Fast determinantal point processes via distortion-free intermediate sampling
COLT 2019
Faster Algorithms for Binary Matrix Factorization
ICML 2019
Faster Algorithms for High-Dimensional Robust Covariance Estimation
COLT 2019
Faster First-Order Methods for Stochastic Non-Convex Optimization on Riemannian Manifolds
AISTATS 2019
Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization
AAAI 2019
Faster Stochastic Alternating Direction Method of Multipliers for Nonconvex Optimization
ICML 2019
Faster width-dependent algorithm for mixed packing and covering LPs
NeurIPS 2019
Fast Incremental von Neumann Graph Entropy Computation: Theory, Algorithm, and Applications
ICML 2019
Fast Iterative Combinatorial Auctions via Bayesian Learning
AAAI 2019
Fast Low-rank Metric Learning for Large-scale and High-dimensional Data
NeurIPS 2019
Fast Mean Estimation with Sub-Gaussian Rates
COLT 2019
Fast Parallel Algorithms for Statistical Subset Selection Problems
NeurIPS 2019
Fast PMI-Based Word Embedding with Efficient Use of Unobserved Patterns
AAAI 2019
Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression
NeurIPS 2019
Fast Proximal Gradient Descent for A Class of Non-convex and Non-smooth Sparse Learning Problems
UAI 2019
Fast Sparse Group Lasso
NeurIPS 2019
Fast Stochastic Algorithms for Low-rank and Nonsmooth Matrix Problems
AISTATS 2019
Fast structure learning with modular regularization
NeurIPS 2019
Feature subset selection for the multinomial logit model via mixed-integer optimization
AISTATS 2019
FIESTA: Fast IdEntification of State-of-The-Art models using adaptive bandit algorithms
ACL 2019
Finding Mixed Nash Equilibria of Generative Adversarial Networks
ICML 2019
Finding Optimal Solutions in HTN Planning - A SAT-based Approach
IJCAI 2019