Pith. sign in

REVIEW 11 cited by

FedML: A Research Library and Benchmark for Federated Machine Learning

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2007.13518 v4 pith:N2MAPFJ2 submitted 2020-07-27 cs.LG stat.ML

Chaoyang He , Songze Li , Jinhyun So , Xiao Zeng , Mi Zhang , Hongyi Wang , Xiaoyang Wang , Praneeth Vepakomma
show 12 more authors
Abhishek Singh Hang Qiu Xinghua Zhu Jianzong Wang Li Shen Peilin Zhao Yan Kang Yang Liu Ramesh Raskar Qiang Yang Murali Annavaram Salman Avestimehr
This is my paper
classification cs.LGstat.ML
keywords fedmlresearchlearningalgorithmalgorithmicbenchmarkcommunitycomparison
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Federated learning (FL) is a rapidly growing research field in machine learning. However, existing FL libraries cannot adequately support diverse algorithmic development; inconsistent dataset and model usage make fair algorithm comparison challenging. In this work, we introduce FedML, an open research library and benchmark to facilitate FL algorithm development and fair performance comparison. FedML supports three computing paradigms: on-device training for edge devices, distributed computing, and single-machine simulation. FedML also promotes diverse algorithmic research with flexible and generic API design and comprehensive reference baseline implementations (optimizer, models, and datasets). We hope FedML could provide an efficient and reproducible means for developing and evaluating FL algorithms that would benefit the FL research community. We maintain the source code, documents, and user community at https://fedml.ai.

Discussion (0). Sign in to comment.

Forward citations

Cited by 11 Pith papers

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

  1. Clipping Makes Distributed and Federated Asynchronous SGD Robust to Stragglers

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    Gradient clipping eliminates the dependence on maximum delay in the oracle complexity of asynchronous SGD, yielding convergence in expectation and high probability under sub-Weibull gradient noise.

  2. Understanding Developer Pain Points in Federated Learning: Insights from Stack Overflow and GitHub

    cs.SE 2026-07 conditional novelty 6.0 of 10

    Federated-learning developers' biggest public pain points are environment setup, API/version breakage, non-IID training instability, and evaluation/privacy integration, with Stack Overflow skewing How and GitHub skewing Why.

  3. Robust Federated Learning Under Real-World Client Churn

    cs.LG 2026-07 conditional novelty 6.0 of 10

    FeLiX reduces wall-clock time-to-target accuracy in federated learning by up to 2.37x using lightweight availability tiers, fresh-utility client selection, and informativeness-aware aggregation without requiring oracu...

  4. Decentralised AI Training and Inference with BlockTrain

    cs.AI 2026-06 conditional novelty 6.0 of 10

    BlockTrain partitions models into block-local diffusion objectives that train near end-to-end WikiText quality with one-block worker memory, real WAN transport, and one-sweep distributed serving.

  5. Benchmarking Robust Aggregation in Decentralized Gradient Marketplaces

    cs.LG 2025-09 conditional novelty 6.0 of 10

    Adaptive Sybil backdoor attacks can defeat MartFL, FLTrust, and SkyMask in buyer-baseline gradient marketplaces with little visible effect on accuracy or cost.

  6. FraQ: Efficient Coordinate-Space Recompression for Federated Low-Rank Adaptation

    cs.AI 2026-08 conditional novelty 5.0 of 10

    FRAQ recovers the rank-truncated exact aggregate of client LoRA updates using one reduced QR and a small Gram eigenproblem, avoiding any full-weight-space SVD.

  7. Decentralised AI Training and Inference with BlockTrain

    cs.AI 2026-06 unverdicted novelty 5.0 of 10

    BlockTrain partitions models into blocks trained on local objectives, reaching CE 1.359 on WikiText within 0.04 of end-to-end baseline while enabling distributed training and inference over TCP for up to 75B-parameter models.

  8. Enhanced Privacy and Communication Efficiency in Non-IID Federated Learning with Adaptive Quantization and Differential Privacy

    cs.CV 2026-04 unverdicted novelty 5.0 of 10

    Adaptive bit-length schedulers plus Laplacian DP in non-IID FL reduce communicated data by up to 52.64% on MNIST and 45% on CIFAR-10 while keeping competitive accuracy and privacy.

  9. HadAgent: Harness-Aware Decentralized Agentic AI Serving with Proof-of-Inference Blockchain Consensus

    cs.DC 2026-04 unverdicted novelty 5.0 of 10

    HadAgent uses Proof-of-Inference consensus, a three-lane block structure, and a harness layer to enable secure decentralized LLM agent serving.

  10. Sample Selection Using Multi-Task Autoencoders in Federated Learning with Non-IID Data

    cs.CV 2026-04 unverdicted novelty 4.0 of 10

    Multi-task autoencoders with outlier detection and federated SVDD loss filter noisy samples in non-IID federated learning, yielding accuracy gains up to 7% on CIFAR-10.

  11. Understanding Communication Backends in Cross-Silo Federated Learning

    cs.DC 2026-04 unverdicted novelty 4.0 of 10

    Benchmarks of MPI, gRPC, and PyTorch RPC in cross-silo FL plus a new gRPC+S3 hybrid backend deliver up to 3.8x speedup for large-model transmission under realistic network conditions.

Pith tools