REVIEW 69 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
Signed reviews
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.
Forward citations
Showing 60 of 69 Pith papers that cite this
-
SpecGradFilter: A Spectral Gradient Filtering Framework for Taming Federated Heterogeneity
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.
-
FedFFT: Taming Client Drift in Federated SAM via Spectral Perturbation Filtering
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.
-
pFedUL: Layer-Aware Federated Unlearning for Personalized Federated Learning
Layer-aware selective unlearning for personalized FL matches near-retrain forgetting while retaining ~97% personalized accuracy for remaining clients across four pFL architectures.
-
Beyond Parameter Space: NTK-Guided Personalized Aggregation for Robust Federated Learning
LIGHTYEAR selects each client's aggregation set by scoring how similarly models behave on private validation data with a neural tangent kernel, improving robustness to heterogeneous and malfunctioning clients in peer-...
-
Capacity Confounds and Coverage Guarantees in Adaptive Sub-model Federated Learning
Update-based estimates of client data heterogeneity in sub-model federated learning are dominated by device capacity, and adaptive allocation adds nothing over a matched-budget random control once parameter coverage i...
-
AutoEncoder-Compressed Parallel Split Learning for Pre-trained Model Fine-Tuning
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...
-
NFSA: Non-Forward Secure Aggregation with One Server via Two Layer Secret Sharing
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.
-
PRoVeFL: Private Robust and Verifiable Aggregation in Federated Learning
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.
-
Benchmarking Robust Aggregation in Decentralized Gradient Marketplaces
Adaptive Sybil backdoor attacks can defeat MartFL, FLTrust, and SkyMask in buyer-baseline gradient marketplaces with little visible effect on accuracy or cost.
-
PracMHBench: Re-evaluating Model-Heterogeneous Federated Learning Based on Practical Edge Device Constraints
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...
-
Differentially Private Federated Clustering with Random Rebalancing
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.
-
Flotilla: A scalable, modular and resilient federated learning framework for heterogeneous resources
Flotilla is a modular, resilient federated learning framework that runs on heterogeneous edge devices, supports sync and async strategies, and scales to 1000+ clients with low overhead.
-
Topology-Aware Differential Privacy in Hierarchical Federated Learning
The paper derives a per-client mutual-information bound for topology-aware leakage in differentially private federated learning and a min-max noise allocation that improves the bound over uniform noise when leverage s...
-
FedAPM: Federated Learning via ADMM with Partial Model Personalization
FedAPM applies ADMM with first- and second-order proximal corrections to partial model personalization in federated learning, proving global convergence and reporting better accuracy, F1, and AUC than FedAlt, FedSim, ...
-
HALoS: Hierarchical Asynchronous Local SGD over Slow Networks for Geo-Distributed Large Language Model Training
A hierarchical asynchronous local SGD method with regional parameter servers and global model merging is claimed to train small LLMs up to 7.5x faster than DiLoCo in simulated geo-distributed settings.
-
HtFLlib: A Comprehensive Heterogeneous Federated Learning Library and Benchmark
HtFLlib is a unified benchmark and library with 12 datasets, 40 heterogeneous model architectures, and systematic accuracy, convergence, and cost evaluations of 10 HtFL methods.
-
DRAUN: An Algorithm-Agnostic Data Reconstruction Attack on Federated Unlearning Systems
DRAUN reconstructs unlearned client images from federated unlearning updates by simulating possible unlearning losses and matching gradients, exposing privacy leakage in optimization-based federated unlearning.
-
Generalized and Personalized Federated Learning with Black-Box Foundation Models via Orthogonal Transformations
A federated learning method combines client-specific orthogonal transformations on frozen black-box foundation model embeddings with a shared classifier, outperforming baselines on several domain-shift benchmarks.
-
FedDuA: Doubly Adaptive Federated Learning
FedDuA sets each round's global learning rate to the average squared client-update norm divided by the aggregated update norm under an adaptive coordinate preconditioner, a rule that is minimax-optimal under an approx...
-
FNBench: Benchmarking Robust Federated Learning against Noisy Labels
A unified benchmark of 18 federated learning methods under synthetic, human-annotation, and systematic label noise finds no consistently winning method and shows that an SVD-based decorrelation regularizer improves mo...
-
Exploit Gradient Skewness to Circumvent Byzantine Defenses for Federated Learning
A skew-aware Byzantine attack, STRIKE, exploits the tendency of honest non-IID gradients to form dense clusters away from their mean, hiding malicious gradients inside the cluster.
-
Aequa: Fair Model Rewards in Collaborative Learning via Slimmable Networks
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.
-
Decoding FL Defenses: Systemization, Pitfalls, and Remedies
Many FL defenses are evaluated on overly easy datasets and attacks, and this paper demonstrates with case studies that those easy settings can make weak defenses look strong.
-
THOR: A Generic Energy Estimation Approach for On-Device Training
A layer-wise Gaussian Process model estimates DNN training energy from measured probe networks, reducing MAPE from about 40% to about 10% versus FLOPs-based estimation.
-
Personalized Language Model Learning on Text Data Without User Identifiers
IDfree-PL samples user-specific embedding distributions on-device to personalize cloud language models without explicit user IDs, with theoretical and empirical support for accuracy gains and embedding-attribution resistance.
-
FedCFA: Alleviating Simpson's Paradox in Model Aggregation with Counterfactual Federated Learning
FedCFA replaces local latent factors with global average features to generate counterfactual samples, improving federated global model accuracy under heterogeneous data.
-
Incentivizing Truthful Collaboration in Heterogeneous Federated Learning
A norm-comparison payment rule makes truthful gradient reporting an approximately optimal strategy for clients in heterogeneous federated learning.
-
Non-IID data in Federated Learning: A Survey with Taxonomy, Metrics, Methods, Frameworks and Future Directions
A comprehensive survey that organizes non-IID data in federated learning into taxonomies of skew types, partition protocols, and metrics, with a meta-analysis of 235 selected papers.
-
HERO: A Heterogeneity-Aware Benchmark Library for Federated Continual Learning
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.
-
Targeted Label-Flipping and Oversampling Attacks on Federated Conditional GANs
Label-flipping and oversampling attacks on federated conditional GANs shift the generated target-class distribution toward the source class linearly in poisoning strength while only quadratically changing the true tar...
-
Reputation-driven Cooperation in Lattice-based Decentralized Federated Learning through Evolutionary Game Theory
In a lattice-based simulation of decentralized federated learning, a reputation mechanism that rewards cooperators and penalizes defectors raises average accuracy from 70% to 82% and drives cooperation to near 100%.
-
DFCA: Decentralized Federated Clustering Algorithm
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...
-
FLAegis: A Two-Layer Defense Framework for Federated Learning Against Poisoning Attacks
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.
-
FedBKD: Distilled Federated Learning to Embrace Gerneralization and Personalization on Non-IID Data
A data-free GAN plus bidirectional knowledge distillation between global and local models improves both personalization and generalization in non-IID federated classification.
-
Tackling Heterogeneity in Federated Learning via Variance-Reduced Boltzmann Sampling within Homogeneous Social Coalitions
A variance-reduction-based client selection with coalition clustering yields modest accuracy gains over baselines in heterogeneous federated learning, but its convergence guarantee rests on an assumption that the poli...
-
Federated Learning with Unlabeled Clients: Personalization Can Happen in Low Dimensions
FLowDUP generates personalized federated models for unlabeled clients via a hypernetwork operating in a low-dimensional random subspace, with a transductive multi-task PAC-Bayes bound motivating the objective.
-
Topology-Aware Knowledge Propagation in Decentralized Learning
Topology-aware aggregation using degree or betweenness centrality improves out-of-distribution knowledge propagation in decentralized learning across 36 simulated topologies and five datasets.
-
Chisme: Heterogeneity-Aware Gossip Learning
Chisme uses cosine similarity between model updates to weight how much a gossip-learning client trusts incoming models, improving convergence and fairness under heterogeneous data.
-
FedRS-Bench: Realistic Federated Learning Datasets and Benchmarks in Remote Sensing
A realistic 135-client federated learning benchmark for remote sensing, assembled from eight datasets, with baseline results for ten FL algorithms.
-
Lazy But Effective: Collaborative Personalized Federated Learning with Heterogeneous Data
pFedLIA clusters federated learning clients using a cheap 'lazy influence' score, and on CIFAR10/100 and FashionMNIST it matches a perfect-clustering oracle while improving on existing personalized FL baselines by up ...
-
Incentivizing Inclusive Contributions in Model Sharing Markets
iPFL combines graph-based personalized federated learning with a game-theoretic payment rule, proving non-negative utility and one-sided truthfulness, and showing higher economic utility in simulated markets.
-
TACO: Tackling Over-correction in Federated Learning with Tailored Adaptive Correction
TACO assigns client-specific correction coefficients based on gradient magnitude and direction to reduce over-correction in non-IID federated learning, improving accuracy, rounds, and wall-clock time.
-
PLayer-FL: A Principled Approach to Personalized Layer-wise Cross-Silo Federated Learning
PLayer-FL picks the layer split in partial federated learning from a low-cost sensitivity metric computed at epoch 1, and reports competitive F1, fairness, and participation incentives across seven non-IID datasets.
-
Interaction-Aware Gaussian Weighting for Clustered Federated Learning
A loss-trajectory-based clustering method for federated learning, plus a Wasserstein-adjusted cluster metric, reports improved personalization on heterogeneous data.
-
Distributed Quasi-Newton Method for Fair and Fast Federated Learning
DQN-Fed updates a global model in a direction that makes every client's loss decrease at a rate tied to its local quasi-Newton step, with claimed linear-quadratic convergence.
-
Benchmarking Federated Learning for Semantic Datasets: Federated Scene Graph Generation
A clustering-based process for creating federated learning benchmarks with controllable semantic heterogeneity, demonstrated on panoptic scene graph generation and CelebA.
-
Distributed, communication-efficient, and differentially private estimation of KL divergence
PRIEST-KLD is a family of differentially private, communication-efficient estimators of KL divergence for federated data, with three trust models; however, the unbiasedness and privacy proofs have load-bearing gaps.
-
Partial Knowledge Distillation for Alleviating the Inherent Inter-Class Discrepancy in Federated Learning
Weak classes that are intrinsically confusable persist under class-balanced federated learning; a partial knowledge distillation method that distills from class-specific experts improves their accuracy.
-
Towards Effective Device-Aware Federated Learning
Federated learning aggregation can be improved by weighting clients with label diversity and model divergence, but tuning the priority order on test accuracy overstates the benefit.
-
Federated Learning for Object Detection: Enabling Collaborative Drone Learning Without Centralizing Data
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.
-
PrivacyBench: Privacy Isn't Free in Hybrid Privacy-Preserving Vision Systems
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...
-
FedEve: On Bridging the Client Drift and Period Drift for Cross-device Federated Learning
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.
-
Adapting to Fragmented and Evolving Data: A Fisher Information Perspective
FADE adapts to sequential covariate shift by combining a Fisher-weighted KL shift signal with a smoothed Fisher information regularizer, reporting gains on vision, text, and tabular benchmarks.
-
Collaborative Inference and Learning between Edge SLMs and Cloud LLMs: A Survey of Algorithms, Execution, and Open Challenges
A survey that builds a taxonomy of edge-cloud LLM-SLM collaboration for inference and training, claiming to be the first to unify both phases.
-
Federated Split Learning with Improved Communication and Storage Efficiency
CSE-FSL combines an auxiliary network for local updates with periodic smashed-data uploads and a single server-side model, claiming convergence under non-convex loss and lower communication and storage costs.
-
Evaluating the Impact of Privacy-Preserving Federated Learning on CAN Intrusion Detection
A federated FedAvg implementation of the CANdito LSTM autoencoder IDS achieves usable detection rates on the ReCAN dataset with slightly lower performance but higher communication cost than centralized training.
-
DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information
A Bayesian-persuasion and dynamic-pricing mechanism for online federated learning under two-sided incomplete information, with a claimed 2ξ approximate optimality gap.
-
Efficient Data Valuation Approximation in Federated Learning: A Sampling-based Approach
The authors introduce IPSS, a stratified-sampling algorithm that approximates Shapley-based data value in federated learning by focusing on small, high-impact coalitions of clients.
-
Efficient Data Labeling and Optimal Device Scheduling in HWNs Using Clustered Federated Semi-Supervised Learning
A clustered federated learning framework uses specialized or ensemble models to pseudo-label unlabeled device data, with timing and scheduling heuristics that the authors say improve accuracy and cut energy use.
-
Hybrid-Regularized Magnitude Pruning for Robust Federated Learning under Covariate Shift
FEDMPR, combining magnitude pruning, dropout, and noise injection in local training, reports accuracy gains over standard federated baselines on several image benchmarks, though not consistently in all settings.
Discussion (0). Continue with ORCID to comment.