- Rating
- 4
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper studies whether the improvements achieved by sheaf neural networks (SNNs) can be attributed to their use of matrix-valued transport.
The experiments highlighted that the proportion of performance improvement attributed to matrix-valued transport is dependant on datasets, model depths, operator implementations, and attribution orders.
Their final claim is that what matrix-valued transport contributes should state the operator, depth and order of credit under which they were measured.
Critical strengths
I think that this paper is genuily well written and has substantially more strength than weaknesses.
Strength 1: Theoritical foundation and motivation are solid and the contribution to SNN is meaningful.
Strength 2: Experiments are exhaustive.
Critical weaknesses
The weaknesses I found are not critical for the paper in my opinion but I still have to state some that came to my mind while reading the paper:
Weakness 1: I think that the expressivity of the whole network could be an interesting study/
Weakness 2: not really a weakness but I think the authors should rename the discussion section as Conclusion. The reason for this is that when the paper is accepted a lot of people look for these words to read quickly through papers and I feel like Conclusion is more commonly accepted as the end of the main section than discussion. It is a personal test on my end so it is up to the authors.
Questions for authors
I don't have much questions for the authors other than out of curiosity for the SNN that I discovered with this paper:
Q1: What are the potential application field for Sheaf Neural Networks? Q2: Following from Thm 1, can the algebraic structure predict which architecture will perform the best? Q3: As the algebra generated by the restriction maps characterizes the structural capabilities of a layer. Have you considered tracking the algebra generated by the learned restriction maps throughout training? I am wondering if the algebra can change during training.
Congratulation to the author for their paper and good luck with the rebuttal phase.
2 comments
Thank you for the answers to my minor weaknesses and questions!
I wish you the best for the end of the discussion period.
Response to Reviewer orKP
Thank you for the careful and encouraging review. Your questions helped us state more clearly what the theory covers and what it leaves open.
W1 (expressivity of the whole network). You are right, and we thank you for raising it. Theorem 1 and Proposition 3 are statements about one propagation operator, and the Limitations (Section 7) say that they concern the operator, not the network. Two of our empirical results bear on the composed network without settling it. First, the fitted dense maps generate all of M_4(R) in every layer and every seed (Appendix F, "Which algebra the fitted maps generate"), so the trained network does realize the irreducible algebra; it simply gains little from it (the dense rung never carries more than 9% of the audited gain). Second, depth changes the allocation of credit in opposite directions on the two tasks (Section 5.1), a network-level effect the operator-level theory does not predict. What a stack of such layers can express with the nonlinearity and the normalization in place is open, and following your comment the revised Limitations now say so.
W2 (Discussion vs. Conclusion). Agreed, thank you: the section is now titled "Conclusion" and opens with the list of what to report.
Q1 (application fields). The settings where sheaf networks have been used are, as far as we know, those where the relation between two nodes is not well described by a single weight: node classification on heterophilous graphs, where neighbours should be transformed rather than averaged (Bodnar et al., 2022; Barbero et al., 2022); opinion dynamics and consensus on structured relations (Hansen & Ghrist, 2021); knowledge graphs with typed relations (Gebhart et al., 2021); recommendation on user–item graphs (Purificato et al., 2025); and hypergraph learning, including the directed sheaf hypergraph model we audit in Section 5.5 (Duta et al., 2023; Mule et al., 2026). Our result bears on all of them in one way: when a sheaf model is reported to help in such a setting, the share of the gain that is due to matrix-valued transport, rather than to edge weighting, gating or a freer spectral response, has to be measured under a stated operator, depth and order of credit, or it is not a property of the setting.
Q2 (can the algebra predict which architecture performs best?). Not as a ranking. Theorem 1 fixes the block structure of the propagation operator: which stalk coordinates are coupled, over which division algebra, and which blocks act irreducibly. That tells you when two nominally different families compute the same functions (scalar maps are edge weights; one-angle rotations are a magnetic Laplacian), and hence which added "capability" cannot add anything because it is already present. It does not fix the realizable family inside a given algebra (Section 3 gives restricted families that generate the same algebra), and it says nothing about optimization or the task. So the algebra is a necessary-condition tool: it rules claims out, it does not pick winners. The data agree that the ordering is not monotone in the algebra: on Minesweeper most of the sheaf-exclusive gain is commutative (a phase suffices), on Roman-empire it is non-commutative, and the irreducible rung is never the main contributor on any task we ran (Section 5.1, "Split by generated algebra").
Q3 (tracking the generated algebra during training). This is a valuable suggestion. We measured it at the end of training only. Appendix F reports the fraction of Frobenius energy in the nested subalgebras RI ⊂ C ⊂ H and C ⊂ M_2(R)^2 ⊂ M_4(R), and the numerical dimension of the algebra the maps generate: full 16-dimensional algebra in every layer and seed, with 67–84% of the energy inside C. So the end state is "full algebra, used sparingly". One thing is known by construction: the dense rung is warm-started at its parent, the rotated-diagonal rung, whose maps lie in the proper subalgebra M_2(R)^2 (two independent 2x2 blocks, dimension 8), and the fitted dense maps generate all of M_4(R); so the algebra does change during the dense stage. What we have not measured is when: whether the generated dimension rises gradually or jumps, and whether the energy leaves C before or after the validation score stops improving. The probe runs on any checkpoint, so it is a matter of saving checkpoints during the dense stage; we have not run this, and the revised Limitations now name it as an open question.
Finally, Reviewer s64g asked whether the matrix-versus-scalar gap could be extra training rather than capacity. We ran the control they proposed, and the gap survives in every cell. The full table and a third-dataset result are in the general response; three cells now have forty seeds instead of the ten we first reported here. Nothing in it changes the per-layer theory you assessed.
Thank you again for your time and your constructive questions; we would be glad to clarify anything further.