{"title":"Hutchinson对角估计量的严密分析","authors":"Prathamesh Dharangutte, C. Musco","doi":"10.48550/arXiv.2208.03268","DOIUrl":null,"url":null,"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$.","PeriodicalId":93491,"journal":{"name":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","volume":"226 1","pages":"353-364"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Tight Analysis of Hutchinson's Diagonal Estimator\",\"authors\":\"Prathamesh Dharangutte, C. Musco\",\"doi\":\"10.48550/arXiv.2208.03268\",\"DOIUrl\":null,\"url\":null,\"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$.\",\"PeriodicalId\":93491,\"journal\":{\"name\":\"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)\",\"volume\":\"226 1\",\"pages\":\"353-364\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2208.03268\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the SIAM Symposium on Simplicity in Algorithms (SOSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2208.03268","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Tight Analysis of Hutchinson's Diagonal Estimator
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$.