cs.LGMar 31, 2026
SaveThe Geometry of Polynomial Group Convolutional Neural Networks
Organizations: Uppsala University · Chalmers University of Technology
Abstract
We study polynomial group convolutional neural networks (PGCNNs) for an arbitrary finite group . In particular, we introduce a new mathematical framework for PGCNNs using the language of graded group algebras. This framework yields two natural parameterizations of the architecture, based on Hadamard and Kronecker products, related by a linear map. We compute the dimension of the associated neuromanifold, verifying that it depends only on the number of layers and the size of the group. Furthermore, we show the general fiber of both parameterizations is trivial up to the regular group action and rescaling. Hence both parametrization maps are identifiable.
Figures & tables
Figure 1: PGCNN parametrization maps and 2 2 2 The figure is generated by Gemini Pro. .
Figure 2: A commutative diagram that describes the relation between the projectivized parametrization maps and induced by the PGCNN architecture with layers and activation degree over the finite group .
| Group | ||||||||
|---|---|---|---|---|---|---|---|---|
| Max no. of layers | 4 | 3 | 2 | 2 | 2 | 2 | 2 | 2 |
Table 1: Verification of Theorem 4.9 , using PGCNNGeometry , for PCGNN with the listed groups and maximum depth as shown in the second row; the activation degree is fixed to 2.