mlsanityData to 7 Oct 2026

Learning Privately from Multiparty Data

arXiv 1602.03552 ↗First posted 10 Feb 2016cs.LG cs.CRcited by 16

Not on the map. Why?

Abstract (arXiv)

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(ε-2M-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.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Feb 2016.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 3; 2023: 4; 2024: 4; 2025: 0; 2026: 1.

16 papers.

Sort:

By area: