Stochastic Trace and Diagonal Estimator for Tensors
Bhisham Dev Verma, Rameshwar Pratap, Keegan Kang
TL;DR
The paper investigates implicit estimation of the trace and diagonal entries of N-order tensors via tensor-vector queries, filling a gap in extending Hutchinson-type estimators from matrices to tensors. It introduces unbiased estimators for both diagonal elements and the trace, along with variance bounds and concentration analyses under Rademacher and Gaussian inputs, and validates the theory with simulations. The proposed methods generalize the classical matrix estimators, recovering Hutchinson and Bekas results when N=2, and offer practical tools for efficient tensor-structured data analysis in settings where explicit tensor construction is expensive. Potential applications span hypergraph spectral theory, quantum computing, and other domains dealing with high-order tensors.
Abstract
We consider the problem of estimating the trace and diagonal entries of an N-order tensor (where $N \geq 2$) under the framework where the tensor can only be accessed through tensor-vector multiplication. The aim is to estimate the tensor's diagonal entries and trace by minimizing the number of tensor-vector queries. The seminal work of Hutchinson and its extended version due to Bekas et al. give unbiased estimates of the trace and diagonal elements of a given matrix, respectively, using matrix-vector queries. However, to the best of our knowledge, no analogous results are known for estimating the trace and diagonal entries of higher-order tensors using tensor-vector queries. This paper addresses this gap and presents unbiased estimators for the trace and diagonal entries of a tensor under this model. Our proposed methods can be seen as generalizations of Hutchinson's and Bekas et al.'s estimators and reduce to their estimators when N = 2. We provide a rigorous theoretical analysis of our proposals and complement it with supporting simulations.
