Learning Subgroup Relations Using Siamese Graph Neural Networks
Abstract
Determining whether one finite group is isomorphic to a subgroup of another is a fundamental problem in computational group theory. In this work, we propose a Siamese Graph Neural Network (Siamese GNN) for subgroup prediction using Cayley graph representations of finite groups. Each input group is represented by its undirected Cayley graph and encoded by one branch of a Siamese GNN to produce a graph embedding. The resulting graph embeddings are combined with algebraic features derived directly from the input groups to construct a joint feature vector, which is processed by a fully connected classifier to predict subgroup relations between finite groups. By integrating graph-based structural representations with algebraic features, the proposed framework provides a unified approach for learning subgroup relations from finite groups. Experimental results on an expanded and more diverse dataset of 308 finite-group pairs drawn from 11 group families demonstrate the effectiveness of the proposed architecture, achieving a test BA of 91.67% on an independent test set. Additional experiments evaluate generalization to unseen groups, robustness to different Cayley graph generating sets, the contribution of GNN message passing, performance relative to non-neural baselines, and comparison with exact computational methods. These results illustrate the potential of geometric deep learning for subgroup prediction.
Versions
Related
- Singular perturbations and hierarchical learning in two-layer neural networks
- Constraint Learning by Optimizing over Trained Neural Networks: A Pragmatic Tutorial
- Convergence of stochastic gradient descent for learning linear neural networks
- Minimax rates for learning spectral Barron functions by deep ReLU neural networks
- Learning Changes the World and Then What Was Learned has Changed: Training and Deploying Neural Networks in the Control Loop
BibTeX
@misc{weissblat2026learning,
title = {{Learning Subgroup Relations Using Siamese Graph Neural Networks}},
author = {Tal Weissblat},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2607.11140},
eprint = {2607.11140},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.11140},
}
RIS
TY - UNPB
TI - Learning Subgroup Relations Using Siamese Graph Neural Networks
AU - Tal Weissblat
PY - 2026
DA - 2026/09/05
PB - arXiv
DO - 10.48550/arxiv.2607.11140
UR - https://arxiv.org/abs/2607.11140
AB - Determining whether one finite group is isomorphic to a subgroup of another is a fundamental problem in computational group theory. In this work, we propose a Siamese Graph Neural Network (Siamese GNN) for subgroup prediction using Cayley graph representations of finite groups. Each input group is represented by its undirected Cayley graph and encoded by one branch of a Siamese GNN to produce a graph embedding. The resulting graph embeddings are combined with algebraic features derived directly from the input groups to construct a joint feature vector, which is processed by a fully connected classifier to predict subgroup relations between finite groups. By integrating graph-based structural representations with algebraic features, the proposed framework provides a unified approach for learning subgroup relations from finite groups. Experimental results on an expanded and more diverse dataset of 308 finite-group pairs drawn from 11 group families demonstrate the effectiveness of the proposed architecture, achieving a test BA of 91.67% on an independent test set. Additional experiments evaluate generalization to unseen groups, robustness to different Cayley graph generating sets, the contribution of GNN message passing, performance relative to non-neural baselines, and comparison with exact computational methods. These results illustrate the potential of geometric deep learning for subgroup prediction.
ER -