000257102 001__ 257102
000257102 005__ 20190509131801.0
000257102 0247_ $$2doi$$a10.5075/epfl-thesis-8797
000257102 037__ $$aTHESIS
000257102 041__ $$aeng
000257102 088__ $$a8797
000257102 245__ $$aPrivacy in Recommender Systems
000257102 260__ $$aLausanne$$bEPFL$$c2018
000257102 269__ $$a2018
000257102 300__ $$a125
000257102 336__ $$aTheses
000257102 502__ $$aProf. Jean-Yves Le Boudec (président) ; Prof. Rachid Guerraoui (directeur de thèse) ; Prof. Carmela Troncoso, Dr Sonia Ben Mokhtar, Prof. Kévin Huguenin (rapporteurs)
000257102 520__ $$aThe upsurge in the number of web users over the last two decades has resulted in a significant growth of online information. Recommenders are machine learning approach and are becoming one of the main ways to navigate the Internet. They recommend appropriate items to users based on their clicks, i.e., likes, ratings, purchases, etc. These clicks are key to providing relevant recommendations and, in this sense, have a significant utility. Since clicks reflect the preferences of users, they also raise privacy concerns. More generally, the rise of connected personal devices together with privacy concerns call for machine learning algorithms capable of leveraging the data of a large number of agents to learn personalized models under strong privacy requirements.

In this dissertation, we explore how to measure the above-mentioned utility and privacy effects and their inherent relation. We tackle the privacy and utility relation from two perspectives, i.e. from the users' point of view and from the service providers' point of view. First, the analytical measurements of the utility and privacy effects of a click lead to the awareness of users, hence the actionable insights for the users to superintend their behavior over the internet. Additionally, privacy-preserving machine learning algorithms enable the service providers to improve their services while preserving the privacy of their users.
In this regards, we further introduce two privacy-preserving algorithms: first, a recommendation algorithm, and the other one, a stochastic gradient descent (SGD) mechanism.

We first precisely measure the utility and privacy effects of a single click. We determine exactly when utility and privacy are antagonists and when they are not. An appealing application of our metrics is what we call a click-advisor, a visual user-aware clicking platform that helps users decide whether it is actually worth clicking on an item or not (after evaluating its potential utility and privacy effects using our techniques).
Using a game-theoretic approach, we evaluate several user clicking strategies. 
We highlight in particular what we define as a \textit{smart} strategy, leading to a Nash equilibrium, where every user reaches the maximum possible privacy while preserving the average overall recommender utility for all users (with respect to the case where the clicks of users are based solely on their genuine preferences, i.e., without consulting the click-advisor). 

\indent We then propose two privacy-preserving machine learning algorithms. 
We present D2P, a novel protocol that provides a strong form of differential privacy (distance-based differential privacy) while ensuring a good recommendation quality. D2P avoids revealing exact user profiles by creating \emph{altered} user profiles where each item is replaced with another one at some \emph{distance}. % We evaluate D2P analytically and experimentally on MovieLens and Jester datasets. We show that when compared to a recommendation protocol that does not ensure any privacy, the recommendation quality of D2P drops only by $3$\% for both datasets. 
Lastly, we introduce an efficient SGD algorithm to address the privacy concerns in a fully decentralized (peer-to-peer) and asynchronous fashion, with provable convergence rate.
000257102 592__ $$b2018
000257102 6531_ $$adifferential privacy
000257102 6531_ $$acollaborative filtering
000257102 6531_ $$arecommender
000257102 6531_ $$autility
000257102 6531_ $$aprivacy
000257102 6531_ $$atradeoff
000257102 6531_ $$adistributed machine learning
000257102 6531_ $$agradient descent
000257102 6531_ $$aSGD
000257102 6531_ $$aoptimization
000257102 700__ $$0248101$$aTaziki, Mahsa$$g233697
000257102 720_2 $$aGuerraoui, Rachid$$edir.$$g105326
000257102 8564_ $$s4621223$$uhttps://infoscience.epfl.ch/record/257102/files/EPFL_TH8797.pdf
000257102 909C0 $$pDCL
000257102 909CO $$ooai:infoscience.epfl.ch:257102$$pthesis$$pthesis-public$$pDOI$$pIC$$qGLOBAL_SET
000257102 918__ $$aIC$$cIINFCOM$$dEDIC
000257102 919__ $$aDCL
000257102 920__ $$a2018-10-05$$b2018
000257102 970__ $$a8797/THESES
000257102 973__ $$aEPFL$$sPUBLISHED
000257102 980__ $$aTHESIS