Re-Analyze Gauss: Bounds for Private Matrix Approximation via Dyson Brownian Motion

11/11/2022
by   Oren Mangoubi, et al.
0

Given a symmetric matrix M and a vector λ, we present new bounds on the Frobenius-distance utility of the Gaussian mechanism for approximating M by a matrix whose spectrum is λ, under (ε,δ)-differential privacy. Our bounds depend on both λ and the gaps in the eigenvalues of M, and hold whenever the top k+1 eigenvalues of M have sufficiently large gaps. When applied to the problems of private rank-k covariance matrix approximation and subspace recovery, our bounds yield improvements over previous bounds. Our bounds are obtained by viewing the addition of Gaussian noise as a continuous-time matrix Brownian motion. This viewpoint allows us to track the evolution of eigenvalues and eigenvectors of the matrix, which are governed by stochastic differential equations discovered by Dyson. These equations allow us to bound the utility as the square-root of a sum-of-squares of perturbations to the eigenvectors, as opposed to a sum of perturbation bounds obtained via Davis-Kahan-type theorems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2023

Private Covariance Approximation and Eigenvalue-Gap Bounds for Complex Gaussian Perturbations

We consider the problem of approximating a d × d covariance matrix M wit...
research
11/18/2015

Wishart Mechanism for Differentially Private Principal Components Analysis

We propose a new input perturbation mechanism for publishing a covarianc...
research
05/18/2019

A note on variance bounds and location of eigenvalues

We discuss some extensions and refinements of the variance bounds for bo...
research
04/18/2023

Optimal Eigenvalue Approximation via Sketching

Given a symmetric matrix A, we show from the simple sketch GAG^T, where ...
research
01/31/2022

Low-Rank Updates of Matrix Square Roots

Models in which the covariance matrix has the structure of a sparse matr...
research
07/18/2019

Bounds on Spreads of Matrices related to Fourth Central Moment. II

We derive some inequalities involving first four central moments of disc...
research
02/12/2020

List-Decodable Subspace Recovery via Sum-of-Squares

We give the first efficient algorithm for the problem of list-decodable ...

Please sign up or login with your details

Forgot password? Click here to reset