Sign inGet started
Paper · arXiv

Gap-free Differentially Private PCA for Gaussian Data

We give a gap-free $(ε,δ)$-differentially private algorithm for the principal component analysis (PCA) problem with Gaussian data. The algorithm is based on a private variant of the power iteration method, and it is computationally efficient.

AuthorsAlina Ene, Huy L. Nguyen
Primary categorycs.DS
Published25 September 2026
Last updated at source29 September 2026
cs.DScs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/90fda8f2-778c-4381-b814-5fe32b324ae6" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.