REVIEW 2 cited by
Privacy Preserving Vertical Federated Learning for Tree-based Models
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
abstract
Federated learning (FL) is an emerging paradigm that enables multiple organizations to jointly train a model without revealing their private data to each other. This paper studies {\it vertical} federated learning, which tackles the scenarios where (i) collaborating organizations own data of the same set of users but with disjoint features, and (ii) only one organization holds the labels. We propose Pivot, a novel solution for privacy preserving vertical decision tree training and prediction, ensuring that no intermediate information is disclosed other than those the clients have agreed to release (i.e., the final tree model and the prediction output). Pivot does not rely on any trusted third party and provides protection against a semi-honest adversary that may compromise $m-1$ out of $m$ clients. We further identify two privacy leakages when the trained decision tree model is released in plaintext and propose an enhanced protocol to mitigate them. The proposed solution can also be extended to tree ensemble models, e.g., random forest (RF) and gradient boosting decision tree (GBDT) by treating single decision trees as building blocks. Theoretical and experimental analysis suggest that Pivot is efficient for the privacy achieved.
Forward citations
Cited by 2 Pith papers
-
Federated Granger Causality Learning for Interdependent Clients with State Space Representation
A federated linear state-space framework learns cross-client Granger causality from shared low-dimensional states, with convergence and differential-privacy guarantees.
-
Vertical Federated Unlearning via Backdoor Certification
A gradient-ascent unlearning algorithm verified by backdoor accuracy is proposed for federated models, but the experimental setup and the unenforced constraint weaken the central VFL claim.
Discussion (0). Continue with ORCID to comment.