Pith. sign in

REVIEW 6 cited by

Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1711.10677 v1 pith:ULRLFNFT submitted 2017-11-29 cs.LG

classification cs.LG
keywords datalearningentityfederatedresolutionentitiesmistakesprivate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Consider two data providers, each maintaining private records of different feature sets about common entities. They aim to learn a linear model jointly in a federated setting, namely, data is local and a shared model is trained from locally computed updates. In contrast with most work on distributed learning, in this scenario (i) data is split vertically, i.e. by features, (ii) only one data provider knows the target variable and (iii) entities are not linked across the data providers. Hence, to the challenge of private learning, we add the potentially negative consequences of mistakes in entity resolution. Our contribution is twofold. First, we describe a three-party end-to-end solution in two phases ---privacy-preserving entity resolution and federated logistic regression over messages encrypted with an additively homomorphic scheme---, secure against a honest-but-curious adversary. The system allows learning without either exposing data in the clear or sharing which entities the data providers have in common. Our implementation is as accurate as a naive non-private solution that brings all data in one place, and scales to problems with millions of entities with hundreds of features. Second, we provide what is to our knowledge the first formal analysis of the impact of entity resolution's mistakes on learning, with results on how optimal classifiers, empirical losses, margins and generalisation abilities are affected. Our results bring a clear and strong support for federated learning: under reasonable assumptions on the number and magnitude of entity resolution's mistakes, it can be extremely beneficial to carry out federated learning in the setting where each peer's data provides a significant uplift to the other.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Privacy-Preserving Credit Risk Prediction with Alternative Data

    cs.LG 2026-06 unverdicted novelty 6.0 of 10

    PrivacyCredit is a machine learning method that combines traditional and alternative data for credit risk prediction while satisfying privacy-preserving, model-confidential, and lossless properties.

  2. Privacy-Preserving Screening for Record Linkage

    cs.CR 2026-05 unverdicted novelty 6.0 of 10

    Appraisal is a circuit-PSI system for privacy-preserving screening in record linkage that adds an Oblivious Attribute/Feature Alignment protocol to support approximate matching, cutting communication 14x and scaling t...

  3. Proto-EVFL: Enhanced Vertical Federated Learning via Dual Prototype with Extremely Unaligned Data

    cs.LG 2025-07 conditional novelty 5.0 of 10

    Proto-EVFL selects useful unaligned data in vertical federated learning with a dual optimal transport cost and class priors, then aggregates party features with learned gates, improving accuracy on rare and unseen classes.

  4. Federated Learning on Stochastic Neural Networks

    cs.LG 2025-06 conditional novelty 5.0 of 10

    A federated learning algorithm that trains local stochastic neural networks to capture both the true function and the noise in each client's data.

  5. DRAGD: A Federated Unlearning Data Reconstruction Attack Based on Gradient Differences

    cs.LG 2025-07 reject novelty 3.0 of 10

    DRAGD and DRAGDP reconstruct erased federated-learning images by sequentially matching post-unlearning and pre-unlearning gradients, with DRAGDP adding a public-image prior.

  6. Event-Driven Online Vertical Federated Learning

    cs.LG 2025-06

Pith tools