- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper proposes a method for predicting future states of a physical system from sparse heterogenous observations.Various techinces are used such as Gram-Whitening, message passing, and active learning; however, it is very difficult to understand how these come together to make the proposed method, primarily because the writing is overly complicated and made unnecessarily technical and jargon-laden. This makes the main contribution highly obscure.
Critical strengths
The overall problem the paper is trying to assess, prediction of future states of physical systems from sparse heterogeneous observations, is a good problem to try and tackle.
Critical weaknesses
The paper is very poorly written with very confusing and non-standard terminology. This makes it very difficult to understand the high-level approach of the paper. On this basis alone I believe this paper should be rejected.
Questions for authors
None. I strongly advise a complete re-write and keeping the reader in mind and emphasizing clear language.
2 comments
5. The experiments are organized around clear research questions
The evaluation now proceeds through five questions: accuracy under the sensor-only contract, mechanisms behind the improvement, computational cost, mesh generalization, and uncertainty and observation robustness. Baseline adaptations are described in a dedicated Appendix D.3, and complete five-seed results are provided in Appendix E.
The revised evidence includes several additions that make the contribution easier to assess:
- A learned shared-basis control isolates the effect of sensor-dependent basis generation.
- Cross-resolution and unseen-geometry tests evaluate generalization directly.
- Parameter counts, training cost, memory, inference speed, and whitening cost are reported.
- Go1Leg-Real provides 4,500 independent conditions with physical robot sensor inputs.
For example, the key basis control in Table 4 is now straightforward to interpret:
| Basis representation | Basis varies by sample | ElasticBeam-Syn NMSE | Go1Leg-Real NMSE |
|---|---|---|---|
| Fixed POD | No | 0.0612 ± 0.0034 | 0.3027 ± 0.0126 |
| Learned shared graph basis | No | 0.0435 ± 0.0038 | 0.2989 ± 0.0082 |
| SONAR conditioned basis | Yes | 0.0249 ± 0.0009 | 0.1673 ± 0.0053 |
The control retains the same generator, coefficient head, rank, whitening, residual branch, and training protocol, but removes observation input to the basis generator. The result therefore tests the central mechanism directly rather than relying on architectural description alone.
On Go1Leg-Real, SONAR achieves NMSE 0.1673, RelL2 0.3129, and VM-MaxRE 9.8, compared with the strongest baseline results of 0.2019, 0.3458, and 14.2, respectively. The relative reductions are 17.1%, 9.5%, and 31.0%. The revised paper also reports where effects are small or statistically inconclusive instead of making uniformly strong claims.
We again apologize for the initial presentation and thank the reviewer for prompting a fundamental improvement of the manuscript. We hope that the revised paper now makes the problem, method, contribution, and evidence accessible and coherent. We would be grateful if you could read the revised version and reconsider its presentation, informativeness, and soundness, including your overall evaluation, in light of these extensive changes.
Thank you for the direct and candid assessment. We sincerely apologize that the initial manuscript was overly dense, used unnecessarily technical terminology, and made it difficult to understand how the components formed a coherent method. This prevented the core contribution and the empirical evidence from being clear. Your criticism is well taken.
We have undertaken a complete rewrite with the reader as the primary consideration. We respectfully ask you to evaluate the revised manuscript as a substantially rewritten presentation of the work rather than as a collection of local textual edits.
Response to the request for a complete rewrite and clearer language
1. The problem and contribution are now stated before technical details
The revised introduction first explains the input contract: the model receives a short history of heterogeneous system-level observations and a mesh, but no current or past target field. It then contrasts three representations in plain terms:
This leads directly to the central contribution: state-conditioned basis generation that separates per-sample spatial subspace construction from coefficient prediction. The abstract, introduction, related work, and conclusion now use the same consistent description.
2. The method section now follows the computation in a reader-oriented order
Section 3 is reorganized into a task definition, the core idea, basis generation, coefficient prediction, localized residual correction, training, and a short theoretical interpretation. The central computation is introduced in one equation before the architectural details:
\hat{Y}_{\mathrm{glob}}=\Phi_{\theta}(G;z_s)a_{\psi}(z_s,z_G),\qquad \hat{Y}=\hat{Y}_{\mathrm{glob}}+\hat{Y}_{\mathrm{res}}.$$ The respective roles are now explicit. The recurrent encoder summarizes observation history. The mesh network generates basis fields for the current state. The coefficient head determines how strongly each basis field is expressed. Whitening normalizes the basis by construction. The residual branch corrects localized structure outside the global low-rank approximation. ### 3. Non-standard and potentially confusing terminology is explicitly defined The revised manuscript states that adaptive spectral rotation means a change in learned basis directions across observation states. It does not refer to eigenvectors precomputed from a fixed mesh operator. It also states that the active node set is a subset of mesh nodes used for localized computation and is unrelated to active learning. These clarifications directly address the terminology that made the initial version difficult to interpret. ### 4. Complex derivations no longer interrupt the main narrative The detailed assumptions, propositions, and proofs are consolidated in Appendix A. The main paper retains only a concise Section 3.7 explaining how the analysis motivates recursive observation encoding, state-dependent bases, and whitening. It also states explicitly that the theory does not establish global optimality or attainment of the observability limit on the benchmarks.