Querying Kernel Methods Suffices for Reconstructing their Training Data
Not on the map. Why?
Abstract (arXiv)
Over-parameterized models have raised concerns about their potential to memorize training data, even when achieving strong generalization. The privacy implications of such memorization are generally unclear, particularly in scenarios where only model outputs are accessible. We study this question in the context of kernel methods, and demonstrate both empirically and theoretically that querying kernel models at various points suffices to reconstruct their training data, even without access to model parameters. Our results hold for a range of kernel methods, including kernel regression, support vector machines, and kernel density estimation. Our hope is that this work can illuminate potential privacy concerns for such models.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 36 of its 55 references that are in the map. First posted on arXiv 25 May 2025.
Builds on
36 of 55 references.
References · 36
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2024Scaling Rectified Flow Transformers for High-Resolution Image Synthesiscited by 4,094
- 2014Deep Learning Face Attributes in the Wildcited by 3,679
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2020Extracting Training Data from Large Language Modelscited by 2,144
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
- 2022Quantifying Memorization Across Neural Language Modelscited by 755
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
- 2023Extracting Training Data from Diffusion Modelscited by 723
- 2018On Lazy Training in Differentiable Programmingcited by 671
24 more
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
- 2022Diffusion Art or Digital Forgery? Investigating Data Replication in Diffusion Modelscited by 418
- 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
- 2019On the Inductive Bias of Neural Tangent Kernelscited by 177
- 2020Directional convergence and alignment in deep learningcited by 172
- 2020Benign overfitting in ridge regressioncited by 152
- 2020Frequency Bias in Neural Networks for Input of Non-Uniform Densitycited by 140
- 2022Reconstructing Training Data from Trained Neural Networkscited by 129
- 2021Generalization error of random features and kernel methods: hypercontractivity and kernel matrix concentrationcited by 110
- 2020When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning?cited by 102
- 2019Harnessing the Power of Infinitely Wide Deep Nets on Small-data Taskscited by 87
- 2020Deep Equals Shallow for ReLU Networks in Kernel Regimescited by 83
- 2021Tensor Programs IIb: Architectural Universality of Neural Tangent Kernel Training Dynamicscited by 57
- 2023Generalization in Kernel Regression Under Realistic Assumptionscited by 26
- 2023Deconstructing Data Reconstruction: Multiclass, Weight Decay and General Lossescited by 24
- 2022Precise Learning Curves and Higher-Order Scaling Limits for Dot Product Kernel Regressioncited by 22
- 2023Understanding Reconstruction Attacks with the Neural Tangent Kernel and Dataset Distillationcited by 14
- 2022A Kernel Perspective of Skip Connections in Convolutional Networkscited by 12
- 2024The Positivity of the Neural Tangent Kernelcited by 12
- 2024Reconstructing Training Data From Real World Models Trained with Transfer Learningcited by 10
- 2024Provable Privacy Attacks on Trained Shallow Neural Networkscited by 4
Built on by
Not cited yet.