Pith. sign in

REVIEW 2 cited by

Motley: Benchmarking Heterogeneity and Personalization in 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 2206.09262 v6 pith:U6KYBAPM submitted 2022-06-18 cs.LG cs.DC

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

Personalized federated learning considers learning models unique to each client in a heterogeneous network. The resulting client-specific models have been purported to improve metrics such as accuracy, fairness, and robustness in federated networks. However, despite a plethora of work in this area, it remains unclear: (1) which personalization techniques are most effective in various settings, and (2) how important personalization truly is for realistic federated applications. To better answer these questions, we propose Motley, a benchmark for personalized federated learning. Motley consists of a suite of cross-device and cross-silo federated datasets from varied problem domains, as well as thorough evaluation metrics for better understanding the possible impacts of personalization. We establish baselines on the benchmark by comparing a number of representative personalized federated learning methods. These initial results highlight strengths and weaknesses of existing approaches, and raise several open questions for the community. Motley aims to provide a reproducible means with which to advance developments in personalized and heterogeneity-aware federated learning, as well as the related areas of transfer learning, meta-learning, and multi-task learning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. An Efficient Evolutionary Algorithm for Few-for-Many Optimization

    cs.NE 2026-01 conditional novelty 6.0 of 10

    SoM-EMOA, a (μ+1) evolution strategy that directly minimizes the sum-of-minimum coverage objective, outperforms existing many-objective solvers on a new R2-based benchmark suite for few-for-many optimization.

  2. Differentially Private Federated Clustering with Random Rebalancing

    cs.LG 2025-08 reject novelty 6.0 of 10

    RR-Cluster enforces a minimum cluster size by random rebalancing, lowering DP noise and improving federated clustering utility, but its privacy proof understates the true noise.

Pith tools