The paper proposes extending the FAIR principles with an observability layer—FAIR-O—to enhance trust in federated learning. It argues that merely keeping data local is insufficient for trustworthiness, and introduces a framework where each participant generates signed, minimal trust evidence for every FL round, while raw data and logs stay local. A prototype demonstrates evidence generation and a three‑level trust model, and the authors outline how this evidence could inform participant selection and aggregation in future work.
arXiv:2609.15521v1 Announce Type: new Abstract: Federated learning enables multiple parties to train a shared model without centralizing raw data with the help of an aggregator, but introduces integr...
The paper introduces Governance-Aware Federated Learning (GAFL), a framework that enhances traditional federated learning with independent governance verification, fairness and explainability assessment, anomaly detection, policy enforcement, and tamper‑evident audit logging. In a cross‑silo prototype with 10 participants, GAFL successfully identified all falsified‑evidence participants and intervened on affected participants across various threat scenarios, achieving macro‑F1 scores between 0.7520 and 0.7733. The added governance processing time per round was 173.67 ± 26.94 ms, compared to 3.82 ± 0.79 ms for standard FedAvg, highlighting a trade‑off between fairness policy enforcement and utility.
arXiv:2606. 00947v1 Announce Type: cross Abstract: Foundation models are increasingly personalized on decentralized private data through federated learning and are now deployed at scale under growing regulatory requirements for post-market monitoring.
arXiv:2409. 15723v3 Announce Type: replace Abstract: Large Language Models have achieved impressive performance across diverse applications, yet their training typically depends on centralized data collection, raising serious privacy and governance concerns.
arXiv:2608. 02250v1 Announce Type: new Abstract: Federated learning (FL) is a popular distributed learning framework where multiple clients perform local training and a server aggregates the locally updated models.
arXiv:2608. 01095v1 Announce Type: new Abstract: Federated learning (FL) enables multiple intelligent devices to collaboratively train a high-accuracy model without sharing raw data.
PoCoFL is a federated learning framework that separates the type of FL, policy semantics, and cryptographic realization to ensure policy compliance. It formalizes client and aggregation requirements as policy-dependent relations, allowing clients to prove compliance with commitments and zero-knowledge proofs, and aggregators to prove correct processing of admitted contributions. The paper demonstrates PoCoFL through four instantiations—vanilla, continual, personalized, and threshold-encrypted FL—showing its versatility and practical feasibility across different learning objectives.
arXiv:2607. 06612v1 Announce Type: cross Abstract: Federated Learning (FL) enables multiple clients to collaboratively train machine learning models while retaining data locality, thereby enhancing user privacy.
arXiv:2505. 23593v4 Announce Type: replace Abstract: Post-training of foundation language models has emerged as a promising research domain in federated learning (FL) with the goal to enable privacy-preserving model improvements and adaptations to user's downstream tasks.
CALM introduces a smooth trust gating mechanism for decentralized federated learning, replacing hard filtering of teacher models with class‑wise, sample‑wise, and label‑based weighting. It allows clients with heterogeneous architectures to distill knowledge from peers without a central server or shared data, even under severe non‑IID label skew. Experiments on CIFAR‑10, SVHN, OrganAMNIST, and Google Speech Commands show that CALM consistently outperforms uniform and hard‑filtered distillation and matches or exceeds other heterogeneous‑FL methods.
arXiv:2606. 27622v1 Announce Type: new Abstract: Byzantine-robust federated learning seeks to protect distributed model training from malicious or corrupted clients without requiring access to their private data.
The paper introduces a latent information sharing scheme for federated learning that mitigates client drift by sharing a small amount of hidden‑layer activations. The authors demonstrate both theoretically and empirically that this approach improves training efficiency while maintaining convergence guarantees and data privacy. Compared to existing methods such as FedProx, SCAFFOLD, FedPVR, FedProto, and SplitFed, the proposed method achieves higher model accuracy within a fixed round budget without adding significant communication overhead.