Efficient Techniques for Data Reconstruction, with Finite-Width Recovery Guarantees
Edward Tansley, Roy Makhlouf, Estelle Massart, Coralia Cartis

TL;DR
This paper introduces a unified optimization approach for data reconstruction attacks on neural networks, providing finite-width guarantees and efficient algorithms that improve reconstruction success, especially for low-dimensional data.
Contribution
It offers a novel optimization formulation with provable guarantees in the random feature model and develops an efficient subspace-aware reconstruction algorithm for neural networks.
Findings
Finite-width bounds enable high-probability data reconstruction.
Low-dimensional data subspace relaxes network width requirements.
Subspace-aware method outperforms standard techniques on CIFAR-10.
Abstract
Data reconstruction attacks on trained neural networks aim to recover the data on which the network has been trained and pose a significant threat to privacy, especially if the training dataset contains sensitive information. Here, we propose a unified optimization formulation of the data reconstruction problem based on initial and trained parameter values, incorporating state-of-the-art proposals. We show that in the random feature model, this formulation provably leads to training data reconstruction with high probability, provided the network width is sufficiently large; this unprecedented finite-width result uses PAC-style bounds. Furthermore, when the data lies in a low-dimensional subspace, we show that the network width requirement for successful reconstruction can be relaxed, with bounds depending on the subspace dimension rather than the ambient dimension. For general neural…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
