Pith. sign in

REVIEW 3 cited by

Understanding Reconstruction Attacks with the Neural Tangent Kernel and Dataset Distillation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.01428 v2 pith:OX4IAOCV submitted 2023-02-02 cs.LG cs.AIcs.NEstat.ML

classification cs.LGcs.AIcs.NEstat.ML
keywords datasetreconstructionattackempiricallyimagesneuralreconstructedwork
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Modern deep learning requires large volumes of data, which could contain sensitive or private information that cannot be leaked. Recent work has shown for homogeneous neural networks a large portion of this training data could be reconstructed with only access to the trained network parameters. While the attack was shown to work empirically, there exists little formal understanding of its effective regime which datapoints are susceptible to reconstruction. In this work, we first build a stronger version of the dataset reconstruction attack and show how it can provably recover the \emph{entire training set} in the infinite width regime. We then empirically study the characteristics of this attack on two-layer networks and reveal that its success heavily depends on deviations from the frozen infinite-width Neural Tangent Kernel limit. Next, we study the nature of easily-reconstructed images. We show that both theoretically and empirically, reconstructed images tend to "outliers" in the dataset, and that these reconstruction attacks can be used for \textit{dataset distillation}, that is, we can retrain on reconstructed images and obtain high predictive accuracy.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Querying Kernel Methods Suffices for Reconstructing their Training Data

    cs.LG 2025-05 conditional novelty 8.0 of 10

    Query-only access to kernel regression, SVM and KDE models suffices to reconstruct their exact training points, via a measure-theoretic proof and image experiments.

  2. On Reconstructing Training Data From Bayesian Posteriors and Trained Models

    stat.ML 2025-07 conditional novelty 7.0 of 10

    Attacking a Bayesian posterior with score matching is equivalent to minimizing an MMD, and the attack recovers the sufficient statistics of the training data.

  3. On the Reconstruction of Training Data from Group Invariant Networks

    cs.LG 2024-11 conditional novelty 6.0 of 10

    Reconstruction from group-invariant networks collapses toward the orbit-average input, and two modified methods (SAME-GD, deep image prior) reduce this collapse in preliminary MNIST experiments.

Pith tools