AI & ML
PoCoFL: A Framework for POlicy-COmpliant Federated Learning
arXiv cs.CR0 views
arXiv:2610.03650v2 Announce Type: replace Abstract: 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.
Source:https://arxiv.org/abs/2610.03650PreviousHearsay: Who Can Audit the Record a Deployed Agent Harness Writes?NextAdversarial Process Disturbances at a Deployable Alarm Budget: Detector Evaluation on a Simulator and a Real Plant
Related posts
Ruby2ßhell: Pre-authentication RCE on stock Rails
0Hacker News
Generalizing self-normalized importance sampling with couplings
0arXiv stat.CO
Bayesian Computation of Copula-based Multivariate Models with an Application to Doping Detection
0arXiv stat.CO
WAIVES: Weak-form Asymptotically-unbiased Instrumental-Variable Estimation for SDEs
0arXiv stat.CO
Treat Your Honeypot Analysis Like Code: Git, Pull Requests and a Human Gate for AI [Guest Diary], (Wed, Nov 18th)
0SANS ISC
ISC Stormcast For Thursday, November 19th, 2026 https://isc.sans.edu/podcastdetail/10186, (Thu, Nov 19th)
0SANS ISC