- Rating
- 2(−1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Hybrid systems are those which have continuous dynamics in the bulk, and a reset kernel that injects particles back into system, should they exit the system through its boundary. Stochastic hybrid systems are those in which the bulk dynamics and/or the reset kernel is stochastic. When the reset kernel is a one-to-one mapping, one can embed the dynamics into a higher dimensional ambient space in which they appear piecewise continuous. This is useful, since modelling the continuous dynamics alongside the discrete events in the base space is challenging (I think the authors could elaborate on this).
In this work, the authors construct a method for applying this analysis to stochastic hybrid systems with a stochastic reset kernel. They do so by extending the state space with an auxiliary variable (something akin to a momentum), whose dynamics are tuned to approximate the action of the reset kernel on the base manifold, through the interaction of the auxiliary variable with the base variable.
The present an algorithm for implementing their theory and illustrate the effectiveness of their result on two test cases. Finally, they compare their method against others in the field, and find it to be the most accurate.
Critical strengths
Their proofs are very well attributed, and appear to be quite sound.
The numerical tests are quite convincing. Their approximated dynamics correctly captures the evolution of particle ensembles over timescales ~10x times their training horizon.
Critical weaknesses
The authors could do a better job explaining the importance of this work to non-experts. Why is working with a hybrid system so difficult? Why does its treatment benefit from having a piecewise continuous analog.
The authors could also benefit from adding more exposition into the manuscript, at large. It seems as though the theory is a proof of existence? It does not predict the value of F, G, E, or D, but it provides insight into what size of latent space permits their existence? and then the numerical results show that the trained network of the appropriate form indeed reproduces the SHS? It might be nice to outline this for the reader.
I found Section 4.3 and "Cost Function Design" the most dense to parse through.
Questions for authors
I am slightly confused about how to interpret the dynamics in the lifted space. When is able to modify the dynamics of ? Is it always, with the discrete jumps only appearing due the projection applied by the decoder ? Or is still being applied at the boundary in some manner that leaves the map piecewise continuous but not continuous?
Do you have to know S a priori to apply this analysis? Or can you take any dataset whose dynamics appears to have discrete reset events and apply it? I imagine you can always infer S as the set of all x in your data where a discrete event occurs?
Are there some kernels that make this make this approximation more difficult than others? I feel like that was an under discussed topic in the current version of the manuscript. But please correct me if you disagree! Please do not just add a discussion of this to pander to me, if you disagree.
3 comments
Revised score
Thank you for the responses! They have clarified my questions about the role of and the guard. I find the ideas of the paper very novel, but following the discussion with Reviewer DFnu (see my comment above on Lemma 1), I have remaining concerns about the theory. I think it might need some extra fine-tuning before publication. Therefore, I currently sit between weak accept and weak reject.
Thank you for the question. They are very helpful for us in improving the clarity of this work.
We have replied to the question after your discussion with Reviewer DFnu.
The TL;DR is that the reset in A-SHS does not need . We require , as our argument in Lemma 1 is for the product space , not .
Critical Weaknesses
1. Why is working with a hybrid system so difficult?
Learning a hybrid system requires capturing continuous dynamics, event boundaries, and reset behavior simultaneously. Small prediction errors near a guard can change whether or when a reset occurs, producing substantially different subsequent trajectories. Stochastic resets additionally require learning a distribution of possible outcomes.
2. Why does a continuous representation help?
We aim to avoid explicit discontinuities during rollout, as errors near reset events can be amplified and compromise rollout stability. Evolving a continuous latent SDE avoids explicit event detection and reset operations during integration. The latent sample paths are continuous; “piecewise smooth” refers to the geometric representation and coefficients. We will clarify this motivation.
3. Is the theory primarily an existence result?
Yes, the geometric embedding result primarily establishes existence under the stated assumptions. Section 4.3 additionally provides a construction of augmented dynamics targeting the original system’s state-density evolution.
4. Does the theory determine (F,G,E,D), or mainly the required latent dimension?
The theory provides a sufficient/general embedding dimension, dz≥4n, rather than a minimum dimension or a unique representation. Given an embedding E, the transformed coefficients F,G follow from Itô’s formula, and the ideal decoder selects a representative of each equivalence class. The practical algorithm learns their neural approximations from trajectories.
5. Do the numerical results demonstrate that the trained model reproduces the SHS?
The experiments empirically evaluate how closely the learned model reproduces the SHS’s state and path distributions, including beyond the training horizon. We will distinguish this empirical validation from the theoretical representation results.
Recovering the graph structure of the hybrid system remains an interesting future work, as we need to extract the discrete structure from the decoder.
6. Section 4.3 and “Cost Function Design” are difficult to follow.
Sec. 4.3 provides an intuitive construction to show how the variable v can encode different branches of resets to reproduce stochastic resets at the guard.
The cost function design section basically tells us to match the path distribution. We will make the motivation of the two sections clearer.
Questions for Authors
1. When does v affect x? Are resets still applied, and are the lifted paths continuous?
In the construction of Section 4.3, x follows its original SDE between events. The auxiliary variable v determines the displacement at the guard through
(x+,v+)=(x−+v−,v−).
Thus, resets remain explicit in the augmented (x,v) coordinates. After gluing,
z+=E(x−+v−,v−)=E(x−,v−)=z−,
so the embedded trajectory is continuous. The ideal decoder recovers the observed jumps through its discontinuity at the glued seam; the neural decoder approximates this behavior at sampled observation times.
2. Must S be known? Can the method use unlabelled trajectories, or infer S from observed jumps?
The analytical construction uses S, but the learning algorithm requires only state trajectories, without a known guard, reset kernel, or event labels. It can therefore be applied directly to unlabelled trajectories within our SHS setting. Observed jumps can help locate the guard, but finite samples do not generally identify the entire S exactly. Such identification is unnecessary for our training procedure.
3. Are some reset kernels harder to approximate?
At the level of branch representation, we do not see a kernel-specific topological obstruction. In our formulation, any reset kernel can be represented through a conditional distribution over v=x+−x−, while the reset R(x,v)=(x+v,v) remains deterministic. The kernel determines the distribution over reset branches, without restricting the branch representation itself. Our experiments demonstrate successful learning with both Gaussian-mixture and uniform reset distributions.
The difficulty may instead arise in learning the augmented dynamics required to redistribute probability mass and match the prescribed v-distribution at the guard. For sharply concentrated distributions, the redistribution requirements may demand rapidly varying drift coefficients, making the dynamics hard to learn.