HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Compressive k-Means with Differential Privacy

Abstract : In the compressive learning framework, one harshly compresses a whole training dataset into a single vector of generalized random moments, the sketch, from which a learning task can subsequently be performed. We prove that this loss of information can be leveraged to design a differentially private mechanism, and study empirically the privacy-utility tradeoff for the k-means clustering problem.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

Contributor : Antoine Chatalic Connect in order to contact the contributor
Submitted on : Thursday, June 13, 2019 - 9:34:59 AM
Last modification on : Friday, April 8, 2022 - 4:04:02 PM


Files produced by the author(s)


  • HAL Id : hal-02154820, version 1


Vincent Schellekens, Antoine Chatalic, Florimond Houssiau, Yves-Alexandre de Montjoye, Laurent Jacques, et al.. Compressive k-Means with Differential Privacy. SPARS 2019 - Signal Processing with Adaptive Sparse Structured Representations, Jul 2019, Toulouse, France. pp.1-2. ⟨hal-02154820⟩



Record views


Files downloads