- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
In this paper, the authors considered the standard filtering and smoothing problem of state space models. They aimed to design a different approach to learning latent dynamics: one that retains probabilistic inference over the hidden trajectory while avoiding an explicit particle approximation whose fidelity deteriorates with state dimension. They introduced Dynamical Variational System Identification (DVSI), in which a parameterized inference model maps a sequence of noisy measurements into a distribution over plausible state trajectories, while a second learnable model represents the unknown stochastic state-transition model (STM). They evaluated DVSI on nonlinear synthetic systems (stochastic Lorenz-63 and Lorenz-96) and high-dimensional real-world trajectories (MEG data).
Critical strengths
The paper is clearly written and well organized. The filtering and smoothing problem they consider is important.
Critical weaknesses
-
The model they considered is restricted to Gaussian transition dynamics (equation (1)) and Gaussian emission density (equation (2)). They commented on particle filters (PFs) as being not scalable, which is their main motivation. There are two issues. First, there are already various scalable PFs developed in recent years, such as "Can local particle filters beat the curse of dimensionality?" (AAP 2015), "Approximate Smoothing and Parameter Estimation in High-Dimensional State-Space Models" (IEEE Transactions on Signal Processing 2017), and "Iterated Block Particle Filter for High-dimensional Parameter Learning: Beating the Curse of Dimensionality" (JMLR 2023). Second, PFs are applicable for general SSMs where the problem considered in this paper is its Gaussian special case.
-
The paper does not have any Math proofs which is not common in this field for top publications. See the above three references as examples.
Questions for authors
-
See comment 1 above. How do the authors justify the claim that PF-based approaches are not scalable without considering these developments?
-
Can the authors provide theoretical justification for the claimed scalability advantages of DVSI, or clarify whether these claims are intended to be purely empirical?
-
What is the fundamental algorithmic or theoretical novelty of DVSI relative to existing deep variational state-space models and variational system-identification methods? The techniques used in this paper are very well-established ingredients in deep variational dynamical modeling. The paper does not demonstrate what is algorithmically new beyond applying these combinations.
-
Can the author provide the source code? Lacking reproducibility significantly weakens the credibility of their empirical claims. That is crucial for this empirical paper.
-
Can you establish fairness of the particle-filter baseline? The described comparison seems not fair. The paper compares DVSI primarily against one differentiable particle filter (DPF), using only 25 particles. As PFs being Monte Carlo based approaches, 25 particle are way too small and one rare taken this low.