Abstract
Given an implicit n×n matrix A with oracle access x T A x for any x ∈ ℝn, we study the query complexity of randomized algorithms for estimating the trace of the matrix. This problem has many applications in quantum physics, machine learning, and pattern matching. Two metrics are commonly used for evaluating the estimators: i) variance; ii) a high probability multiplicative-approximation guarantee. Almost all the known estimators are of the form \(\frac{1}{k}\sum_{i=1}^k x_i^T A x_i\) for x i ∈ ℝn being i.i.d. for some special distribution. Our main results are summarized as follows:
-
1
We give an exact characterization of the minimum variance unbiased estimator in the broad class of linear nonadaptive estimators (which subsumes all the existing known estimators).
-
2
We also consider the query complexity lower bounds for any (possibly nonlinear and adaptive) estimators:
-
1
We show that any estimator requires Ω(1/ε) queries to have a guarantee of variance at most ε.
-
2
We show that any estimator requires \(\Omega(\frac{1}{\epsilon ^2}\log \frac{1}{\delta})\) to achieve a (1±ε)-multiplicative approximation guarantee with probability at least 1 − δ.
Both above lower bounds are asymptotically tight.
-
1
As a corollary, we also resolve a conjecture in the seminal work of Avron and Toledo (Journal of the ACM 2011) regarding the sample complexity of the Gaussian Estimator.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Atallah, M.J., Chyzak, F., Dumas, P.: A randomized algorithm for approximate string matching. Algorithmica 29(3), 468–486 (2001)
Atallah, M.J., Grigorescu, E., Wu, Y.: A lower-variance randomized algorithm for approximate string matching. Information Processing Letters 113(18), 690–692 (2013)
Avron, H., Toledo, S.: Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix. Journal of the ACM (JACM) 58(2), 8 (2011)
Avron, H.: Counting triangles in large graphs using randomized matrix trace estimation. In: Proceedings of KDD-LDMTA, vol. 10 (2010)
Drabold, D.A., Sankey, O.F.: Maximum entropy approach for linear scaling in the electronic structure problem. Physical Review Letters 70(23), 3631 (1993)
Hutchinson, M.F.: A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines. Communications in Statistics-Simulation and Computation 18(3), 1059–1076 (1989)
Iitaka, T., Ebisuzaki, T.: Random phase vector for calculating the trace of a large matrix. arXiv preprint cond-mat/0401202 (2004)
Li, Y., Nguyên, H.L., Woodruff, D.P.: On sketching matrix norms and the top singular vector. In: Proceedings of the Twenty Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (2014)
Roosta-Khorasani, F., Ascher, U.: Improved bounds on sample size for implicit matrix trace estimators (2013)
Silver, R.N., Röder, H.: Calculation of densities of states and spectral functions by chebyshev recursion and maximum entropy. Physical Review E 56(4), 4822 (1997)
Tsourakakis, C.E.: Fast counting of triangles in large real networks without counting: Algorithms and laws. In: Eighth IEEE International Conference on Data Mining, ICDM 2008, pp. 608–617. IEEE (2008)
Wang, L.-W.: Calculating the density of states and optical-absorption spectra of large quantum systems by the plane-wave moments method. Physical Review B 49(15), 10154 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wimmer, K., Wu, Y., Zhang, P. (2014). Optimal Query Complexity for Estimating the Trace of a Matrix. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43948-7_87
Download citation
DOI: https://doi.org/10.1007/978-3-662-43948-7_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43947-0
Online ISBN: 978-3-662-43948-7
eBook Packages: Computer ScienceComputer Science (R0)