On the Internal Representations of Graph Metanetworks
Taesun Yeom, Jaeho Lee
TL;DR
This paper addresses the question of what Graph Metanetworks (GMNs) learn from neural-network parameters by studying their internal representations via Centered Kernel Alignment. It contrasts GMNs with conventional data-driven networks (MLPs and CNNs) on implicit neural representation (INR) classification tasks across MNIST, Fashion-MNIST, and CIFAR-10, revealing that GMNs develop representations that are highly sensitive to random initialization and differ from those learned by standard NNs. The authors show that cross-architecture representation similarity, as measured by CKA, is low between GMNs and general NNs despite similar accuracies, and GMNs' predictions can diverge, with some cases where GMNs correct while NN fail. The findings suggest that weight-space learning captures complementary representations to image-based learning, with implications for metanetwork design and task selection.
Abstract
Weight space learning is an emerging paradigm in the deep learning community. The primary goal of weight space learning is to extract informative features from a set of parameters using specially designed neural networks, often referred to as \emph{metanetworks}. However, it remains unclear how these metanetworks learn solely from parameters. To address this, we take the first step toward understanding \emph{representations} of metanetworks, specifically graph metanetworks (GMNs), which achieve state-of-the-art results in this field, using centered kernel alignment (CKA). Through various experiments, we reveal that GMNs and general neural networks (\textit{e.g.,} multi-layer perceptrons (MLPs) and convolutional neural networks (CNNs)) differ in terms of their representation space.
