- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The authors propose Path Matching (PM), an on-policy approach to training Neural ODEs (NODEs) that learns the velocity field at states visited during model rollouts while resolving path-crossing conflicts which enables training on the paired data setting. They evaluate PM on classification and clinical time-series tasks, comparing its performance with that of other NODE baselines.
Critical strengths
- PM demonstrates robustness across architectural variations, including network width and depth.
Critical weaknesses
- The claim that PM resolves path-crossing conflicts lacks sufficient theoretical justification. It remains largely unclear why on-policy supervision would yield compatible trajectories when the prescribed paths contain conflicting velocity targets. For instance, a mathemetical supports establishing conditions under which training loss goes to zero guarantees non-crossing trajectories would help substantiate this claim.
- The per-iteration runtime comparison in Table 4 excludes PM’s pretraining cost and compares field-only training against other baselines. These differences make it difficult to attribute the observed speedup to PM’s training objective alone or to establish an overall training-efficiency advantage.
Questions for authors
- Can the authors justify the choice of ? (Ln.151) Ablating with other options will help understand the effectivness of the proposed method.
- Can the authors provide the total and trainable parameter counts for each baseline and PM, also spcifying with 'non-NODE stack' (mentioned in Ln.200)?
- Since the authors claim that PM learns interpretable transport (Ln.429), can the authors visualize the learned transport trajectories and compare them with those of the baselines? This would help clarify what the on-policy framework learns and how the resulting transport is really interpretable.
- Can the authors mention which solver is used to meausre MSE on Table 7?
2 comments
I thank the authors for their response, but I will maintain my score.
The response does not address either critical weakness: the lack of theoretical justification for resolving path-crossing conflicts, and the exclusion of pretraining cost from the Table 4 runtime comparison.
Thank you. I really appreciate your feedback.
Also, thank you for pointing out the reference issues. It's quite important to cite other papers properly! I will definitely fix them in the final version.