Metraipolis › archive › dc_7ff9840e9d74

Gap-free Differentially Private PCA for Gaussian Data — arXiv:2609.31614

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.31614
License (as archived)
CC0-1.0
Archived
2026-10-08T02:19:25.671Z
SHA-256 of the archived text
939260c360dd0c17845a277be1d3b4a80c18a9d6bd1b277b00aaed10249e2084
Stable URL of this page
https://metraipolis.com/documento/dc_7ff9840e9d74

How to cite

Gap-free Differentially Private PCA for Gaussian Data — arXiv:2609.31614 — arXiv (en), https://arxiv.org/abs/2609.31614 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7ff9840e9d74 (Metraipolis archive dc_7ff9840e9d74, sha256 939260c360dd0c17845a277be1d3b4a80c18a9d6bd1b277b00aaed10249e2084)
BibTeX
@misc{dc7ff9840e9d74,
  title = {Gap-free Differentially Private PCA for Gaussian Data — arXiv:2609.31614},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31614},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7ff9840e9d74; sha256 939260c360dd0c17845a277be1d3b4a80c18a9d6bd1b277b00aaed10249e2084},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31614. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We give a gap-free $(\epsilon,\delta)$-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.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-28 in cs.LG).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.31614 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T01:43:06.829Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).