A Tight Analysis of Hutchinson's Diagonal Estimator

08/05/2022
∙
by   Prathamesh Dharangutte, et al.
∙
0
∙

Let 𝐀∈ℝ^n× n be a matrix with diagonal diag(𝐀) and let 𝐀Ė… be 𝐀 with its diagonal set to all zeros. We show that Hutchinson's estimator run for m iterations returns a diagonal estimate dĖƒâˆˆâ„^n such that with probability (1-Îī), dĖƒ - diag(𝐀)_2 â‰Ī c√(log(2/Îī)/m)𝐀Ė…_F, where c is a fixed constant independent of all other parameters. This results improves on a recent result of [Baston and Nakatsukasa, 2022] by a log(n) factor, yielding a bound that is independent of the matrix dimension n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
∙ 07/30/2019

Block-diagonal covariance estimation and application to the Shapley effects in sensitivity analysis

In this paper, we aim to estimate block-diagonal covariance matrices for...
research
∙ 09/26/2014

Order-invariant prior specification in Bayesian factor analysis

In (exploratory) factor analysis, the loading matrix is identified only ...
research
∙ 01/26/2022

Stochastic diagonal estimation: probabilistic bounds and an improved algorithm

We study the problem of estimating the diagonal of an implicitly given m...
research
∙ 09/27/2022

An O(3.82^k) Time FPT Algorithm for Convex Flip Distance

Let P be a convex polygon in the plane, and let T be a triangulation of ...
research
∙ 04/12/2019

The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Ritz Values

We study the Lanczos algorithm where the initial vector is sampled unifo...
research
∙ 01/01/2023

A gallery of diagonal stability conditions with structured matrices (and review papers)

This note presents a summary and review of various conditions and charac...
research
∙ 10/28/2019

Limiting behavior of largest entry of random tensor constructed by high-dimensional data

Let X_k=(x_k1, ..., x_kp)', k=1,...,n, be a random sample of size n comi...

Please sign up or login with your details

Forgot password? Click here to reset