Pith. sign in

REVIEW 1 cited by

Towards More Efficient Data Valuation in Healthcare Federated Learning using Ensembling

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 2209.05424 v1 pith:NGM7R4YW submitted 2022-09-12 cs.LG cs.AI

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

Federated Learning (FL) wherein multiple institutions collaboratively train a machine learning model without sharing data is becoming popular. Participating institutions might not contribute equally, some contribute more data, some better quality data or some more diverse data. To fairly rank the contribution of different institutions, Shapley value (SV) has emerged as the method of choice. Exact SV computation is impossibly expensive, especially when there are hundreds of contributors. Existing SV computation techniques use approximations. However, in healthcare where the number of contributing institutions are likely not of a colossal scale, computing exact SVs is still exorbitantly expensive, but not impossible. For such settings, we propose an efficient SV computation technique called SaFE (Shapley Value for Federated Learning using Ensembling). We empirically show that SaFE computes values that are close to exact SVs, and that it performs better than current SV approximations. This is particularly relevant in medical imaging setting where widespread heterogeneity across institutions is rampant and fast accurate data valuation is required to determine the contribution of each participant in multi-institutional collaborative learning.

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. Full citation record

  1. Semivalue-based data valuation is arbitrary and gameable

    cs.LG 2025-06 conditional novelty 5.0 of 10

    Semivalue-based data valuations are shown to be highly sensitive to plausible utility-function choices and are gameable under the paper's weak definition of gameability.

Pith tools