Mathematics

Faster Wasserstein Distance Estimation with the Sinkhorn Divergence NeurIPS 2020 Fast Matrix Square Roots with Applications to Gaussian Processes and Bayesian Optimization NeurIPS 2020 Fast MSER CVPR 2020 Fast Unbalanced Optimal Transport on a Tree NeurIPS 2020 Fiedler Regularization: Learning Neural Networks with Graph Sparsity ICML 2020 Finding Friends and Flipping Frenemies: Automatic Paraphrase Dataset Augmentation Using Graph Theory EMNLP 2020 Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes AAAI 2020 Finding Most Compatible Phylogenetic Trees over Multi-State Characters AAAI 2020 Finding Second-Order Stationary Points Efficiently in Smooth Nonconvex Linearly Constrained Optimization Problems NeurIPS 2020 Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm NeurIPS 2020 Forgetting an Argument AAAI 2020 Forgetting Auxiliary Atoms in Forks (Extended Abstract) IJCAI 2020 Formal Limitations on the Measurement of Mutual Information AISTATS 2020 FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints AAAI 2020 Fourier Sparse Leverage Scores and Approximate Kernel Learning NeurIPS 2020 Fractal Gaussian Networks: A sparse random graph model based on Gaussian Multiplicative Chaos ICML 2020 Free Energy Wells and Overlap Gap Property in Sparse PCA COLT 2020 From Nesterov’s Estimate Sequence to Riemannian Acceleration COLT 2020 From tree matching to sparse graph alignment COLT 2020 Full Law Identification in Graphical Models of Missing Data: Completeness Results ICML 2020 Gaussian Sketching yields a J-L Lemma in RKHS AISTATS 2020 General Identification of Dynamic Treatment Regimes Under Interference AISTATS 2020 Generalised Bayesian Filtering via Sequential Monte Carlo NeurIPS 2020 Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search AAAI 2020 Generalized Leverage Score Sampling for Neural Networks NeurIPS 2020