Differentially Private Dimensionality Reduction via Dual-Generator Framework

In the era of big data, the conflict between data privacy protection and sharing utilization has become increasingly prominent. This paper proposes a dimensionality reduction differential privacy method based on a dual-generator framework. By pretraining a generator on public datasets to obtain low-dimensional latent representations, and then training a private generator with differential privacy mechanisms in the low-dimensional space, the method effectively mitigates noise accumulation and mode collapse in high-dimensional scenarios. A Wasserstein GAN with gradient penalty is employed to optimize gradient clipping, enhancing the quality of generated data. Experiments on the MNIST dataset demonstrate that, compared to traditional DP-GAN, the proposed method achieves significant improvements in metrics such as Fréchet Inception Distance (FID) and classification accuracy, striking a better balance between privacy protection and data utility.

Authors

Institutions

Publication Details

Published
2025-06-20
DOI
https://doi.org/10.1109/caibda65784.2025.11182819
Primary Topic
Stochastic Gradient Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Differentially Private Dimensionality Reduction via Dual-Generator Framework

Weiyu Song
Stochastic Gradient Optimization Techniques
article

Differentially Private Dimensionality Reduction via Dual-Generator Framework

Weiyu Song
article en

Abstract

In the era of big data, the conflict between data privacy protection and sharing utilization has become increasingly prominent. This paper proposes a dimensionality reduction differential privacy method based on a dual-generator framework. By pretraining a generator on public datasets to obtain low-dimensional latent representations, and then training a private generator with differential privacy mechanisms in the low-dimensional space, the method effectively mitigates noise accumulation and mode collapse in high-dimensional scenarios. A Wasserstein GAN with gradient penalty is employed to optimize gradient clipping, enhancing the quality of generated data. Experiments on the MNIST dataset demonstrate that, compared to traditional DP-GAN, the proposed method achieves significant improvements in metrics such as Fréchet Inception Distance (FID) and classification accuracy, striking a better balance between privacy protection and data utility.

Southeast University (BD), Southeast University (CN)
Openalex Percentile: Top 85%
Stochastic Gradient Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Differentially Private Dimensionality Reduction via Dual-Generator Framework — Weiyu Song · (2025) | TGRS Research Map | TGRS