A Tight Analysis of Hutchinson's Diagonal Estimator

August 05, 2022 Β· Declared Dead Β· πŸ› SIAM Symposium on Simplicity in Algorithms

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Prathamesh Dharangutte, Christopher Musco arXiv ID 2208.03268 Category cs.DS: Data Structures & Algorithms Cross-listed math.NA Citations 13 Venue SIAM Symposium on Simplicity in Algorithms Last Checked 3 months ago
Abstract
Let $\mathbf{A}\in \mathbb{R}^{n\times n}$ be a matrix with diagonal $\text{diag}(\mathbf{A})$ and let $\bar{\mathbf{A}}$ be $\mathbf{A}$ with its diagonal set to all zeros. We show that Hutchinson's estimator run for $m$ iterations returns a diagonal estimate $\tilde{d}\in \mathbb{R}^n$ such that with probability $(1-Ξ΄)$, $$\|\tilde{d} - \text{diag}(\mathbf{A})\|_2 \leq c\sqrt{\frac{\log(2/Ξ΄)}{m}}\|\bar{\mathbf{A}}\|_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$.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted