Hardness of Low Rank Approximation of Entrywise Transformed Matrix Products

Inspired by fast algorithms in natural language processing, we study low rank approximation in the entrywise transformed setting where we want to find a good rank k approximation to f(U · V), where U, V^top ∈ ℝn × r are given, r = O(log(n)), and f(x) is a general scalar function. Previous work in sublinear low rank approximation has shown that if both (1) U = V^top and (2) f(x) is a PSD kernel function, then there is an O(nkω-1) time constant relative error approximation algorithm, where ω ≈ 2.376 is the exponent of matrix multiplication. We give the first conditional time hardness results for this problem, demonstrating that both conditions (1) and (2) are in fact necessary for getting better than n2-o(1) time for a relative error low rank approximation for a wide class of functions. We give novel reductions from the Strong Exponential Time Hypothesis (SETH) that rely on lower bounding the leverage scores of flat sparse vectors and hold even when the rank of the transformed matrix f(UV) and the target rank are no(1), and when U = V^top. Furthermore, even when f(x) = xp is a simple polynomial, we give runtime lower bounds in the case when U neq V^top of the form Omega(min(n2-o(1), Omega(2p))). Lastly, we demonstrate that our lower bounds are tight by giving an O(n · poly(k, 2p, 1/ε)) time relative error approximation algorithm and a fast O(n · poly(k, p, 1/ε)) additive error approximation using fast tensor-based sketching. Additionally, since our low rank algorithms rely on matrix-vector product subroutines, our lower bounds extend to show that computing f(UV)W, for even a small matrix W, requires Omega(n2-o(1)) time.