2 citations · 3 across the 5 of their papers we have counts for
12 papers
Entrywise Approximate Solutions for SDDM Systems in Almost-Linear Time
Angelo Farfan, Mehrdad Ghadiri, Junzhao Yang
We present an algorithm that given any invertible symmetric diagonally dominant M-matrix (SDDM), i.e., a principal submatrix of a graph Laplacian, and a n…
A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition
Matthew Fahrbach, Mehrdad Ghadiri
We prove that the classic approximation guarantee for the higher-order singular value decomposition (HOSVD) is tight by constructing a tensor for which HOSVD achieves an approximat…
A Note on the Stability of the Sherman-Morrison-Woodbury Formula
Linkai Ma, Christos Boutsikas, Mehrdad Ghadiri +1
We study the numerical stability of the Sherman-Morrison-Woodbury (SMW) identity. Let and assume and both have full-column rank. We explore error bounds for…
Entrywise Approximation for Matrix Inversion and Linear Systems
Mehrdad Ghadiri, Hoai-An Nguyen, Junzhao Yang
We study the bit complexity of inverting diagonally dominant matrices, which are associated with random walk quantities such as hitting times and escape probabilities. Such quantit…
Fast Tensor Completion via Approximate Richardson Iteration
Mehrdad Ghadiri, Matthew Fahrbach, Yunbum Kook +1
We study tensor completion (TC) through the lens of low-rank tensor decomposition (TD). Many TD algorithms use fast alternating minimization methods to solve highly structured line…
Entrywise Approximate Laplacian Solving
Jingbang Chen, Mehrdad Ghadiri, Hoai-An Nguyen +2
We study the escape probability problem in random walks over graphs. Given vertices, and , the problem asks for the probability that a random walk starting at will hi…