Improved bounds for randomized Schatten norm estimation of numerically low-rank matrices
Abstract: In this work, we analyze the variance of a stochastic estimator for computing Schatten norms of matrices. The estimator extracts information from a single sketch of the matrix, that is, the product of the matrix with a few standard Gaussian random vectors. While this estimator has been proposed and used in the literature before, the existing variance bounds are often pessimistic. Our work provides a new upper bound and estimates of the variance of this estimator. These theoretical findings are supported by numerical experiments, demonstrating that the new bounds are significantly tighter than the existing ones in the case of numerically low-rank matrices.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.