Sequencing the Neurome: Towards Scalable Exact Parameter Reconstruction of Black-Box Neural Networks
Not on the map. Why?
Abstract (arXiv)
Inferring the exact parameters of a neural network with only query access is an NP-Hard problem, with few practical existing algorithms. Solutions would have major implications for security, verification, interpretability, and understanding biological networks. The key challenges are the massive parameter space, and complex non-linear relationships between neurons. We resolve these challenges using two insights. First, we observe that almost all networks used in practice are produced by random initialization and first order optimization, an inductive bias that drastically reduces the practical parameter space. Second, we present a novel query generation algorithm that produces maximally informative samples, letting us untangle the non-linear relationships efficiently. We demonstrate reconstruction of a hidden network containing over 1.5 million parameters, and of one 7 layers deep, the largest and deepest reconstructions to date, with max parameter difference less than 0.0001, and illustrate robustness and scalability across a variety of architectures, datasets, and training procedures.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 39 of its 54 references that are in the map. First posted on arXiv 27 Sep 2024.
Builds on
39 of 54 references.
References · 39
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2018A Survey Of Methods For Explaining Black Box Modelscited by 970
- 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 713
- 2018On Lazy Training in Differentiable Programmingcited by 671
- 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
- 2017The Expressive Power of Neural Networks: A View from the Widthcited by 318
- 2018Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Datacited by 260
- 2019High Accuracy and High Fidelity Extraction of Neural Networkscited by 208
- 2020Implicit Gradient Regularizationcited by 145
- 2020Tensor Programs II: Neural Tangent Kernel for Any Architecturecited by 139
27 more
- 2022Reconstructing Training Data from Trained Neural Networkscited by 129
- 2019Data-Free Adversarial Distillationcited by 90
- 2020The Recurrent Neural Tangent Kernelcited by 67
- 2022On the Symmetries of Deep Learning Models and their Internal Representationscited by 63
- 2020Why Do Deep Residual Networks Generalize Better than Deep Feedforward Networks? -- A Neural Tangent Kernel Perspectivecited by 60
- 2017Houdini: Fooling Deep Structured Prediction Modelscited by 50
- 2022Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networkscited by 27
- 2023Simplicity Bias in 1-Hidden Layer Neural Networkscited by 26
- 2021Parameter identifiability of a deep feedforward ReLU neural networkcited by 24
- 2023The Training Process of Many Deep Networks Explores the Same Low-Dimensional Manifoldcited by 20
- 2021Noether: The More Things Change, the More Stay the Samecited by 19
- 2020Affine symmetries and neural network identifiabilitycited by 17
- 2023Polynomial Time Cryptanalytic Extraction of Neural Network Modelscited by 17
- 2019Benefits of Jointly Training Autoencoders: An Improved Neural Tangent Kernel Analysiscited by 13
- 2023Provable Guarantees for Neural Networks via Gradient Feature Learningcited by 13
- 2021An Exact Poly-Time Membership-Queries Algorithm for Extraction a three-Layer ReLU Networkcited by 11
- 2019Robust and Resource Efficient Identification of Two Hidden Layer Neural Networkscited by 10
- 2021Redundant representations help generalization in wide neural networkscited by 9
- 2021Model Extraction and Defenses on Generative Adversarial Networkscited by 8
- 2021Stable Recovery of Entangled Weights: Towards Robust Identification of Deep Neural Networks from Minimal Samplescited by 8
- 2021Efficiently Learning Any One Hidden Layer ReLU Network From Queriescited by 6
- 2019Defending Against Adversarial Examples with K-Nearest Neighborcited by 5
- 2022Finite Sample Identification of Wide Shallow Neural Networks with Biasescited by 5
- 2022Overparameterized ReLU Neural Networks Learn the Simplest Models: Neural Isometry and Exact Recoverycited by 3
- 2021Experiments with Rich Regime Training for Deep Learningcited by 2
- 2022Analyzing Tree Architectures in Ensembles via Neural Tangent Kernelcited by 2
- 2022Why Neural Networks Workcited by 1
Built on by
Not cited yet.