Pith. sign in

REVIEW 1 cited by

A Tight Analysis of Hutchinson's Diagonal Estimator

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.03268 v2 pith:JUA2THVH submitted 2022-08-05 cs.DS cs.NAmath.NA

classification cs.DScs.NAmath.NA
keywords mathbfdiagonaldeltadiagestimatorhutchinsonindependentmathbb
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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-\delta)$, $$\|\tilde{d} - \text{diag}(\mathbf{A})\|_2 \leq c\sqrt{\frac{\log(2/\delta)}{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$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Coreset selection for the Sinkhorn divergence and generic smooth divergences

    stat.ML 2025-04 conditional novelty 8.0 of 10

    CO2 reduces coreset selection for any smooth divergence to MMD minimization and proves that Sinkhorn divergence coresets of size m=ω(log^d n) match the error of the full empirical measure.

Pith tools