Pith. sign in

REVIEW 44 cited by

LEAF: A Benchmark for Federated Settings

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 1812.01097 v3 pith:4YPAYJIS submitted 2018-12-03 cs.LG stat.ML

LEAF: A Benchmark for Federated Settings

classification cs.LG stat.ML
keywords federatedlearningdataleafareaschallengesframeworksettings
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Modern federated networks, such as those comprised of wearable devices, mobile phones, or autonomous vehicles, generate massive amounts of data each day. This wealth of data can help to learn models that can improve the user experience on each device. However, the scale and heterogeneity of federated data presents new challenges in research areas such as federated learning, meta-learning, and multi-task learning. As the machine learning community begins to tackle these challenges, we are at a critical time to ensure that developments made in these areas are grounded with realistic benchmarks. To this end, we propose LEAF, a modular benchmarking framework for learning in federated settings. LEAF includes a suite of open-source federated datasets, a rigorous evaluation framework, and a set of reference implementations, all geared towards capturing the obstacles and intricacies of practical federated environments.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 44 Pith papers

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

  1. SpecGradFilter: A Spectral Gradient Filtering Framework for Taming Federated Heterogeneity

    cs.LG 2026-07 conditional novelty 7.0

    Inter-client gradient divergence in federated learning concentrates in low-frequency components; suppressing them via spectral or spatial high-pass filtering reduces client drift and raises accuracy under non-IID data.

  2. FedXDS: Leveraging Model Attribution Methods to counteract Data Heterogeneity in Federated Learning

    cs.LG 2026-06 unverdicted novelty 7.0

    FedXDS uses propagation-based attribution to identify task-relevant features for selective data sharing in federated learning, yielding higher accuracy and faster convergence under heterogeneity with formal privacy gu...

  3. Totoro$^+$: An Adaptive and Scalable Edge Federated Learning System

    cs.DC 2026-05 unverdicted novelty 7.0

    Totoro+ is a DHT-based fully decentralized FL system with locality-aware multi-ring P2P structure, pub/sub forest, and game-theoretic path planning that claims O(log N) hops and 1.2-14x speedup for many concurrent app...

  4. Your Neighbors Know: Leveraging Local Neighborhoods for Backdoor Detection in Decentralized Learning

    cs.LG 2026-05 unverdicted novelty 7.0

    Argus enables backdoor detection in decentralized ML by collaborative neighbor-based validation of triggers, backed by convergence theory and reducing attack success by up to 90% on tested datasets.

  5. Your Neighbors Know: Leveraging Local Neighborhoods for Backdoor Detection in Decentralized Learning

    cs.LG 2026-05 unverdicted novelty 7.0

    Argus detects backdoors in decentralized learning by local trigger analysis and neighbor similarity checks on consistency, with theoretical convergence guarantees and empirical reductions in attack success up to 90 points.

  6. From Coordinate Matching to Structural Alignment: Rethinking Prototype Alignment in Heterogeneous Federated Learning

    cs.AI 2026-05 unverdicted novelty 7.0

    FedSAF shifts prototype alignment in heterogeneous federated learning from coordinate matching to inter-class structural relations and reports up to 3.52% gains over prior methods.

  7. Data-Free Contribution Estimation in Federated Learning using Gradient von Neumann Entropy

    cs.LG 2026-04 unverdicted novelty 7.0

    Matrix von Neumann entropy of final-layer gradients acts as a data-free proxy for client contribution in federated learning, showing high correlation with standalone accuracy on non-IID benchmarks.

  8. SMART: A Spectral Transfer Approach to Multi-Task Learning

    cs.LG 2026-04 unverdicted novelty 7.0

    SMART transfers knowledge in multi-task linear regression via spectral subspace similarity assumptions, achieving near-minimax Frobenius error rates while requiring only a fitted source model.

  9. SketchGuard: Scaling Byzantine-Robust Decentralized Federated Learning via Sketch-Based Screening

    cs.LG 2025-10 accept novelty 7.0

    SketchGuard decouples Byzantine filtering from aggregation in decentralized federated learning by exchanging k-dimensional Count Sketches for screening and full models only from accepted neighbors, achieving up to 50-...

  10. FeDa4Fair: Client-Level Federated Datasets for Fairness Evaluation

    cs.LG 2025-06 conditional novelty 7.0

    FeDa4Fair is a new library and benchmark for creating federated datasets with heterogeneous client-level biases to standardize evaluation of fairness methods in federated learning.

  11. FedFFT: Taming Client Drift in Federated SAM via Spectral Perturbation Filtering

    cs.LG 2026-07 conditional novelty 6.5

    Low-frequency components of client-side SAM perturbations carry most inter-client disagreement; high-pass filtering them yields more consistent federated updates and higher accuracy under non-IID data.

  12. pFedUL: Layer-Aware Federated Unlearning for Personalized Federated Learning

    cs.LG 2026-06 conditional novelty 6.5

    Layer-aware selective unlearning for personalized FL matches near-retrain forgetting while retaining ~97% personalized accuracy for remaining clients across four pFL architectures.

  13. AutoEncoder-Compressed Parallel Split Learning for Pre-trained Model Fine-Tuning

    cs.DC 2026-07 conditional novelty 6.0

    An autoencoder-based split-learning compressor with a two-stage alignment protocol achieves about 10x communication reduction during pre-trained vision-model fine-tuning with near-zero accuracy loss, outperforming heu...

  14. NFSA: Non-Forward Secure Aggregation with One Server via Two Layer Secret Sharing

    cs.CR 2026-07 conditional novelty 6.0

    NFSA combines PRF-based two-layer secret sharing with CRT packing of almost key-homomorphic PRF masks to achieve single-server, one-shot secure aggregation without server-forwarded key shares.

  15. PRoVeFL: Private Robust and Verifiable Aggregation in Federated Learning

    cs.CR 2026-07 conditional novelty 6.0

    Multi-server multi-key FHE with a shared random mask lets PRoVeFL run complex Byzantine-robust FL aggregation privately and verifiably, with large reported speedups over Prio and ELSA.

  16. Closing the Alignment-Maturity Gap in Federated Prototype Learning

    cs.LG 2026-06 unverdicted novelty 6.0

    FedSAP stabilizes federated prototype learning via a deterministic alignment curriculum and proxy separation loss, reporting up to 4 percentage point gains under high heterogeneity across three benchmarks.

  17. Silent Failures in Federated Personalization of Foundation Models

    cs.LG 2026-05 unverdicted novelty 6.0

    Federated personalization of foundation models creates hard-to-detect trustworthiness failures due to privacy constraints, and existing benchmarks cannot adequately evaluate them.

  18. Efficient Multi-objective Prompt Optimization via Pure-exploration Bandits

    cs.LG 2026-05 unverdicted novelty 6.0

    Adapting multi-objective pure-exploration bandits enables efficient Pareto prompt set recovery and best feasible prompt identification for LLMs, with linear-case guarantees and empirical gains over baselines.

  19. Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity

    cs.LG 2026-05 unverdicted novelty 6.0

    Rescaled ASGD recovers convergence to the true global objective by rescaling worker stepsizes proportional to computation times, matching the known time lower bound in the leading term under non-convex smoothness and ...

  20. FED-FSTQ: Fisher-Guided Token Quantization for Communication-Efficient Federated Fine-Tuning of LLMs on Edge Devices

    cs.LG 2026-04 unverdicted novelty 6.0

    Fed-FSTQ uses Fisher information to guide token selection and mixed-precision quantization in federated PEFT, cutting uplink traffic 46x and wall-clock time-to-accuracy by 52% on multilingual and medical QA tasks.

  21. PrivEraserVerify: Efficient, Private, and Verifiable Federated Unlearning

    cs.LG 2026-04 unverdicted novelty 6.0

    PrivEraserVerify unifies efficiency via adaptive checkpointing, privacy via layer-adaptive DP, and verifiability via fingerprints in federated unlearning, claiming 2-3x faster performance than retraining with formal g...

  22. Breaking the Capacity Bottleneck in Model-Heterogeneous Federated Learning via Gradual Model Restoration

    cs.DC 2025-12 unverdicted novelty 6.0

    FedGMR progressively restores sub-model capacity for bandwidth-constrained clients via gradual density increases and mask-aware aggregation, narrowing the gap to full-model federated learning.

  23. Benchmarking Robust Aggregation in Decentralized Gradient Marketplaces

    cs.LG 2025-09 conditional novelty 6.0

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

  24. PracMHBench: Re-evaluating Model-Heterogeneous Federated Learning Based on Practical Edge Device Constraints

    cs.LG 2025-09 conditional novelty 6.0

    PracMHBench evaluates eight model-heterogeneous federated learning algorithms under practical edge device constraints and finds that depth-level heterogeneity wins under compute/communication limits while memory limit...

  25. Incentivizing Honesty among Competitors in Collaborative Learning and Optimization

    cs.LG 2023-05 unverdicted novelty 6.0

    Formulates a game where competitors in collaborative learning are incentivized to manipulate updates, then proposes mechanisms that restore honest participation for mean estimation, convex SGD, and non-convex federate...

  26. Adaptive Federated Optimization

    cs.LG 2020-02 unverdicted novelty 6.0

    Proposes federated adaptive optimizers (FedAdagrad, FedAdam, FedYogi) with convergence analysis for non-convex objectives under data heterogeneity and reports empirical gains over FedAvg.

  27. HERO: A Heterogeneity-Aware Benchmark Library for Federated Continual Learning

    cs.LG 2026-06 conditional novelty 5.5

    HERO shows that FCL method rankings shift when client data skew and task-order mismatch are controlled separately, and that average accuracy can hide weak bottom-client performance.

  28. Exploring CKKS Parameter Trade-offs for Privacy-Preserving Personalized Federated Learning

    cs.CR 2026-06 unverdicted novelty 5.0

    pFedCKKS derives CKKS parameter constraints for PFL under 128-bit security reducing choices to inner and outer ciphertext primes and evaluates precision-cost trade-offs on FEMNIST, CelebA and Sentiment140.

  29. CRAFT: Conflict-Resolved Aggregation for Federated Training

    cs.LG 2026-05 unverdicted novelty 5.0

    CRAFT derives a closed-form solution for conflict-resolved aggregation in federated learning via geometric constraints and projection, with theoretical support for common descent and empirical gains on heterogeneous data.

  30. FedFrozen: Two-Stage Federated Optimization via Attention Kernel Freezing

    cs.LG 2026-05 unverdicted novelty 5.0

    FedFrozen improves stability in heterogeneous federated Transformer training by warming up the full model then freezing the attention kernel (query/key) while optimizing the value block under a fixed kernel.

  31. FED-FSTQ: Fisher-Guided Token Quantization for Communication-Efficient Federated Fine-Tuning of LLMs on Edge Devices

    cs.LG 2026-04 unverdicted novelty 5.0

    Fed-FSTQ uses Fisher-guided token quantization to cut uplink traffic 46-fold and improve straggler-limited time-to-accuracy by 52% versus Fed-LoRA in non-IID multilingual and medical QA tasks.

  32. FED-FSTQ: Fisher-Guided Token Quantization for Communication-Efficient Federated Fine-Tuning of LLMs on Edge Devices

    cs.LG 2026-04 unverdicted novelty 5.0

    Fed-FSTQ reduces uplink traffic by 46x and improves time-to-accuracy by 52% in federated LLM fine-tuning using Fisher-guided token quantization and selection.

  33. DFCA: Decentralized Federated Clustering Algorithm

    cs.LG 2025-10 conditional novelty 5.0

    DFCA decentralizes IFCA-style clustered federated learning: clients keep one model per cluster, train their assigned model locally, and exchange only that model with neighbors via a running average, matching centraliz...

  34. FLAegis: A Two-Layer Defense Framework for Federated Learning Against Poisoning Attacks

    cs.LG 2025-08 conditional novelty 5.0

    FLAegis defends federated learning by SAX-transforming client updates, spectral-clustering them to filter malicious clients, and applying FFT-based robust aggregation, outperforming several baselines on FEMNIST.

  35. Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classification

    cs.LG 2019-09 unverdicted novelty 5.0

    Non-identical data distributions degrade federated averaging accuracy on visual classification, but server momentum raises CIFAR-10 accuracy from 30.1% to 76.9% in the most skewed regimes.

  36. Federated Learning for Object Detection: Enabling Collaborative Drone Learning Without Centralizing Data

    cs.LG 2026-07 conditional novelty 4.0

    FedAvg on non-IID KIIT-MiTA drone imagery recovers most centralized YOLO nano mAP while keeping images local, with YOLO26 nano gaining ~53% and ~68% relative mAP over single-drone baselines.

  37. FedMTFI: Feature Importance Based Optimized Multi Teacher Knowledge Distillation in Heterogeneous Federated Learning Environment

    cs.LG 2026-06 unverdicted novelty 4.0

    FedMTFI clusters heterogeneous clients, trains cluster prototypes, and applies multi-teacher distillation with SHAP to improve accuracy over standard FL in non-IID settings.

  38. Task2vec Readiness: Diagnostics for Federated Learning from Pre-Training Embeddings

    cs.LG 2026-04 unverdicted novelty 4.0

    Task2Vec-based unsupervised metrics of client embedding cohesion, dispersion, and density correlate strongly with final federated learning performance across multiple datasets and heterogeneity levels.

  39. PrivacyBench: Privacy Isn't Free in Hybrid Privacy-Preserving Vision Systems

    cs.CR 2026-02 conditional novelty 4.0

    Combining federated learning with differential privacy causes catastrophic accuracy loss and large resource overhead in vision models, whereas federated learning with secure multi-party computation retains near-baseli...

  40. FedEve: On Bridging the Client Drift and Period Drift for Cross-device Federated Learning

    cs.LG 2025-08 reject novelty 4.0

    FedEve uses a Kalman filter to combine server momentum (prediction) with client updates (observation) to offset period drift and client drift in cross-device federated learning.

  41. PIcsC: Partitioning-Induced Covariate Shift Correction

    cs.LG 2026-07 reject novelty 3.0

    A Fisher-information regularizer is proposed to correct partition-induced covariate shift in cross-validation and federated learning, with reported gains of 3-5 points over FedAvg-class baselines.

  42. Security and Privacy in Retrieval-Augmented Generation: Architectures, Threats, Defenses, and Future Directions for Building Trustworthy Systems

    cs.CR 2026-06 unverdicted novelty 3.0

    A survey of architectures, threats, defenses, and future directions for security and privacy in RAG systems.

  43. Strategies for Improving Communication Efficiency in Distributed and Federated Learning: Compression, Local Training, and Personalization

    cs.LG 2025-09 conditional novelty 3.0

    A PhD dissertation showing unified compression theory, personalized accelerated local training, and pruning methods that reduce communication costs in federated learning and maintain accuracy in LLM pruning.

  44. A Survey on Foundation Models for Personalized Federated Intelligence

    cs.AI 2025-05 unverdicted novelty 3.0

    The survey introduces personalized federated intelligence (PFI) as a framework integrating federated learning and foundation models to support privacy-aware personalization of AI models.