Data Reconstruction: Identifiability and Optimization with Sample Splitting
Yujie Shen, Zihan Wang, Jian Qian, Qi Lei
摘要
Training data reconstruction from KKT conditions has shown striking empirical success, yet it remains unclear when the resulting KKT equations have unique solutions and, even in identifiable regimes, how to reliably recover solutions by optimization. This work hereby focuses on these two complementary questions: identifiability and optimization. On the identifiability side, we discuss the sufficient conditions for KKT system of two-layer networks with polynomial activations to uniquely determine the training data, providing a theoretical explanation of when and why reconstruction is possible. On the optimization side, we introduce sample splitting, a curvature-aware refinement step applicable to general reconstruction objectives (not limited to KKT-based formulations): it creates additional descent directions to escape poor stationary points and refine solutions. Experiments demonstrate that augmenting several existing reconstruction methods with sample splitting consistently improves reconstruction performance. Code is available at https://github.com/mukerr/data_recon .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper14
- Membership Inference Attacks Against Machine Learning ModelsReza Shokri, Marco Stronati, Congzheng Song, Vitaly ShmatikovS&P 2017 · 被引用 5,137 次
- Extracting Training Data from Large Language ModelsNicholas Carlini, Florian Tramèr, Eric Wallace, Matthew Jagielski 等USENIX Security 2021 · 被引用 2,866 次
- Inverting Gradients - How easy is it to break privacy in federated learning?Jonas Geiping, Hartmut Bauermeister, Hannah Dröge, Michael MoellerNeurIPS 2020 · 被引用 1,822 次
- What Neural Networks Memorize and Why: Discovering the Long Tail via Influence EstimationVitaly Feldman, Chiyuan ZhangNeurIPS 2020 · 被引用 674 次
- Machine Learning Models that Remember Too MuchCongzheng Song, Thomas Ristenpart, Vitaly ShmatikovCCS 2017 · 被引用 582 次
相关 Paper
- Efficient Algorithms for Learning Depth-2 Neural Networks with General ReLU ActivationsPranjal Awasthi, Alex Tang, Aravindan VijayaraghavanNeurIPS 2021 · 被引用 24 次
- Convex Relaxations of ReLU Neural Networks Approximate Global Optima in Polynomial TimeSungyoon Kim, Mert PilanciICML 2024 · 被引用 10 次
- Identifiability of Deep Polynomial Neural NetworksKonstantin Usevich, Ricardo Augusto Borsoi, Clara Dérand, Marianne ClauselNeurIPS 2025 · 被引用 21 次
- Exploring the Security Boundary of Data Reconstruction via Neuron Exclusivity AnalysisXudong Pan, Mi Zhang, Yifan Yan, Jiaming Zhu 等USENIX Security 2022
- Embedding Principle of Homogeneous Neural Network for Classification ProblemJiahan Zhang, Yaoyu Zhang, Tao LuoNeurIPS 2025
