PBM-VFL: Vertical Federated Learning with Feature and Sample Privacy

Linh Tran, Timothy Castiglia, Stacy Patterson, Ana Milanova
1/23/2025
cs.LG

No confident code implementation found for this paper.

Abstract

We present Poisson Binomial Mechanism Vertical Federated Learning (PBM-VFL), a communication-efficient Vertical Federated Learning algorithm with Differential Privacy guarantees. PBM-VFL combines Secure Multi-Party Computation with the recently introduced Poisson Binomial Mechanism to protect parties' private datasets during model training. We define the novel concept of feature privacy and analyze end-to-end feature and sample privacy of our algorithm. We compare sample privacy loss in VFL with privacy loss in HFL. We also provide the first theoretical characterization of the relationship between privacy budget, convergence error, and communication cost in differentially-private VFL. Finally, we empirically show that our model performs well with high levels of privacy.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{tran2025pbmvfl,
  title  = {PBM-VFL: Vertical Federated Learning with Feature and Sample Privacy},
  author = {Linh Tran and Timothy Castiglia and Stacy Patterson and Ana Milanova},
  year   = {2025},
  eprint = {2501.13916},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.13916v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.13916.svg)](https://codeofpaper.com/paper/2501.13916)

Discussion