- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
In this paper, authors proposes TTA-SINDy-SHRED for adapting latent dynamical models to unseen physical parameter regimes using sparse sensor observations. The method builds on a pretrained SINDy-SHRED model and constructs affine families for the latent dynamics coefficients and decoder output corrections. At test time, two scalar contexts are inferred from a calibration window without backpropagation through network weights. Experiments on Burgers, Gray–Scott, and two-dimensional Navier–Stokes systems report improved forecasting accuracy over the unadapted pooled model.
Critical strengths
-
Practical adaptation setting. The method requires only sparse target-regime sensor observations, without access to full-state target data. The Gray–Scott experiment involving changes to the diffusion coefficient of an unobserved species is particularly relevant
-
Adaptation involves a scalar optimization followed by a closed-form regression. The reported context-inference time of approximately 3.4–4.1 seconds suggests practical potential for real-time deployment.
-
Promising forecasting improvements. Experiment section reports substantial reductions in decoded error across several regimes. The four-arm ablation also provides useful evidence about the different roles of dynamics adaptation and decoder correction.
Critical weaknesses
-
The contribution over closely related work is insufficiently established. Low-dimensional context adaptation and affine context models have also been studied in Kirchmeyer et al., 2022 and Blanke and Lelarge, 2024. The sparse-observation setting provides a meaningful distinction, but the current comparisons do not establish the additional value of the proposed combination over appropriately adapted alternatives.
-
The interpretability claim requires stronger support. Equation (3) specifies ridge regression without an explicit sparsity or support-preservation constraint, making it unclear whether the adapted coefficient matrices retain the sparse structure learned during initial training.
-
The experimental comparisons do not clearly establish which components drive the reported improvements. The proposed method and the baselines differ in several aspects of their architectures and training procedures, making it difficult to attribute the gains specifically to the proposed test-time adaptation mechanism. More controlled comparisons would help clarify the contribution of this mechanism beyond the underlying model and training choices.
-
Although the experiments demonstrate promising results under controlled distribution shifts, it remains unclear how well the method transfers to more diverse and challenging conditions. Evaluation across a wider range of scenarios would strengthen the evidence for its applicability beyond the settings considered.
References
-
Kirchmeyer, M., et al., Generalizing to New Physical Systems via Context-Informed Dynamics Model. International Conference on Machine Learning (ICML), 2022.
-
Blanke, M., and Lelarge, M. Interpretable Meta-Learning of Physical Systems. International Conference on Learning Representations (ICLR), 2024.
Questions for authors
-
Could the authors further distinguishes the proposed adaptation mechanism from combining the representation with a CoDA/CAMEL-inspired context adaptation method under the same sparse-observation constraints?
-
Does the family-fitting procedure preserve a fixed sparse support or apply additional thresholding beyond Equation (3)? Can the authors show representative adapted equations, their sparsity, and the relationship between inferred contexts and physical parameters?
-
Could the authors further clarify whether calibration-window sensitivity be evaluated with a fixed forecast interval to separate the effect of additional observations from changes in prediction difficulty?
I am willing to raise my score if these concerns are satisfactorily addressed with convincing explanations and evidence.
5 comments
- W4: Evaluation across a wider range of scenarios.
The three PDE systems already span structurally distinct forms of parameter dependence: direct dependence through the observed field (Burgers), indirect dependence through an unobserved coupled species (Gray–Scott sweep), and nonlinear, non-affine dependence requiring a local approximation (Navier–Stokes).
Beyond these simulated systems, the revision adds a real-world experiment (see the new Section 4.4 and Table 3 of the manuscript) that widens the evaluation in two directions. First, the cylinder wake from RealPDEBench (Hu et al., 2026) uses experimental PIV measurements instead of simulation, where the flow is turbulent, the data is noisy, and no governing equation is available for any regime. Second, the controlled cylinder data varies Reynolds number and forcing frequency jointly, which tests the multi-parameter extension (Equation 11) directly. Test regimes are grouped by whether Re, , or both lie outside the source range, and full adaptation gives the lowest decoded error in every group.
Decoded error vs. forecast horizon (LINK): We reconstruct the cylinder (left) and controlled-cylinder (right) wakes from 32 sensors and compare the four arms over a long forecast horizon.
- Q1: Could the authors further distinguish the proposed adaptation mechanism from combining a SHRED-like representation with a CoDA/CAMEL-inspired context adaptation method under the same sparse-observation constraints?
In principle, one could train a SHRED encoder, extract its latent trajectories, and apply CoDA- or CAMEL-style context adaptation in latent space. However:
(a) CoDA-style (gradient-based, -dimensional context): The context would need to be optimized by backpropagating through a neural ODE using the sensor-space residual as the loss. Because the decoder maps -dimensional latents to -dimensional fields and only sensors are observed, the Jacobian of the sensor residual with respect to the -dimensional context is rank-deficient, making the optimization ill-conditioned. Our scalar context with Levenberg–Marquardt avoids this by reducing the search to a single well-conditioned dimension.
(b) CAMEL-style (affine, closed-form): CAMEL's closed-form solve requires evaluating the residual at every spatial location. With sparse sensors, the solve must be projected onto the -dimensional observation subspace, breaking the identifiability guarantees that underpin CAMEL's theoretical analysis.
(c) Our approach: TTA-SINDy-SHRED instead co-trains the encoder, decoder, and SINDy dynamics so that the latent space is dynamics-aware, then adapts through the sensor residual using a one-dimensional affine family. The joint training ensures that the SINDy library well-approximates the latent dynamics and that the context coordinate varies smoothly with the physical parameter—structural properties that a post-hoc adaptation of a separately trained SHRED encoder would not inherit.
- Q2: Does the family-fitting procedure preserve a fixed sparse support? Can the authors show representative adapted equations?
The family fitting (Equation 3) uses ridge regression, which does not enforce sparsity directly. However, the support (sparsity pattern) of and is shaped by the SINDy loss during joint training, which promotes sparsity in . Since approximates the source centroid and captures the first-order parameter dependence, both inherit the sparse structure of the trained model. An additional thresholding step could be applied post-hoc to enforce exact support preservation, though we did not find this necessary in our experiments.
- Q3: Could calibration-window sensitivity be evaluated with a fixed forecast interval?
The sensitivity study in Appendix C already evaluates with a fixed forecast protocol: all configurations are assessed at the same set of horizons regardless of the calibration window length . A shorter therefore does not reduce the prediction difficulty—it reduces only the amount of calibration data available for context inference while keeping the forecast task identical. Figure 13 (top-center panel) shows that and yield higher and more variable error at longer horizons, reflecting the difficulty of estimating from limited data, while and produce similar results, suggesting that the context estimate saturates beyond a sufficient calibration length.
part 2/2
I appreciate authors' detailed responses. I have a few follow-up questions:
-
We would like to further ask about the rank-deficient problem. Observations collected over multiple time steps may yield a full-rank context Jacobian, even when observations at each time step are low-dimensional. Instead, reducing the context to a single scalar does not necessarily guarantee identifiability or well-conditioned optimization. Therefore, it remains unclear why the proposed scalar parameterization is theoretically better suited to sparse sensing.
-
Another issue is about the claim of joint training yields a physically meaningful context. From my understanding, the affine family is non-identifiable under reparameterization while joint training alone does not guarantee monotonic or smooth dependence on physical parameters. The distinction between predictive adaptation and physical parameter identification remains unclear as well.
We thank the reviewer for the constructive evaluation and for identifying specific questions whose resolution could raise the assessment. We address each weakness and question below, and upload a revised manuscript with the changes marked in red.
We have substantially strengthened this positioning in the revision. The new Table 1 (Section 2) places TTA-SINDy-SHRED alongside CoDA, CAMEL, and the sparse-sensing baselines along four capability axes: sparse-sensor input, adaptation to unseen regimes, gradient-free adaptation, and interpretable dynamics. TTA-SINDy-SHRED is the only method combining all four.
The key distinction is not merely that CoDA and CAMEL have not been tested on sparse sensors, but that their context-inference procedures require full-state observations. CoDA optimizes a d-dimensional context by backpropagating through a neural ODE over complete state trajectories; with only p≪n sensors, this gradient problem is severely ill-conditioned. CAMEL's closed-form solve takes full-state vectors as input, and its identifiability guarantees assume full observability.
TTA-SINDy-SHRED shares CAMEL's affine context structure—a deliberate design choice that enables the closed-form decoder solve and makes gradient-free dynamics inference from sparse measurements tractable. The affine structure sacrifices the expressiveness of CoDA's nonlinear context for the efficiency and identifiability needed when the observation is a small linear projection of the state. This structural connection is now discussed in Section 2.
We appreciate the reviewer for this comment. Sparse variable selection (symbolic regression) is enforced where the equations are learned. Therefore, jointly training with the SINDy loss and thresholding (Section 3.1, Appendix A.2) yields a sparse Ξpooled, leading to an interpretable latent space model. Adaptation then moves the model along a single direction Ξ1 through one scalar, so the adapted dynamics remain an explicit latent ODE at every regime and the parameter dependence is captured entirely by Ξ1. We address the concern about Equation (3) in Q2. To support the claim that the context is physically meaningful, the figure below shows that the inferred context places each unseen Reynolds number on the correct side of the training range and preserves their order across seeds.
Context recovery on Navier–Stokes (LINK): We infer the dynamics context from 32 sensors at the four unseen Reynolds numbers and compare it to the true context, for five seeds. Estimates are clipped at ∣c∣≤3.
We acknowledge the concern and note that the experimental design was structured to isolate components as systematically as possible:
(i) The four-arm ablation (Table 2) holds the architecture fixed (TTA-SINDy-SHRED) and varies which contexts are active: no adaptation, decoder only, dynamics only, and full. This isolates the contributions of cdyn and cdec across three PDE systems and multiple parameter regimes.
(ii) The baseline experiments (Table 4, Figures 3 and 14–17) hold the adaptation protocol fixed (same two-scalar mechanism, same decoder family) and vary the architecture and dynamics model: GRU + SINDy ODE (proposed) vs. FNO / DeepONet / Senseiver + ConditionalMLP. This isolates the effect of the jointly trained SINDy dynamics versus post-hoc neural dynamics.
(iii) The sensitivity analysis (Figure 13) varies one hyperparameter at a time (latent dimension, calibration window, sensor noise, lag, number of sensors) to confirm robustness.
Together, (i) shows that dynamics adaptation accounts for most of the long-horizon improvement, (ii) shows that the SINDy dynamics provide a stronger prior than post-hoc alternatives across architectures, and (iii) shows that results are not fragile to hyperparameter choices.
part 1/2