- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper presents Neighborhood training for learning chaotic dynamics from noisy trajectories. The method constructs annular neighborhoods around observed states, evolves neighbor displacements through a second-order Taylor expansion of a Neural ODE, and matches predicted and observed neighborhood distributions using MMD. The objective combines this neighborhood regularizer with trajectory fitting. Experiments on a series chaotic problems demonstrate improved Jacobian accuracy relative to trajectory-only training and DySLIM, with mixed results for short-term forecasting and long-term statistical accuracy.
Critical strengths
- The method offers an interesting way to learn local dynamics from noisy trajectories through neighborhood distribution matching.
- The annular neighborhood design is well motivated: excluding overly close observations helps prevent measurement noise from overwhelming the relative displacements used to learn local dynamics.
- The method improves Jacobian accuracy over Vanilla and DySLIM using only noisy trajectory observations, avoiding ground-truth derivative supervision that is typically unavailable when the governing equations are unknown.
Critical weaknesses
- Scalability to spatiotemporal systems. Although the method performs well on low-dimensional ODEs, its applicability to more complex spatiotemporal systems, such as the Kuramoto–Sivashinsky equation and two-dimensional Navier–Stokes flows, remains unclear. Here, each state represents an entire spatial field, and neighborhoods are constructed in the full state space rather than physical space. As the dynamics’ intrinsic dimensionality increases, finite trajectory datasets may become too sparse to provide sufficiently close and directionally informative neighbors.
- Insufficient empirical validation of scalability. This concern requires empirical validation beyond qualitative discussion. Experiments on a spatially extended system, varying resolution, and local dataset size, would help establish whether informative local neighborhoods remain available.
- Limited justification for neighborhood matching. Proposition 1 concerns exact agreement of restricted measures, whereas the implemented loss uses finite samples and Taylor-approximated evolution. Small empirical MMD does not, by characteristicness alone, guarantee support agreement or Jacobian accuracy. The connection to local deformation and long-term statistical accuracy therefore needs stronger justification and more qualified discussion.
- Mismatch between formulation and implementation. Eq. (6) restricts global pushforward measures to target sets, whereas the algorithm evolves samples from source neighborhoods. These constructions may not be generally equivalent.
Questions for authors
- Related to Weakness 1 and 2, could the authors provide an experiment on one spatial system and assess how neighborhood quality and performance change with dimensionality and local dataset size?
- How do neighborhood quality and model performance change as the dynamics’ intrinsic dimensionality increases? An experiment on a spatially extended system would help further clarify the method’s practical scalability.
- What additional assumptions are needed to connect small empirical neighborhood MMD to accurate local deformation and long-term statistics, beyond the exact measure agreement in Proposition 1? Clarifying this would help readers understand the scope and limitations of the theoretical justification.
- Can the authors clarify how Eq. (6), which restricts global pushforward measures to target sets, corresponds to the implemented objective that evolves samples from source neighborhoods?