# Adjustable Privacy using Autoencoder-based Learning Structure

arXiv: https://arxiv.org/abs/2304.03538 · HTML: https://mlsanity.com/paper/2304.03538/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 22 of its 45 references that are in the map.
- First posted on arXiv 7 Apr 2023.

## Builds on (most cited first, 22 of 22)

- [PyTorch: An Imperative Style, High-Performance Deep Learning Library](https://mlsanity.com/paper/1912.01703/) (2019)
- [Very Deep Convolutional Networks for Large-Scale Image Recognition](https://mlsanity.com/paper/1409.1556/) (2014)
- [Deep Learning Face Attributes in the Wild](https://mlsanity.com/paper/1411.7766/) (2014)
- [Deep Learning with Differential Privacy](https://mlsanity.com/paper/1607.00133/) (2016)
- [Federated Learning with Differential Privacy: Algorithms and Performance Analysis](https://mlsanity.com/paper/1911.00222/) (2019)
- [Semi-supervised Knowledge Transfer for Deep Learning from Private Training Data](https://mlsanity.com/paper/1610.05755/) (2016)
- [NIPS 2016 Tutorial: Generative Adversarial Networks](https://mlsanity.com/paper/1701.00160/) (2016)
- [Differentially Private Learning Needs Better Features (or Much More Data)](https://mlsanity.com/paper/2011.11660/) (2020)
- [The Variational Fair Autoencoder](https://mlsanity.com/paper/1511.00830/) (2015)
- [Learning Controllable Fair Representations](https://mlsanity.com/paper/1812.04218/) (2018)
- [CryptoDL: Deep Neural Networks over Encrypted Data](https://mlsanity.com/paper/1711.05189/) (2017)
- [A Hybrid Deep Learning Architecture for Privacy-Preserving Mobile Analytics](https://mlsanity.com/paper/1703.02952/) (2017)
- [Deep Private-Feature Extraction](https://mlsanity.com/paper/1802.03151/) (2018)
- [Context-Aware Generative Adversarial Privacy](https://mlsanity.com/paper/1710.09549/) (2017)
- [TIPRDC: Task-Independent Privacy-Respecting Data Crowdsourcing Framework for Deep Learning with Anonymized Intermediate Representations](https://mlsanity.com/paper/2005.11480/) (2020)
- [Convergence Problems with Generative Adversarial Networks (GANs)](https://mlsanity.com/paper/1806.11382/) (2018)
- [Distributed Additive Encryption and Quantization for Privacy Preserving Federated Deep Learning](https://mlsanity.com/paper/2011.12623/) (2020)
- [Generating Fair Universal Representations using Adversarial Models](https://mlsanity.com/paper/1910.00411/) (2019)
- [AutoGAN-based Dimension Reduction for Privacy Preservation](https://mlsanity.com/paper/1902.10799/) (2019)
- [Uncertainty-Autoencoder-Based Privacy and Utility Preserving Data Type Conscious Transformation](https://mlsanity.com/paper/2205.01950/) (2022)
- [Distributed generation of privacy preserving data with user customization](https://mlsanity.com/paper/1904.09415/) (2019)
- [Decouple-and-Sample: Protecting sensitive information in task agnostic data release](https://mlsanity.com/paper/2203.13204/) (2022)

## Built on by (most cited first, 1 of 1)

- [Privacy Enhancement for Gaze Data Using a Noise-Infused Autoencoder](https://mlsanity.com/paper/2508.10918/) (2025)

## Abstract (arXiv)

Inference centers need more data to have a more comprehensive and beneficial learning model, and for this purpose, they need to collect data from data providers. On the other hand, data providers are cautious about delivering their datasets to inference centers in terms of privacy considerations. In this paper, by modifying the structure of the autoencoder, we present a method that manages the utility-privacy trade-off well. To be more precise, the data is first compressed using the encoder, then confidential and non-confidential features are separated and uncorrelated using the classifier. The confidential feature is appropriately combined with noise, and the non-confidential feature is enhanced, and at the end, data with the original data format is produced by the decoder. The proposed architecture also allows data providers to set the level of privacy required for confidential features. The proposed method has been examined for both image and categorical databases, and the results show a significant performance improvement compared to previous methods.
