arXiv:2604.00955cs.CV2026-04被引 2

通过分层优化特征提升联邦学习梯度反演攻击效果

Enhancing Gradient Inversion Attacks in Federated Learning via Hierarchical Feature Optimization

  • 将GAN中间层特征作为优化目标,逐层逼近图像细节
  • 在多种联邦学习场景下实现像素级数据重建,优于现有方法
  • 适用于数据分布不一致和标签不匹配的复杂场景

联邦学习(FL)作为一种隐私保护的分布式机器学习范式,允许客户端通过上传本地计算的梯度来协同训练全局模型,而无需共享原始数据。然而,近期研究发现,交换的梯度仍存在隐私泄露风险,攻击者可利用预训练生成对抗网络(GAN)作为先验知识,通过梯度反演重构敏感数据。现有方法仅在GAN的初始隐空间中优化,表达能力与泛化性受限。为此,本文提出梯度反演特征域方法(GIFD),将GAN解构并搜索中间层的层次化特征。不同于仅优化初始隐码,GIFD逐步切换优化层,从隐空间向接近输出图像的中间层推进。同时设计正则项,在搜索范围添加小的 $l_1$ 球约束,防止生成不真实图像。还将GIFD扩展至分布外(OOD)场景,弱化了GAN训练集与联邦任务数据分布一致的假设。针对标签不一致的挑战,提出标签映射技术作为有效解决方案。大量实验表明,该方法可在多种联邦学习场景下实现像素级重建,显著优于现有基线。

原文摘要 · Abstract (English)

Federated Learning (FL) has emerged as a compelling paradigm for privacy-preserving distributed machine learning, allowing multiple clients to collaboratively train a global model by transmitting locally computed gradients to a central server without exposing their private data. Nonetheless, recent studies find that the gradients exchanged in the FL system are also vulnerable to privacy leakage, e.g., an attacker can invert shared gradients to reconstruct sensitive data by leveraging pre-trained generative adversarial networks (GAN) as prior knowledge. However, existing attacks simply perform gradient inversion in the latent space of the GAN model, which limits their expression ability and generalizability. To tackle these challenges, we propose \textbf{G}radient \textbf{I}nversion over \textbf{F}eature \textbf{D}omains (GIFD), which disassembles the GAN model and searches the hierarchical features of the intermediate layers. Instead of optimizing only over the initial latent code, we progressively change the optimized layer, from the initial latent space to intermediate layers closer to the output images. In addition, we design a regularizer to avoid unreal image generation by adding a small ${l_1}$ ball constraint to the searching range. We also extend GIFD to the out-of-distribution (OOD) setting, which weakens the assumption that the training sets of GANs and FL tasks obey the same data distribution. Furthermore, we consider the challenging OOD scenario of label inconsistency and propose a label mapping technique as an effective solution. Extensive experiments demonstrate that our method can achieve pixel-level reconstruction and outperform competitive baselines across a variety of FL scenarios.

联邦学习隐私攻击梯度反演GAN

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。