4 papers
Sparsifying Sums of Positive Semidefinite Matrices
Arpon Basu, Pravesh K. Kothari, Yang P. Liu +1
In this paper, we revisit spectral sparsification for sums of arbitrary positive semidefinite (PSD) matrices. Concretely, for any collection of PSD matrices $\mathcal{A} = \{A_1, A…
Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization
Yang P. Liu, Richard Peng, Colin Tang +2
Consider the empirical risk minimization (ERM) problem, which is stated as follows. Let be compact convex sets with for $i \in [m…
Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method
Yang P. Liu
We give an algorithm that takes a directed graph undergoing edge insertions with lengths in , and maintains -approximate shortest path distances from a fixe…
Approximate Spanning Tree Counting from Uncorrelated Edge Sets
Yang P. Liu, Richard Peng, Junzhao Yang
We show an time algorithm that on a graph with edges and vertices outputs its spanning tree count up to a multiplicative factor wi…