A Closer Look at GAN Priors: Exploiting Intermediate Features for Enhanced Model Inversion Attacks
Yixiang Qiu, Hao Fang, Hongyao Yu, Bin Chen, MeiKang Qiu, Shu-Tao Xia
TL;DR
This work investigates privacy risks from model inversion attacks and proposes IF-GMI, a novel MI method that uses intermediate features of a pre-trained StyleGAN2 generator, not just latent codes. By disassembling the generator into blocks and optimizing both latent vectors and intermediate features under an $l_1$ ball constraint, IF-GMI achieves state-of-the-art attack performance, particularly in out-of-distribution scenarios, and demonstrates strong transferability across datasets and target models. The approach combines initial selection, hierarchical feature optimization, and a robust identity loss to recover high-fidelity, diverse images that closely resemble private data. These results underscore the potent privacy leakage risk from GAN priors and motivate the development of defenses to mitigate MI threats in practical deployments.
Abstract
Model Inversion (MI) attacks aim to reconstruct privacy-sensitive training data from released models by utilizing output information, raising extensive concerns about the security of Deep Neural Networks (DNNs). Recent advances in generative adversarial networks (GANs) have contributed significantly to the improved performance of MI attacks due to their powerful ability to generate realistic images with high fidelity and appropriate semantics. However, previous MI attacks have solely disclosed private information in the latent space of GAN priors, limiting their semantic extraction and transferability across multiple target models and datasets. To address this challenge, we propose a novel method, Intermediate Features enhanced Generative Model Inversion (IF-GMI), which disassembles the GAN structure and exploits features between intermediate blocks. This allows us to extend the optimization space from latent code to intermediate features with enhanced expressive capabilities. To prevent GAN priors from generating unrealistic images, we apply a L1 ball constraint to the optimization process. Experiments on multiple benchmarks demonstrate that our method significantly outperforms previous approaches and achieves state-of-the-art results under various settings, especially in the out-of-distribution (OOD) scenario. Our code is available at: https://github.com/final-solution/IF-GMI
