Pith. sign in

REVIEW 1 cited by

Data Valuation for Vertical Federated Learning: A Model-free and Privacy-preserving Method

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 2112.08364 v3 pith:N3UDQ6VA submitted 2021-12-15 cs.LG cs.AI

classification cs.LGcs.AI
keywords datafederatedvaluationmethodprivacy-preservingfedvaluelearningmetric
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Vertical Federated learning (VFL) is a promising paradigm for predictive analytics, empowering an organization (i.e., task party) to enhance its predictive models through collaborations with multiple data suppliers (i.e., data parties) in a decentralized and privacy-preserving way. Despite the fast-growing interest in VFL, the lack of effective and secure tools for assessing the value of data owned by data parties hinders the application of VFL in business contexts. In response, we propose FedValue, a privacy-preserving, task-specific but model-free data valuation method for VFL, which consists of a data valuation metric and a federated computation method. Specifically, we first introduce a novel data valuation metric, namely MShapley-CMI. The metric evaluates a data party's contribution to a predictive analytics task without the need of executing a machine learning model, making it well-suited for real-world applications of VFL. Next, we develop an innovative federated computation method that calculates the MShapley-CMI value for each data party in a privacy-preserving manner. Extensive experiments conducted on six public datasets validate the efficacy of FedValue for data valuation in the context of VFL. In addition, we illustrate the practical utility of FedValue with a case study involving federated movie recommendations.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Validation-Induced Shapley Shifts: How Validation Structure Distorts Data Valuation

    cs.LG 2026-07 conditional novelty 5.0 of 10

    In-distribution validation noise directionally compresses KNN-Shapley values of training samples toward zero via neighborhood reshuffling, and a boundary-aware rescaling can partially restore baseline statistics.

Pith tools