Deep Linear Probe Generators for Weight Space Learning
Jonathan Kahana, Eliahu Horwitz, Imri Shuval, Yedid Hoshen
TL;DR
This work tackles weight-space learning by improving probing methods to predict undocumented model attributes from a network's responses to fixed inputs. The authors identify suboptimal learned probes and introduce ProbeGen, a Deep Linear Probe Generator that shares a linear generator across probes to impose inductive bias and reduce overfitting. Empirical results across INR and CNN generalization tasks, including a large ResNet18 Model Zoo, show ProbeGen achieving state-of-the-art performance with 30–1000× fewer FLOPs than graph-based approaches. The approach demonstrates strong scalability, interpretable probe representations, and applicability to black-box models, with potential extensions to other modalities and adaptive probing. Overall, ProbeGen offers a simple yet powerful mechanism to extract meaningful, efficient insights from neural network weights.
Abstract
Weight space learning aims to extract information about a neural network, such as its training dataset or generalization error. Recent approaches learn directly from model weights, but this presents many challenges as weights are high-dimensional and include permutation symmetries between neurons. An alternative approach, Probing, represents a model by passing a set of learned inputs (probes) through the model, and training a predictor on top of the corresponding outputs. Although probing is typically not used as a stand alone approach, our preliminary experiment found that a vanilla probing baseline worked surprisingly well. However, we discover that current probe learning strategies are ineffective. We therefore propose Deep Linear Probe Generators (ProbeGen), a simple and effective modification to probing approaches. ProbeGen adds a shared generator module with a deep linear architecture, providing an inductive bias towards structured probes thus reducing overfitting. While simple, ProbeGen performs significantly better than the state-of-the-art and is very efficient, requiring between 30 to 1000 times fewer FLOPs than other top approaches.
