跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2610.03650 · v2

PoCoFL: A Framework for POlicy-COmpliant Federated Learning

首次提交 2026-10-03 01:33
版本更新 2026-11-18 21:52
雷达观测 2026-11-19 15:04
arXiv ↗PDF ↗

摘要

Federated Learning (FL) is a privacy-oriented learning paradigm that enables collaborative model training while keeping training data local to clients. However, FL does not guarantee that clients submit policy-compliant contributions or that aggregators process admitted contributions correctly. Update-magnitude bounds alone cannot ensure compliance with learning-specific requirements involving private data, intermediate models, or retained state. These requirements differ across FL settings, motivating a unified framework to specify and verify client and aggregation policies. This work introduces PoCoFL, a policy-compliant federated learning framework that separates three aspects: (i) FL type, (ii) policy semantics, and (iii) cryptographic realisation. We provide a formalisation that captures client and aggregation requirements as policy-dependent relations, defining update admissibility, aggregation correctness, and policy-relative privacy. These relations enable verification of selected properties of intermediate objects, such as local-model loss, continual-learning state, and personalised optimisation conditions, in each round. Clients demonstrate compliance of their contributions using compatible cryptographic mechanisms, while aggregators prove that the recorded set of admitted contributions was processed according to the selected aggregation policy. We demonstrate PoCoFL through four formal instantiations and corresponding proof-of-concept realisations: (i) vanilla, (ii) continual, (iii) personalised, and (iv) threshold-encrypted federated learning. We evaluate how policy enforcement affects the learning objectives of vanilla, personalised, and continual FL, and quantify the computational and communication overhead of policy verification across all four instantiations. These results demonstrate that PoCoFL captures complex policy representations across the evaluated FL settings.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-18 21:52 · 最新观测版本

PoCoFL: A Framework for POlicy-COmpliant Federated Learning

Federated Learning (FL) is a privacy-oriented learning paradigm that enables collaborative model training while keeping training data local to clients. However, FL does not guarantee that clients submit policy-compliant contributions or that aggregators process admitted contributions correctly. Update-magnitude bounds alone cannot ensure compliance with learning-specific requirements involving private data, intermediate models, or retained state. These requirements differ across FL settings, motivating a unified framework to specify and verify client and aggregation policies. This work introduces PoCoFL, a policy-compliant federated learning framework that separates three aspects: (i) FL type, (ii) policy semantics, and (iii) cryptographic realisation. We provide a formalisation that captures client and aggregation requirements as policy-dependent relations, defining update admissibility, aggregation correctness, and policy-relative privacy. These relations enable verification of selected properties of intermediate objects, such as local-model loss, continual-learning state, and personalised optimisation conditions, in each round. Clients demonstrate compliance of their contributions using compatible cryptographic mechanisms, while aggregators prove that the recorded set of admitted contributions was processed according to the selected aggregation policy. We demonstrate PoCoFL through four formal instantiations and corresponding proof-of-concept realisations: (i) vanilla, (ii) continual, (iii) personalised, and (iv) threshold-encrypted federated learning. We evaluate how policy enforcement affects the learning objectives of vanilla, personalised, and continual FL, and quantify the computational and communication overhead of policy verification across all four instantiations. These results demonstrate that PoCoFL captures complex policy representations across the evaluated FL settings.

查看此版本解读 →查看此版本原文 ↗