We present a unified quantum sensitivity sampling framework that streamlines coreset construction for many classical approximation problems, significantly speeding up clustering, regression, and low-rank approximation. We assume $n,d\geq\mathrm{poly}(k/\epsilon)$ and, for regression, $n\geq\mathrm{poly}(d)$: - $k$-medi...
Zhao Song, David P. Woodruff, Li-Cheng Zhang· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.