Mathematics & Optimization

Familywise Error Rate Control by Interactive Unmasking ICML 2020 Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint NeurIPS 2020 Fast Algorithms for Computational Optimal Transport and Wasserstein Barycenter AISTATS 2020 Fast and Accurate Non-Projective Dependency Tree Linearization ACL 2020 Fast and Consistent Learning of Hidden Markov Models by Incorporating Non-Consecutive Correlations ICML 2020 Fast and Efficient Boolean Matrix Factorization by Geometric Segmentation AAAI 2020 Fast and Parallel Decomposition of Constraint Satisfaction Problems IJCAI 2020 Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints ICML 2020 Fast computation of Nash Equilibria in Imperfect Information Games ICML 2020 Fast Convergence of Langevin Dynamics on Manifold: Geodesics meet Log-Sobolev NeurIPS 2020 Fast Deterministic CUR Matrix Decomposition with Accuracy Assurance ICML 2020 Fast Differentiable Sorting and Ranking ICML 2020 Fast Epigraphical Projection-based Incremental Algorithms for Wasserstein Distributionally Robust Support Vector Machine NeurIPS 2020 Faster algorithms for Markov equivalence UAI 2020 Faster Graph Embeddings via Coarsening ICML 2020 Faster Projection-free Online Learning COLT 2020 Faster Randomized Infeasible Interior Point Methods for Tall/Wide Linear Programs NeurIPS 2020 Faster saddle-point optimization for solving large-scale Markov decision processes L4DC 2020 Faster Wasserstein Distance Estimation with the Sinkhorn Divergence NeurIPS 2020 Fast Exact Matrix Completion: A Unified Optimization Framework for Matrix Completion JMLR 2020 Fast Markov chain Monte Carlo algorithms via Lie groups AISTATS 2020 Fast Matrix Square Roots with Applications to Gaussian Processes and Bayesian Optimization NeurIPS 2020 Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients JMLR 2020 Fast MSER CVPR 2020 Fast OSCAR and OWL Regression via Safe Screening Rules ICML 2020