Differentially Private Matrix Factorization using Sketching Techniques
Authors:
Open Access
- 20 June 2016
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 57-62
Abstract
Collaborative filtering is a popular technique for recommendation system due to its domain independence and reliance on user behavior data alone. But the possibility of identification of users based on these personal data raise privacy concerns. Differential privacy aims to minimize these identification risks by adding controlled noise with known characteristics. The addition of noise impacts the utility of the system and does not add any other value to the system other than enhanced privacy. We propose using sketching techniques to implicitly provide the differential privacy guarantees by taking advantage of the inherent randomness of the data structure. In particular, we use count sketch as a storage model for matrix factorization, one of the successful collaborative filtering techniques. Our model is also compact and scales well with data, making it well suitable for large scale applications.Keywords
Funding Information
- Alcatel Lucent Bell labs France
This publication has 20 references indexed in Scilit:
- Fast Differentially Private Matrix Factorization2015
- Sketching as a Tool for Numerical Linear AlgebraFoundations and Trends® in Theoretical Computer Science, 2014
- On differentially private low rank approximation2013
- What Can We Learn Privately?SIAM Journal on Computing, 2011
- Smooth sensitivity and sampling in private data analysis2007
- Privacy via pseudorandom sketches2006
- Differential Privacy2006
- An improved data stream summary: the count-min sketch and its applicationsJournal of Algorithms, 2005
- Finding Frequent Items in Data Streams2002
- Training with Noise is Equivalent to Tikhonov RegularizationNeural Computation, 1995