- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper studies historical signal compression and prediction on time-varying graphs. It proposes finite-polynomial projection with historical geometric regularization, derives a joint Gram solution and online moment recursions, and designs a TSD predictor that combines sheaf propagation, a selective state-space model, and memory feedback. The paper evaluates these designs through signal reconstruction and dynamic graph prediction experiments.
Critical strengths
1.The treatment of the finite-polynomial constraint has clear mathematical value. The paper points out that polynomial compression followed by geometric filtering at each time point may no longer satisfy the original finite-dimensional function space constraint. It provides a joint Gram solution and sufficient-statistic recursions that preserve this constraint. This result clarifies the difference between pointwise optimization and finite-dimensional joint optimization, provides a more rigorous mathematical basis for related historical compression methods, and is the paper's most convincing contribution.
2.The experiments and appendices provide valuable checks of how the mechanisms work. The paper reports prediction performance and also compares historical geometry with current geometry, exact solving with filter-then-compress, and simple architectures under a shared prediction head. These controls help distinguish the roles of the objective function, the geometric interpretation, and the prediction modules. The authors also report differences between theory and implementation, protocol limitations in some tasks, and results that do not support the expected advantages. This makes the conclusions easier to check and provides a basis for judging the limits of the method's use.
Critical weaknesses
-
The organization is confusing, making the core contributions and the limits of their supporting evidence hard to identify. The paper discusses exact historical projection, a closed-loop continuous system, and a practical neural predictor, but the three use different states, timing mechanisms, and update rules. The main text switches between them, while key limitations are scattered across the appendices. Even after reading the full paper, I still find it hard to clearly judge which problem the paper centers on, which theorems apply to the practical model, and which experiments validate the main contribution. This already affects the assessment of novelty and the weight of the contributions, rather than merely making the text harder to read.
-
A key link between the theory and the evaluated model is missing, and the need for the added mechanisms is also unsupported. The exact projection derivation applies to general time-varying positive-semidefinite operators and does not depend on the specific structure of sheaves. The practical predictor does not maintain the historical statistics required by the theory or solve the Gram system, and there is no guarantee of an approximation relationship between the two. Meanwhile, ordinary propagation or GRU controls with a shared prediction head achieve similar or higher average performance on multiple datasets, and the exact solution also shows no clear advantage in the core reconstruction experiments. Therefore, the current theory and experiments do not yet jointly support the contribution of TSD's specific design.
Questions for authors
-
Is the main new contribution of this paper the finite-polynomial projection algorithm or the TSD prediction architecture? If it is the former, what unique results does the sheaf structure add compared with general time-varying positive-semidefinite operators? If it is the latter, which theoretical result actually applies to the predictor used in the experiments?
-
Is there a verifiable mathematical relationship or a direct experiment showing that the learned states of the practical predictor approximately implement the paper's exact projection? If not, what support does the exact projection theory provide for this predictor beyond design inspiration?
-
Given that simple controls achieve similar or higher performance and the exact solution shows no clear reconstruction advantage, which evidence in the current results can identify the unique benefits of the paper's added mechanisms? This asks for an explanation of the existing evidence and the scope of its conclusions, rather than a plan for future experiments.
Part 1/2
Thank you for your continued engagement with the paper. The new controlled study, GT-DC, shows that TSD learns planted nonflat geometry, uses it for prediction, and infers it from history. Part 2 addresses reconstruction, E3, causal Wiki, and theoretical scope.
1. Learned geometry: a controlled prediction test. Each node observes a vector and predicts the average of its neighbors' vectors after hidden rotations align them. Changing hidden two-dimensional node states determine the rotations. Each node observes its own state directly at every step (H0), or noisily at 25% of node-steps (H2). All arms also receive the previous observed output.
GT-DC trains the paper's recurrent/diffusion core and two-dimensional decoder on new geometry and observation channels. It uses the original transport architecture; the planted geometry lies within its decoder class by design.
Transport is flat when carrying a vector around any cycle returns it unchanged. Its net rotation around the cycle is the holonomy; a nonzero cycle rotation measures curvature that cannot be removed by changing node frames. We cross flat/curved geometry (κ=0/1) with H0/H2.
The controls share the recurrent core, diffusion input, head, data, and fixed budget, with no per-arm tuning:
There is no recurrence-aware scoring head (REC) in this task.
Mean test MSE per output component, over five training seeds (lower is better):
Thus node frames are close to TSD when the geometry is flat, and current-only maps are close when states are directly observed. TSD outperforms both under curved geometry with sparse observations.
Does curvature improve prediction (P1)? We compare the node-frame–TSD error gap under curved versus flat geometry in H2. This difference is 0.0206 MSE (registered minimum 0.012; p=4.8×10⁻⁴). It measures the change in relative performance when curvature is introduced. With states observed, the corresponding contrast is 0.050.
Do predictions use the learned curvature (P2)? We reverse the learned cycle rotation while retaining the node-frame component. The resulting one-step error increase is 0.0708 MSE larger under curved than flat geometry (p=1.3×10⁻⁸). Replacing its maps by a fitted flat connection gives a corresponding contrast of 0.0205. These interventions test predictive use, beyond merely observing nonzero holonomy.
Is that curvature inferred from history (P3)? When none of a triangle's nodes receives a fresh state observation, learned and planted holonomy have circular correlation 0.738 (one validation-fixed global sign per trained model), versus 0.001 for current-only maps (difference 0.737; p=4.0×10⁻⁹). A Kalman filter on the same observation channel gives 0.743 on these test episodes. This is a reference, not an optimality bound: the networks also receive previous observed outputs.
Does recurrent memory help the maps (P4)? With curved geometry, we compare the current-only–TSD error gap between sparse and directly observed states. This increase is 0.0900 MSE (minimum 0.040; p=3.5×10⁻⁶). It demonstrates history use; the analogous flat-geometry contrast is 0.078, computed post hoc. P1 and P3 supply the curvature-specific evidence.
The pilot-informed protocol was registered before production training and frozen before test evaluation. All four criteria pass, with expected directions in all five seeds; no prespecified adverse rule fires. The one-sided paired t-tests reflect five training seeds on one fixed 64-episode test set.
Control scope. Node-frame potentials are confined to a half-circle. Subtracting its registered estimated cost of 0.006 leaves P1 positive at 0.0146 (p=1.8×10⁻³). Its complete nonlinear predictor also exhibits some cycle-dependent input–output behavior despite flat edge maps. We disclose both qualifications; this is evidence against these tested controls, rather than every possible flat predictor. A separate one-seed identity reference scores 0.1488 in curved H2; this comparison is descriptive. Kalman-derived maps reach TSD's accuracy range in one reference seed: learning is not the only way to implement the mechanism.