Monomial Matrix Group Equivariant Neural Functional Networks
Viet-Hoang Tran, Thieu N. Vo, Tho H. Tran, An T. Nguyen and, Tan M. Nguyen

TL;DR
This paper introduces Monomial-NFN, a new class of neural functional networks that incorporate scaling and sign-flipping symmetries via monomial matrix groups, reducing parameters and improving efficiency.
Contribution
It extends NFN symmetry considerations from permutation to monomial matrices, designing equivariant layers and proving invariance groups for neural networks.
Findings
Monomial-NFN has fewer trainable parameters than baseline NFNs.
Theoretical proof that invariance groups are subgroups of monomial matrices.
Empirical results show competitive performance and efficiency.
Abstract
Neural functional networks (NFNs) have recently gained significant attention due to their diverse applications, ranging from predicting network generalization and network editing to classifying implicit neural representation. Previous NFN designs often depend on permutation symmetries in neural networks' weights, which traditionally arise from the unordered arrangement of neurons in hidden layers. However, these designs do not take into account the weight scaling symmetries of networks, and the weight sign flipping symmetries of or networks. In this paper, we extend the study of the group action on the network weights from the group of permutation matrices to the group of monomial matrices by incorporating scaling/sign-flipping symmetries. Particularly, we encode these scaling/sign-flipping symmetries by designing our corresponding equivariant and invariant…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsNeural Networks and Applications
MethodsSoftmax · Attention Is All You Need · Neo-fuzzy-neuron
