arXiv (Cornell University) · 2016 · 59 citations · 14 references
ComputingComputer ScienceCryptographyMachine LearningPrivacy EngineeringData ProtectionDifferential PrivacyEnsemble LearningEnsemble MethodsPrivacy-preserving AnalyticsSecure Multi-party ComputationActivity RecognitionDifferentially Private Machine LearningGeneralization ErrorMajority VotingNetwork Intrusion DetectionPrivacy-preserving LearningPrivacy-preserving Machine LearningPrivate Machine Learning
Learning a classifier from private data collected by multiple parties is an important problem that has many potential applications. How can we build an accurate and differentially private global classifier by combining locally-trained classifiers from different parties, without access to any party's private data? We propose to transfer the `knowledge' of the local classifier ensemble by first creating labeled data from auxiliary unlabeled data, and then train a global $ε$-differentially private classifier. We show that majority voting is too sensitive and therefore propose a new risk weighted by class probabilities estimated from the ensemble. Relative to a non-private solution, our private solution has a generalization error bounded by $O(ε^{-2}M^{-2})$ where $M$ is the number of parties. This allows strong privacy without performance loss when $M$ is large, such as in crowdsensing applications. We demonstrate the performance of our method with realistic tasks of activity recognition, network intrusion detection, and malicious URL detection.
14
Leo Breiman · Machine Learning · 1996 · 17K citations · Full text
Protocols for secure computations
Andrew Chi-Chih Yao · Foundations of Computer Science · 1982 · 2.7K citations
Boosting the margin: a new explanation for the effectiveness of voting methods
Peter L. Bartlett, Yoav Freund, Wee Sun Lee et al. · The Annals of Statistics · 1998 · 2.3K citations · Full text
Frank McSherry · 2009 · 1.1K citations