arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2605.30600cs.LGcs.ITmath.IT
收藏

差分隐私的快速混合机制

The Fast Mixing Mechanism for Differential Privacy

Omri Lev, Moshe Shenfeld, Vishwak Srinivasan, Katrina Ligett, Ashia C. Wilson

AI总结:

提出基于快速变换的差分隐私草图机制,在保持隐私保证的同时匹配经典快速草图方法的运行时间,并应用于差分隐私线性回归实现首个快速方法。

摘要:

随机草图是压缩大规模优化问题同时保持准确性的核心工具。特别是基于结构化矩阵(如Hadamard矩阵)的草图可以高效应用,并且通常以更低的计算成本得到接近原始问题的解。在差分隐私(DP)中,高斯草图已被用于解决DP线性回归,始于\citet{sheffet2017differentially, sheffet2019old},随后由\citet{lev2025gaussianmix, lev2026near}改进。然而,尽管这些方法实现了强大的效用保证,它们通常不会比经典DP方法提高运行时间。在这项工作中,我们引入了一种基于快速变换的新DP草图机制,该机制在某些情况下匹配经典快速草图方法的运行时间。我们证明了该机制的最先进隐私保证,并表明在有利情况下,它们与高斯草图的隐私保证相差一个常数因子。作为一个应用,我们将该机制与最近的基于草图的DP线性回归方法相结合,得到了一种具有强效用和改进运行时间的新算法。我们为该算法建立了隐私和准确性保证,据我们所知,这是第一个用于DP普通最小二乘法的快速方法。

英文摘要:

Randomized sketching is a central tool for compressing large-scale optimization problems while preserving accuracy. In particular, sketches that are based on structured matrices, such as the Hadamard matrix, can be applied efficiently and often yield solutions that approximate those of the original problem at much lower computational cost. In differential privacy (DP), Gaussian sketching has been used to solve DP linear regression, beginning with \citet{sheffet2017differentially, sheffet2019old} and later refined by \citet{lev2025gaussianmix, lev2026near}. However, although these methods achieve strong utility guarantees, they usually do not improve runtime over classical DP approaches. In this work, we introduce a new DP sketching mechanism based on fast transforms, which, in certain cases, matches the runtime of classical fast sketching methods. We prove state-of-the-art privacy guarantees for this mechanism and show that, in favorable regimes, they match those of the Gaussian sketch up to a constant factor. As an application, we combine this mechanism with recent sketch-based methods for DP linear regression to obtain a new algorithm with strong utility and improved runtime. We establish privacy and accuracy guarantees for this algorithm, yielding, to the best of our knowledge, the first fast method for DP ordinary least squares.

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

↑