English

Thinning a Wishart Random Matrix

Methodology 2025-12-16 v1 Machine Learning

Abstract

Recent work has explored data thinning, a generalization of sample splitting that involves decomposing a (possibly matrix-valued) random variable into independent components. In the special case of a n×pn \times p random matrix with independent and identically distributed Np(μ,Σ)N_p(\mu, \Sigma) rows, Dharamshi et al. (2024a) provides a comprehensive analysis of the settings in which thinning is or is not possible: briefly, if Σ\Sigma is unknown, then one can thin provided that n>1n>1. However, in some situations a data analyst may not have direct access to the data itself. For example, to preserve individuals' privacy, a data bank may provide only summary statistics such as the sample mean and sample covariance matrix. While the sample mean follows a Gaussian distribution, the sample covariance follows (up to scaling) a Wishart distribution, for which no thinning strategies have yet been proposed. In this note, we fill this gap: we show that it is possible to generate two independent data matrices with independent Np(μ,Σ)N_p(\mu, \Sigma) rows, based only on the sample mean and sample covariance matrix. These independent data matrices can either be used directly within a train-test paradigm, or can be used to derive independent summary statistics. Furthermore, they can be recombined to yield the original sample mean and sample covariance.

Keywords

Cite

@article{arxiv.2502.09957,
  title  = {Thinning a Wishart Random Matrix},
  author = {Ameer Dharamshi and Anna Neufeld and Lucy L. Gao and Daniela Witten and Jacob Bien},
  journal= {arXiv preprint arXiv:2502.09957},
  year   = {2025}
}
R2 v1 2026-06-28T21:44:07.422Z