arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1211.0975cs.DS
收藏

私有奇异向量计算中的超越最坏情况分析

Beyond Worst-Case Analysis in Private Singular Vector Computation

Moritz Hardt, Aaron Roth

摘要:

我们考虑差分私有近似奇异向量计算。已知的最坏情况下的下限表明,任何差分隐私算法的误差必须与奇异向量的维数成多项式关系。我们能够用一个称为矩阵相干性的自然参数来代替这种对维数的依赖性,该参数在理论上和经验上都经常被观察到明显小于维数。我们还证明了一个匹配的下限表明,我们的保证是几乎最佳的相干参数的每一个设置。值得注意的是,我们实现了我们的界限,给出了一个强大的分析著名的电源迭代算法,这可能是独立的利益。我们的算法还导致在最坏情况下的设置和更好的低秩近似的谱范数的改进。

英文摘要:

We consider differentially private approximate singular vector computation. Known worst-case lower bounds show that the error of any differentially private algorithm must scale polynomially with the dimension of the singular vector. We are able to replace this dependence on the dimension by a natural parameter known as the coherence of the matrix that is often observed to be significantly smaller than the dimension both theoretically and empirically. We also prove a matching lower bound showing that our guarantee is nearly optimal for every setting of the coherence parameter. Notably, we achieve our bounds by giving a robust analysis of the well-known power iteration algorithm, which may be of independent interest. Our algorithm also leads to improvements in worst-case settings and to better low-rank approximations in the spectral norm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑