- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates how dynamics models learned from forward prediction can be reused for inverse state inference. The authors propose a framework that uses frozen, locally invertible mechanisms to reconstruct hidden trajectories from later observations. The method combines direct inverse execution with importance weighting to account for uncertain innovations and noisy observations. The paper further derives a conditional error bound and compares terminal-anchored and midpoint-anchored proposals on unseen mechanism compositions. Experiments across 24 held-out synthetic worlds show that the preferred anchor depends on whether the dynamics are expanding or contracting. The results also demonstrate computational advantages over continuous-grid smoothing in certain expanding-dynamics settings.
Critical strengths
The main strength of this paper is its systematic investigation of inverse inference using previously learned dynamics without retraining separate inverse models. The framework explicitly distinguishes inverse execution error, model error, and uncertainty in unobserved inputs. Furthermore, the held-out experiments compare different proposal anchors under a common posterior target, providing useful insights into how dynamical properties affect inference efficiency.
Critical weaknesses
The main limitation is that the experimental validation remains restricted to synthetic systems with scalar hidden states and relatively simple transition mechanisms, making it difficult to assess the generalizability of the findings. Although direct inversion demonstrates computational advantages in certain settings, Table 1 shows that only two of the eight experimental configurations satisfy the predefined matched-quality cost criterion. The learned-versus-true posterior discrepancies also remain substantial, raising concerns about the practical effectiveness of inverse inference when the learned dynamics are imperfect. In addition, the conditional error bound does not directly explain the observed differences in effective sample size between proposal anchors.
Questions for authors
- The experiments focus primarily on scalar-state synthetic dynamical systems. Could the authors clarify whether the proposed approach can be extended to higher-dimensional or more complex nonlinear systems? How might the computational advantages change as the state dimension and uncertainty increase?
- In Table 1, only two experimental configurations establish a reliable computational advantage over grid-based smoothing. Could the authors clarify the conditions under which direct inversion is expected to outperform structured smoothing methods? How sensitive are these results to the proposal distributions and observation noise?
- The learned-versus-true posterior discrepancies remain relatively large despite accurate inference under the learned model. Could the authors further discuss how prediction errors affect downstream state recovery and whether improved forward-model accuracy would change the observed anchor preferences?
Your distinction between an accurate sampler and an accurate model gets at why we froze the dynamics. Once that fit is reused for a reverse query, changing the proposal tests the sampler while keeping the model error fixed. Thank you for asking where this works as dimension, observation precision and cost change.
Higher dimensions and cost. We added nonlinear vector-state tests and a matched-accuracy budget comparison in revised Appendix W. Against the same fitted posterior, both guided anchors and HMC passed every marginal check in 8D and 16D. Gauss–Newton missed one in 16D. The original proposals passed at most 3/24 checks in 8D despite using four times as many draws. In a separate cost comparison, the 2,048-path midpoint guide cost less in two of three qualifying settings, one in 8D and one in 16D. The baseline was the cheapest tested Gauss–Newton budget that met the same 80% pass criterion. The fourth setting did not meet that criterion (revised Appendix W).
Cost against grid smoothing. At matched fitted-posterior accuracy, the original policy was cheaper in two of eight settings. Both used expanding chains and two readings, at 16 and 32 steps, where grid cost was 1.53× and 1.57× the direct method’s cost (original Table 1). Both methods had to pass at least 80% of 36 held-out cells. The 95% world-bootstrap interval for log(grid/direct cost), computed on cells where both passed, had to lie above zero.
Proposal sensitivity. In a post-review 16-step comparison, replacing clipped-gradient with quadrature guidance raised midpoint full-path passes from 8/36 to 36/36 with the anchor proposal, two readings, fitted posterior and 8,192-path budget fixed. Grid smoothing also passed all 36 checks and cost less than the guided midpoint (revised Figure 6 and Appendix C).
Observation noise. In the added Appendix U sweep on expanding 16-step chains, both quadrature-guided anchors passed every full-path check at the tested sensor-noise standard deviations from .05 to .20. At .01 under the refined reference, the original proposals passed none, while guided terminal and midpoint passed 25/36 and 18/36 (revised Appendix U).
Forward-model error and anchor choice. In the added true-dynamics comparison, the forward fit accounted for the larger discrepancy at the initial state. Fitted-to-true posterior KS was 0.409 in expansion and 0.272 in contraction, while guided sampling had KS of 0.009–0.013 against its fitted posterior. Using the true dynamics changed the effective sample size (ESS) gap. Under both models, the terminal anchor had higher ESS in expansion and the midpoint anchor in contraction (revised Appendix U). A next test is to vary forward-fit accuracy at fixed observation settings and sample budget, and check whether the ESS ranking changes within each proposal family.
Recovery bound and ESS. Under the inverse identities and domain conditions in original §3, the forward-fit error contributes at most ρ(1−ρH)δ/(1−ρ) to the starting-state recovery error when the inverse-state gain is ρ<1, forward error is uniformly bounded by δ, the terminal state and disturbances are correct, and inverse execution is exact. Revised §3 adds the ESS limit for independent draws, with proposal coverage and finite weight variance. It makes explicit how ESS depends on the full target-to-proposal density ratio.