Skip to content

Gap-free Differentially Private PCA for Gaussian Data

Sep 2026 · 0 citations · 16 references
Computer Science

Abstract

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.

View source

Similar papers

Preprint Sep 2026

A Continuous Projection Converse and a Weighted Construction for Uniquely Decodable Code Pairs

We study the maximum sum rate of uniquely decodable code pairs. A weighted refinement of a complement-gluing construction yields an explicit code of length 672 and sum rate exceeding $1.318639029203$. An iterated projection argument, combined with a conditional entropy estimate and a justified continuous limit, gives a...

Lei Yu · 0 citations
Preprint Aug 2026

An enhanced Helgason-Johnson bound for $Sp(p, q)$

Under the assumption that the irreducible unitary representation $\pi$ is infinite dimensional, this paper improves the Helgason-Johnson bound in 1969 for $Sp(p, q)$.

Zhang Ying, Chao-Ping Dong · 0 citations
Preprint Oct 2026

A Khintchine type inequality for non-independent random variables

In this short note we give a Khintchine-type inequality involving non-independentrandom variables. The basic setting is inspired by Breuer-Major theorem and the proof is based on a hypercontractivity argument.

Jing-Yu Huang, Wen-Xuan Tao · 0 citations

Related blog posts

MIT News · Artificial Intelligence Nov 17, 2026

Learning the language of machine learning

By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.