通过归一化层签名检测恶意更新,提升联邦大模型安全性
FedLNS: Leverage LayerNorm Signature Modeling to Mitigate Adversarial Manipulation in Federated LLMs

- 用归一化层参数变化作为客户端更新的签名特征
- 在40%恶意数据下仍显著降低困惑度,优于6种基线方法
- 无需额外通信或标注数据,适合隐私敏感场景
联邦训练使语言模型能从分布式私有文本中学习,但服务器无法直接验证客户端本地训练过程。恶意客户端可利用污染目标进行训练,引入错误上下文-标记关联,通过重复聚合损害全局模型,增加生成不可靠或幻觉内容的风险。本文提出联邦学习归一化签名机制(FedLNS),一种轻量级的服务器端恶意更新筛查框架。该方法通过分析客户端返回模型中可训练归一化层参数的变化,构建更新签名,并与跨客户端的历史参考进行对比,实现异常检测。由于签名在服务器端提取,无需额外客户端-服务器参数或元数据交换,与标准联邦学习无通信开销差异。筛选后保留的完整模型更新可使用标准聚合规则处理。实验表明,在200个客户端、从头训练的GPT、BERT和LLaMA风格模型上,面对40%群体级目标操纵,无论在独立同分布(IID)还是非独立同分布(non-IID)数据划分下,FedLNS均在所有三种架构上取得比六种基线方法更低的测试困惑度。
原文摘要 · Abstract (English)
Federated training enables language models to learn from distributed private text, but the server cannot directly verify the local supervision or optimization process that produces each client update. A malicious client can therefore train on corrupted targets, introduce incorrect context-token associations, and degrade the global model through repeated aggregation. Such degradation can also increase the risk of unreliable or hallucinatory generation. We propose Federated Learning with Normalization Signatures (FedLNS), a server-side framework for lightweight malicious-update screening. FedLNS represents each client update through changes in trainable normalization-layer parameters and screens suspicious updates against a robust, history-aware cross-client reference. Because the signatures are extracted at the server from the returned local models, FedLNS requires no additional client-to-server parameter or metadata exchange compared to standard federated learning (FL) methods. After screening, the retained full-model updates can be aggregated using standard FL or another compatible aggregation rule. FedLNS requires no raw client data, trusted server dataset, labeled attack examples, or separately trained detector. Experiments on GPT-style, BERT-style, and LLaMA-style models trained from scratch with 200 clients show that, under 40% population-level target manipulation, FedLNS achieves lower test perplexity than the strongest of six baselines for all three architectures under both IID (independently and identically distributed) and non-IID data partitions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。