Expand-and-Cluster: Parameter Recovery of Neural Networks
Not on the map. Why?
Abstract (arXiv)
Can we identify the weights of a neural network by probing its input-output mapping? At first glance, this problem seems to have many solutions because of permutation, overparameterisation and activation function symmetries. Yet, we show that the incoming weight vector of each neuron is identifiable up to sign or scaling, depending on the activation function. Our novel method 'Expand-and-Cluster' can identify layer sizes and weights of a target network for all commonly used activation functions. Expand-and-Cluster consists of two phases: (i) to relax the non-convex optimisation problem, we train multiple overparameterised student networks to best imitate the target function; (ii) to reverse engineer the target network's weights, we employ an ad-hoc clustering procedure that reveals the learnt weight vectors shared between students -- these correspond to the target weight vectors. We demonstrate successful weights and size recovery of trained shallow and deep networks with less than 10% overhead in the layer size and describe an `ease-of-identifiability' axis by analysing 150 synthetic problems of variable difficulty.
Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Apr 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 5; 2025: 7; 2026: 3.
15 papers.
Sort:
- 2025Symmetry in Neural Network Parameter Spacescited by 31
- 2025Identifiability of Deep Polynomial Neural Networkscited by 12
- 2024Polynomial Time Cryptanalytic Extraction of Deep Neural Networks in the Hard-Label Settingcited by 8
- 2024Learning Gaussian Multi-Index Models with Gradient Flow: Time Complexity and Directional Convergencecited by 8
- 2024Beyond Slow Signs in High-fidelity Model Extractioncited by 7
- 2024When Are Bias-Free ReLU Networks Effectively Linear Networks?cited by 3
- 2025Flat Channels to Infinity in Neural Loss Landscapescited by 3
- 2025Navigating the Deep: End-to-End Extraction on Deep Neural Networkscited by 3
- 2025Make Haste Slowly: A Theory of Emergent Structured Mixed Selectivity in Feature Learning ReLU Networkscited by 2
- 2025Is the Hard-Label Cryptanalytic Model Extraction Really Polynomial?cited by 2
- 2024Measuring and Controlling Solution Degeneracy across Task-Trained Recurrent Neural Networkscited by 0
- 2025Data Augmentation Techniques to Reverse-Engineer Neural Network Weights from Input-Output Queriescited by 0
- 2026End-to-End Hard-Label Cryptanalytic Model Extraction Using Efficient Sign Recovery18 Sep 2026
- 2026Teacher Geometry Shapes Learnability in Teacher-Student Networks9 Sep 2026
- 2026The Role of Symmetry in Optimizing Overparameterized Networks28 Apr 2026
- 2025Data Augmentation Techniques to Reverse-Engineer Neural Network Weights from Input-Output Queries25 Nov 2025
- 2025Is the Hard-Label Cryptanalytic Model Extraction Really Polynomial?8 Oct 2025
- 2025Identifiability of Deep Polynomial Neural Networks20 Jun 2025
- 2025Navigating the Deep: End-to-End Extraction on Deep Neural Networks20 Jun 2025
- 2025Flat Channels to Infinity in Neural Loss Landscapes17 Jun 2025
- 2025Symmetry in Neural Network Parameter Spaces16 Jun 2025
- 2025Make Haste Slowly: A Theory of Emergent Structured Mixed Selectivity in Feature Learning ReLU Networks8 Mar 2025
- 2024Learning Gaussian Multi-Index Models with Gradient Flow: Time Complexity and Directional Convergence13 Nov 2024
- 2024Polynomial Time Cryptanalytic Extraction of Deep Neural Networks in the Hard-Label Setting8 Oct 2024
- 2025Symmetry in Neural Network Parameter Spacescited by 31
- 2025Identifiability of Deep Polynomial Neural Networkscited by 12
- 2024Polynomial Time Cryptanalytic Extraction of Deep Neural Networks in the Hard-Label Settingcited by 8
- 2024Learning Gaussian Multi-Index Models with Gradient Flow: Time Complexity and Directional Convergencecited by 8
- 2024Beyond Slow Signs in High-fidelity Model Extractioncited by 7
- 2024When Are Bias-Free ReLU Networks Effectively Linear Networks?cited by 3
- 2025Flat Channels to Infinity in Neural Loss Landscapescited by 3
- 2025Navigating the Deep: End-to-End Extraction on Deep Neural Networkscited by 3
- 2025Make Haste Slowly: A Theory of Emergent Structured Mixed Selectivity in Feature Learning ReLU Networkscited by 2
- 2025Is the Hard-Label Cryptanalytic Model Extraction Really Polynomial?cited by 2
- 2024Measuring and Controlling Solution Degeneracy across Task-Trained Recurrent Neural Networkscited by 0
- 2025Data Augmentation Techniques to Reverse-Engineer Neural Network Weights from Input-Output Queriescited by 0
12 most cited of 15 All 15 (JSON)
- 2026End-to-End Hard-Label Cryptanalytic Model Extraction Using Efficient Sign Recovery18 Sep 2026
- 2026Teacher Geometry Shapes Learnability in Teacher-Student Networks9 Sep 2026
- 2026The Role of Symmetry in Optimizing Overparameterized Networks28 Apr 2026
- 2025Data Augmentation Techniques to Reverse-Engineer Neural Network Weights from Input-Output Queries25 Nov 2025
- 2025Is the Hard-Label Cryptanalytic Model Extraction Really Polynomial?8 Oct 2025
- 2025Identifiability of Deep Polynomial Neural Networks20 Jun 2025
- 2025Navigating the Deep: End-to-End Extraction on Deep Neural Networks20 Jun 2025
- 2025Flat Channels to Infinity in Neural Loss Landscapes17 Jun 2025
- 2025Symmetry in Neural Network Parameter Spaces16 Jun 2025
- 2025Make Haste Slowly: A Theory of Emergent Structured Mixed Selectivity in Feature Learning ReLU Networks8 Mar 2025
- 2024Learning Gaussian Multi-Index Models with Gradient Flow: Time Complexity and Directional Convergence13 Nov 2024
- 2024Polynomial Time Cryptanalytic Extraction of Deep Neural Networks in the Hard-Label Setting8 Oct 2024
12 newest of 15 All 15 (JSON)