






















Matrix perturbation bounds play an essential role in the design and analysis of spectral algorithms. In this paper, we use a "contour bootstrapping" argument to derive several new perturbation bounds. As applications, we discuss new bounds on the error occurring when one uses matrix sparsification to speed up the computation of spectral parameters. Another potential application is the estimation of the trade-off in computing with privacy.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。