Skip to Main content Skip to Navigation
Journal articles

Compressive Learning with Privacy Guarantees

Abstract : This work addresses the problem of learning from large collections of data with privacy guarantees. The compressive learning framework proposes to deal with the large scale of datasets by compressing them into a single vector of generalized random moments, from which the learning task is then performed. We show that a simple perturbation of this mechanism with additive noise is sufficient to satisfy differential privacy, a well established formalism for defining and quantifying the privacy of a random mechanism. We combine this with a feature subsampling mechanism, which reduces the computational cost without damaging privacy. The framework is applied to the tasks of Gaussian modeling, k-means clustering and principal component analysis (PCA), for which sharp privacy bounds are derived. Empirically, the quality (for subsequent learning) of the compressed representation produced by our mechanism is strongly related with the induced noise level, for which we give analytical expressions.
Complete list of metadata
Contributor : Antoine Chatalic Connect in order to contact the contributor
Submitted on : Wednesday, January 20, 2021 - 10:00:31 AM
Last modification on : Monday, January 17, 2022 - 5:44:02 PM


Files produced by the author(s)



Antoine Chatalic, Vincent Schellekens, Florimond Houssiau, Yves-Alexandre de Montjoye, Laurent Jacques, et al.. Compressive Learning with Privacy Guarantees. Information and Inference, Oxford University Press (OUP), 2021, ⟨10.1093/imaiai/iaab005⟩. ⟨hal-02496896v2⟩



Les métriques sont temporairement indisponibles