Papers › Monomial Matrix Group Equivariant Neural Functional Networks
Monomial Matrix Group Equivariant Neural Functional Networks
Hoang V. Tran, Thieu N. Vo, Tho H. Tran, An T. Nguyen, Tan M. Nguyen
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 $\ReLU$ networks, and the weight sign flipping symmetries of sin or $\Tanh$ 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 layers. We name our new family of NFNs the Monomial Matrix Group Equivariant Neural Functional Networks (Monomial-NFN). Because of the expansion of the symmetries, Monomial-NFN has much fewer independent trainable parameters compared to the baseline NFNs in the literature, thus enhancing the model's efficiency. Moreover, for fully connected and convolutional neural networks, we theoretically prove that all groups that leave these networks invariant while acting on their weight spaces are some subgroups of the monomial matrix group. We provide empirical evidence to demonstrate the advantages of our model over existing baselines, achieving competitive performance and efficiency.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2409.11697")
Code
Syntology Ran 26 of 36 code samples harvested from 1 repository linked to this paper; 10 have no recorded run. Of those that ran: 6 ran · our draft was wrong; 20 ran with no contract checked.
By repository: official repository: 36 samples from 1 repository, 26 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
36 samples harvested; 26 ran; 0 honoured the contract we drafted; 10 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.
Licence: 0 of the 36 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.
Harvested from mathematicalai-nus/monomial-nfn. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.
Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.
Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.
8178c2d555c68f4b · report
ca1d055a4db1e6d9 · report
a878a9a8b0f2ab3e · report
40353a86c31fca90 · report
c2e173b5a7b62641 · report
48fe3dea36f9c89e · report
26be31658f5e058b · report
470213dfc5111c7e · report
1db75947d6ce1f3b · report
dddb1bf40099aca9 · report
f6a29acf17a126b8 · report
0b69c6dba62cba08 · report
ce83a7db6de57bec · report
13dc87e6610b8b4e · report
9870adcdf1003523 · report
260b648862af987e · report
5febbdfeec3c83ff · report
b6b09a11976ae372 · report
6b2124e8e2fb9a33 · report
ef49a788da8dde77 · report
c0a8a100ad21973a · report
1fd171846ef2ef36 · report
dafd3ba91930d52f · report
d127d7b6cd98eaf2 · report
baf32f15bff306f8 · report
9fb54e896d3ed074 · report
29a32995bc174d5a · report
c121ad9422f9a2f9 · report
5ba93c4071e28b32 · report
3cf245773e40b81d · report
247366d488114b00 · report
32c44311b1642ecb · report
e868a1e2f9647f67 · report
bb77e575f8866574 · report
3e3e39920e776702 · report
8433cbb2dd1ac57c · report
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections