- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper motivates ChronoSheaf by arguing that existing sheaf neural networks operate exclusively in the spatial domain and therefore cannot capture temporal dependencies through their sheaf Laplacians. It combines spatial and temporal relationships into a single sheaf Laplacian using restriction maps. It then applies a Chebyshev polynomial filter to capture information across multiple spatial hops and time steps. The authors claim this approach reduces oversmoothing and preserves node representations.
Critical strengths
Attempted to design a filtering operation to solve existing sheaf neural networks, which operate exclusively in the spatial domain and therefore cannot capture temporal dependencies through their sheaf Laplacians.
Critical weaknesses
1.The construction of the joint Laplacian in Equation (8) lacks sufficient mathematical and methodological justification. In particular, and cannot individually be considered valid symmetric positive-semidefinite Laplacians, as each contains only one direction of the temporal coupling.
-
Simply adding spatial and temporal operators does not guarantee that the resulting spectral representation is optimal or even beneficial for the forecasting task. The authors provide neither a theoretical justification nor sufficient controlled experiments demonstrating why this construction is preferable to separately learned spatial and temporal operators or existing joint spatio-temporal filtering methods.
-
The proposed dual spectral filter has a serious limitation. Recent papers, including HMH (ICML 2026) and Sign is Not a Remedy (ICML 2024), have discussed limitations of graph message passing, particularly frequency mixing and oversmoothing because of polynomial approximation. However, the authors simply add the spatial and temporal Laplacians and apply a single polynomial filter. Mathematically, when the operators share eigenvectors, the filter becomes , meaning different spatial and temporal frequencies can receive the same response. This may mix important frequency information rather than preserve it. The authors neither discuss this limitation nor provide sufficient theoretical or experimental justification for their filtering design.
-
The oversmoothing analysis in Section 4.1 is not convincing. The authors measure ordinary Dirichlet energy, although their proposed model operates in a learned sheaf space. A nontrivial sheaf can have zero sheaf energy while maintaining different node representations. Therefore, preserving ordinary Dirichlet energy does not establish that the model avoids oversmoothing in the sheaf sense.
-
The proposed transitional restriction has been described as dynamically learned temporal relationships. But, Equation (4) only rescales a fixed node-specific matrix using a scalar gate. Therefore, the underlying transformation cannot change its orientation or row space across time. The same frame is also shared across neighboring edges, preventing edge-specific temporal transformations.
-
The readability of the paper is poor, and the methodology is unnecessarily difficult to follow. The authors spend too much space presenting mathematical proofs instead of clearly explaining the proposed architecture, its intuition, and the motivation behind each component. Most of these proofs should be moved to the appendix. The main paper should focus on explaining how the method works, why each component is needed, and what it actually contributes to the learning task. The current presentation makes it difficult to understand and evaluate the main contributions.
-
The authors use channel-dependent polynomial coefficients, but the learned sheaf Laplacian contains non-diagonal feature transformations. These operations generally do not commute, meaning the resulting filter is not necessarily diagonal in the Laplacian eigenbasis and may mix different spectral components. The authors should explain how this formulation preserves or controls spectral information and why it is preferable to conventional spectral filtering.
Questions for authors
The authors use channel-dependent polynomial coefficients, but the learned sheaf Laplacian contains non-diagonal feature transformations. These operations generally do not commute, meaning the resulting filter is not necessarily diagonal in the Laplacian eigenbasis and may mix different spectral components. Can you explain how this formulation preserves or controls spectral information and why it is preferable to conventional spectral filtering?