Provable Privacy with Non-Private Pre-Processing

Yaxian Hu, Amartya Sanyal, Bernhard Scholkopf
2/12/2026

No confident code implementation found for this paper.

Abstract

When analysing Differentially Private (DP) machine learning pipelines, the potential privacy cost of data-dependent pre-processing is frequently overlooked in privacy accounting. In this work, we propose a general framework to evaluate the additional privacy cost incurred by non-private data-dependent pre-processing algorithms. Our framework establishes upper bounds on the overall privacy guarantees by utilising two new technical notions: a variant of DP termed Smooth DP and the bounded sensitivity of the pre-processing algorithms. In addition to the generic framework, we provide explicit overall privacy guarantees for multiple data-dependent pre-processing algorithms, such as data imputation, quantization, deduplication and PCA, when used in combination with several DP algorithms. Notably, this framework is also simple to implement, allowing direct integration into existing DP pipelines.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{hu2026provable,
  title  = {Provable Privacy with Non-Private Pre-Processing},
  author = {Yaxian Hu and Amartya Sanyal and Bernhard Scholkopf},
  year   = {2026},
  eprint = {2403.13041},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2403.13041},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.13041.svg)](https://codeofpaper.com/paper/2403.13041)

Discussion