- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper proposes Geometry-Induced Operator Families (GIOF), which aims to provide a general framework for designing geometry-aware neural-network layers for structured representation learning. The method constructs interaction operators from the fixed relationships between sites and learns how to combine them for each input. The experiments focus on synthetic operator checks and traffic-sensor reconstruction.
Critical strengths
None
Critical weaknesses
W1. The biggest issue is that the experiment in the work is very narrowed and doesn’t sufficiently support the paper’s broad claims. This work aims to provide a general framework for designing geometry-aware neural-network layers for structured representation learning, but experiment focuses (i) small-scale synthetic experiments, (ii) two traffic-reconstruction datasets. The synthetic experiments are useful sanity checks, but the real-data evaluation is kind-of weak and doesn’t provide enough evidence for the claimed broader practical applicability
W2. Another major flaw is that the work has terrible readability. The paper is extremely long (>150 pages), the main part contains many definitions, propositions and theorems, it’s hard to get an intuitive understanding of the proposed method. Several appendix proofs also spend excessive space on elementary consequences of the definitions. For example, P.3.2 proof (page 49) follows the fact that every interaction channel is zero outside the prescribed mask, yet its proof explains the multiplication and summation of these zero entries at length (very trivial results) . Theorem 6.1 re-establishes properties already supplied by Proposition C.4. I have not checked every part of the appendix, so additional issues may remain beyond those mentioned above. I suggest that the authors substantially revise and streamline the paper to increase the readability.
Questions for authors
Q1. . The motivation for this work remains kind-of abstract and unclear to me after careful reading. The main text provides very limited intuition for the proposed method, and for the appendix part, the "position of GIOF" paragraph on page 12 only describes how the framework organizes previously studied ingredients, what the new insight and capability does this work provide?
Q2. Why do METR-LA MAE baselines perform worse with 100% of the training days than with 20%? (Table 1)
3 comments
Response to the nonmonotone METR-LA data-budget comparison.
The same 1,600 optimizer updates are used for 20% and 100% training days; the two settings do not use the same number of epochs or visits per training window.
Hyperparameters are chosen on the 20%-day subset and then held fixed, and normalization statistics are fitted on the respective selected training-day sets.
Most importantly, checkpoint selection averages nine mechanism--severity validation conditions, whereas Table 1 reports only the 30% regional condition.
Therefore, the regional MAE is not constrained to be monotone as more training days are made available.
This explains why the reversal is logically possible, but it does not determine whether training exposure, normalization, objective trade-offs, or incomplete convergence is dominant.
That requires trajectory and longer-budget diagnostics.
The extended-budget results show that all six methods improve on METR-LA with 100% training days, but they do not eliminate the data-budget reversal. For example, at the 3,200-update cap, ECC obtains regional MAEs of with 20% training days and with 100% training days.
Thus, the reversal cannot be attributed solely to the original 1,600-update cap on the basis of these results. Differences in training exposure, normalization statistics, and checkpoint selection remain possible explanations, and we do not claim to have isolated a single cause.
We report the regional-outage MAE at both budgets and the selected validation checkpoint for each method. This comparison tests whether the nonmonotone data-budget behavior can be attributed to insufficient optimization, rather than assuming that additional training days must improve every individual evaluation condition.
Manuscript revision. We have clarified the comparison's fixed-update and aggregate-validation interpretation, without claiming that the current results are convergence-matched.
Dear Reviewer 1LQ4,
Thank you for your feedback. We have carefully addressed your concerns regarding motivation, experimental generality, readability, and the METR-LA results.
We would appreciate it if you could review these revisions and let us know whether your principal concerns have been addressed, or if any further clarification would be helpful.
Thank you for your consideration.
Response to the motivation and the capability added by GIOF.
The missing intuition is not simply that "geometry is useful." It is that admissible geometry and the realized propagation geometry are different objects.
Suppose a fixed sensor support admits several rate patterns, such as proximity-dominated transport and degree-adjusted transport.
A fixed-generator diffusion can propagate for a shorter or longer time, but cannot change the ratio of its infinitesimal rates along these patterns.
GIOF first compiles each geometric pattern into an admissible generator Br, then chooses
\qquad P(c)=e^{\tau(c)L(c)}$$ for the current input. The mixture changes the *shape* of admissible propagation, and $\tau(c)$ changes its *scale*. All selected operators retain structural guarantees by construction. This is a precise new modeling capability relative to a single fixed generator with learned diffusion time, not a claim that every geometry-aware architecture lacks adaptive filters. **Manuscript revision.** The Introduction now gives the shape-versus-scale motivation before the theory; the layer section connects it directly to the trainable residual realization. ### Response to whether the experiments substantiate the framework. We agree that empirical breadth and the generality of the mathematical construction should be distinguished. The descriptor-to-family map is defined for directed admissibility, barriers, and multiscale channels; this is a statement about the construction, not a claim of measured cross-domain superiority. The trained benchmark is intentionally controlled: five published spatial modules and several geometry/parameterization ablations replace the spatial component of the same network on PEMS-BAY and METR-LA. The same checkpoints are probed under three missingness mechanisms, extrapolated regional severities, outage durations, and graph-distance strata. For example, on PEMS-BAY the regional MAE decreases from $3.483$ (Static) to $3.070$ (GIOF), and the point-missingness MAE decreases from $1.307$ to $1.154$. These results test concrete consequences of adaptive structured propagation, rather than just checking algebraic definitions. To strengthen the empirical evidence for general applicability, we additionally evaluate reconstruction on a non-traffic spatial grid and examine directed and barrier-constrained geometric descriptors. These experiments complement the original traffic benchmarks by testing GIOF under different interaction structures, while preserving controlled comparisons against the corresponding static operator family. **Manuscript revision.** We explicitly state the boundary between the general mathematical construction and evidence from the controlled reconstruction setting, while moving the most informative existing ablations into the main narrative. ### Response to length, readability, and elementary proofs. The method can be stated as a three-stage pipeline: $$\text{Fixed descriptor} \longrightarrow \text{Admissible generator dictionary} \longrightarrow \text{Context-selected propagation}.$$ A long proof appendix is not itself a distinct contribution, and the reviewer identifies an unnecessarily expanded argument. In particular, Proposition 3.2 follows immediately because every off-diagonal channel entry is masked by the admissibility relation; its proof can be reduced to one line of algebra. Likewise, the projection result is a standard consequence of closed convexity and should be presented as a supporting interpretation, not a new projection theorem. These observations identify concrete opportunities to improve readability and to distinguish supporting mathematical results from the main contribution. **Manuscript revision.** We keep the geometry-to-operator pipeline in the ten-page main text, explicitly distinguish supporting lemmas from contribution-level statements, and shorten the cited support proof and redundant projection derivation in the appendix.