Pith. sign in

REVIEW 1 cited by

Hierarchically Fair Federated Learning

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 2004.10386 v2 pith:G3WXTLIO submitted 2020-04-22 cs.LG cs.AIcs.CYstat.ML

classification cs.LGcs.AIcs.CYstat.ML
keywords federatedlearningagentscompetitivedatasetsfairframeworkhffl
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

When the federated learning is adopted among competitive agents with siloed datasets, agents are self-interested and participate only if they are fairly rewarded. To encourage the application of federated learning, this paper employs a management strategy, i.e., more contributions should lead to more rewards. We propose a novel hierarchically fair federated learning (HFFL) framework. Under this framework, agents are rewarded in proportion to their pre-negotiated contribution levels. HFFL+ extends this to incorporate heterogeneous models. Theoretical analysis and empirical evaluation on several datasets confirm the efficacy of our frameworks in upholding fairness and thus facilitating federated learning in the competitive settings.

Discussion (0). Continue with ORCID 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. Aequa: Fair Model Rewards in Collaborative Learning via Slimmable Networks

    cs.LG 2025-02 conditional novelty 6.0 of 10

    Aequa allocates model widths (and thus accuracies) to federated learning participants in proportion to their estimated contributions, using slimmable networks and a simulated annealing optimizer.

Pith tools