- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates the geometric properties of polynomial group convolutional neural networks (PGCNNs) for arbitrary finite groups. The authors introduce a mathematical framework based on graded group algebras and establish two related parametrizations using Hadamard and Kronecker products.
The main theoretical contributions are a characterization of the dimension of the associated neuromanifold and a proof of generic identifiability. In particular, the authors show that the neuromanifold dimension depends only on the network depth and the order of the group, while the network parameters are generically identifiable up to group actions and rescaling symmetries.
The theoretical results are supported by numerical verification using Sage and Macaulay2 for small finite groups and shallow networks. The paper extends previous results on polynomial convolutional networks and provides an algebraic-geometric framework for understanding the structure of group-equivariant neural networks.
Critical strengths
- Rigorous theoretical contributions.
The paper establishes a characterization of the neuromanifold dimension and proves generic identifiability of polynomial group convolutional neural networks for arbitrary finite groups. These results extend previous work on polynomial convolutional networks and provide a mathematical foundation for understanding the geometry of group-equivariant architectures.
- Novel algebraic framework.
The authors introduce a framework based on graded group algebras and establish a connection between Hadamard- and Kronecker-product parametrizations. This approach provides a systematic way to analyze the geometric properties of polynomial group convolutional networks and may be useful for further theoretical investigations.
Critical weaknesses
- Limited empirical validation.
Although the paper provides numerical verification of the theoretical results, the experiments are restricted to small finite groups and shallow networks. Moreover, no experiments on concrete machine learning tasks are presented. Evaluating PGCNNs on practical tasks would help demonstrate the relevance of the theoretical findings and strengthen the empirical contribution of the paper.
- Unclear implications for practical machine learning.
While the theoretical results on neuromanifold dimension and generic identifiability are mathematically interesting, their implications for learning performance, optimization, and generalization remain unclear. In particular, the paper does not establish how these geometric properties translate into practical advantages for group-equivariant neural networks. This limits the impact of the results for the broader ICLR audience.
Questions for authors
- Practical applications to machine learning tasks.
Could the authors clarify how the theoretical results on neuromanifold dimension and generic identifiability can contribute to practical machine learning tasks, such as image classification? In particular, what insights do these results provide for designing or training group-equivariant convolutional neural networks?
- Connection between theoretical results and learning performance.
The paper establishes that the neuromanifold dimension depends only on the network depth and the group size. Could the authors explain how this result relates to learning performance, optimization, or generalization? It would be helpful to understand whether the theoretical findings lead to concrete advantages over conventional convolutional neural networks.
- Experimental validation.
Could the authors provide experimental evidence on a concrete machine learning task, such as image classification, to demonstrate the practical relevance of their theoretical results? Such experiments would help assess whether the proposed geometric framework offers insights beyond the algebraic characterization of the architecture.
3 comments
Thank you very much for your explanation. However, I remain unconvinced that the contribution is sufficiently novel relative to prior work. I will therefore maintain my original score.
Thank you for the follow-up. We would appreciate a more specific explanation of the novelty concern. The original review identified a “Novel algebraic framework” as a critical strength and raised concerns about empirical validation and practical implications, which we addressed in our rebuttal. Insufficient novelty relative to prior work was not identified as a weakness in that review. Our response to reviewer DBMR, Q3, compares both our results and proof techniques with Shahverdi et al. (2025; 2026a). We establish generic identifiability for polynomial group convolutions on arbitrary finite groups. Shahverdi et al. (2025) study a different convolution architecture, while Shahverdi et al. (2026a) assume identifiability. Could you clarify which contributions you consider insufficiently novel, relative to which prior results, and which aspects of our comparison you find unconvincing?
We would also appreciate clarification of any remaining concerns underlying the soundness score of 2, following our earlier request in the first comment.
Response to reviewer JL4h
Thank you for recognizing the rigor of our results and the novelty of the algebraic framework. We welcome the opportunity to clarify their practical relevance.
1. Practical machine learning.
Finite-group equivariant networks are used in molecular property prediction, where atom permutations are relevant symmetries (Gilmer et al., 2017), and medical image analysis, where rotation and reflection equivariance reflect tissue's lack of a preferred orientation (Veeling et al., 2018). Training data are expensive in both settings, motivating architectures that may require fewer samples than symmetry-agnostic models.
We study how respecting data symmetries affects function-space geometry. Understanding this relation can inform architecture design and training. Any loss is constant along parametrization fibers (Trager et al., 2020), creating flat directions. Theorem 4.5 shows that, for general filters, the parameter ambiguities are exactly group shifts between consecutive layers and filter rescalings. The relation to generalization is addressed below.
2. Dimension, learning performance, and generalization.
Please see our reply to DBMR Q2: the dimension result connects to metric entropy, which gives an upper bound on sample complexity.
3. Experimental validation.
Our contribution concerns the mathematical foundations of machine learning, in the same line as Kileel et al. (2019), Trager et al. (2020), Shahverdi et al. (2025; 2026b), and Usevich et al. (2025). These results characterize an architecture's function space. The numerical computations in Appendix I check the theorems. An image-classification benchmark would instead measure networks' accuracy with monomial activations, a different question from the geometric statements we prove. Polynomial activations provide a model in which dimension and fibers can be determined exactly; we are not proposing a new architecture.
If any proof step was unclear, we would be glad to explain it. If the soundness score reflects a specific concern, please let us know which step it concerns so we can address it in the revision. Thank you again for your time and thoughtful questions.
Extra references
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, G. E. Dahl. Neural Message Passing for Quantum Chemistry. In Proceedings of the 34th International Conference on Machine Learning, PMLR 70:1263-1272, 2017.
B. S. Veeling, J. Linmans, J. Winkens, T. Cohen, M. Welling. Rotation Equivariant CNNs for Digital Pathology. In Medical Image Computing and Computer Assisted Intervention - MICCAI 2018, Springer, Cham, September 2018, DOI 10.1007/978-3-030-00934-2_24.