Enhancing Gradient Inversion Attacks in Federated Learning via Hierarchical Feature Optimization

arXiv cs.CV / 4/2/2026

📰 NewsSignals & Early TrendsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper studies privacy risks in federated learning, showing that gradients transmitted by clients can be used for gradient inversion to reconstruct sensitive data using GAN-based priors.
  • It proposes GIFD (Gradient Inversion over Feature Domains), which improves upon prior approaches by optimizing across hierarchical intermediate features rather than only the GAN latent space.
  • GIFD includes a regularizer (an $l_1$-ball constraint) to reduce the generation of unrealistic images during inversion.
  • The method is extended to out-of-distribution settings, including cases with label inconsistency, where a label mapping technique is used to handle mismatches between GAN training data and FL task labels.
  • Experiments reportedly achieve pixel-level reconstruction and outperform existing baselines across multiple federated learning scenarios.

Abstract

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.