- Rating
- 1
- Confidence
- 1
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper studies the identifiability probelm of the persistent-recurrent hierarchy in dual non-iid time series and proposes a new model for latent factor recovery.
Critical strengths
- The paper investigates an important identifiability problem by considering persistent environments and recurrent mechanisms.
Critical weaknesses
- The theoretical results rely on numerous conditions and assumptions that are much difficult to understand and lack sufficient intuitions and motivations. Their relationships to existing literature are also unclear, making it difficult to assess whether the proposed method effectively addresses the identifiability problem.
Questions for authors
- How are Conditions A-C and Assumptions 1-2 related to the existing literature? Please carefully clarify these conditions to help readers better understand the positioning of this work.
- The authors should formulate the theoretical results mathematically rather than relying on verbal descriptions (e.g., Theorems 1 and 2). The current presentation makes these results difficult to understand.
4 comments
Response to Reviewer xp7A (Part 2/2)
2. Mathematical formulation of Theorems 1 and 2
Reviewer question.
The authors should formulate the theoretical results mathematically rather than relying on verbal descriptions (e.g., Theorems 1 and 2). The current presentation makes these results difficult to understand.
Response. We agree that the identification targets and allowed transformations should be directly visible. Below we state the mathematical content and indicate the corresponding presentation changes.
Theorem 1 concerns one global hierarchy correspondence. Let denote admissible parameterizations with the same observed sequence laws under the conventions in Appendix C.1. Under Condition A, Assumption 1, and coverage, the two parameterizations have the same and environment partition up to naming. There exist separate global permutations and such that the identified state-indexed objects obey
on the corresponding covered contexts and common histories. These relations appear in Eq. (45), Appendix D.2 (p. 25). The same applies across covered environments, whereas sequence-local recovery permits different permutations. Lemma D.4 identifies locally; the translated rows identify the environment partition and , then align the recurrent classes. We have expanded the Section 2.3 proof sketch using
\qquad \Delta_{n,i}-\bar\Delta_n=w_r-\bar w,$$ which shows why correspondence need not be supplied before alignment. **Theorem 2 concerns coordinate equivalence.** Under Theorem 1, the population regime, and Condition B, every admissible $X$-equivalent parameterization satisfies $$\widetilde S=\kappa(S),\qquad \widetilde Z_{t,j}=a_{S,j}\\!\left(Z_{t,\pi_S(j)}\right),$$ where $\kappa$ is a bimeasurable bijection, $\pi_S$ is a coordinate permutation, and each $a_{S,j}$ is a componentwise $C^2$ diffeomorphism. Under Condition C, a single permutation and a single set of componentwise maps apply globally. We have moved this equivalence, previously stated immediately after the theorem, into Theorem 2 itself as Eq. (12) (p. 5), together with the definitions of the transformations. For completeness, Corollary 1 additionally uses equality of the joint $(X,Y)$ law and Assumption 2. Under the global coordinate permutation, the identified target subset transforms as $\widetilde J_C=\pi^{-1}(J_C)$. This is representational subset identification; a causal interpretation requires the additional structural condition described in Section 3.2. The proofs and representative ambiguities are given in Appendices D–F. These revisions make the assumptions, identifiable objects, and remaining transformations explicit without changing the distinction between population guarantees and finite-sample estimation. We thank the reviewer again and hope the clarified mathematical statements and literature connections support a reassessment of the theoretical contribution. ## References 1. Balsells-Rodas, C., Wang, Y., and Li, Y. [On the Identifiability of Switching Dynamical Systems](https://proceedings.mlr.press/v235/balsells-rodas24a.html). ICML, 2024. 2. Hyvärinen, A., Sasaki, H., and Turner, R. E. [Nonlinear ICA Using Auxiliary Variables and Generalized Contrastive Learning](https://proceedings.mlr.press/v89/hyvarinen19a.html). AISTATS, 2019. 3. Yao, W., Chen, G., and Zhang, K. [Temporally Disentangled Representation Learning](https://proceedings.neurips.cc/paper_files/paper/2022/hash/a938292feb86b94ebe3e6200ff7786ef-Abstract-Conference.html). NeurIPS, 2022.Response to authors
I thank the authors for their detailed responses and revisions. The theoretical results are now clearer. However, I still find the overall presentation difficult to follow. The assumptions are too dense, making it difficult to assess the significance of the contribution. In addition, the changes are not highlighted in the revised paper. I will keep my original score.
Thank you for your time and thoughtful feedback. We sincerely appreciate your comments and suggestions.
Response to Reviewer xp7A (Part 1/2)
Response to Reviewer xp7A
We sincerely thank the reviewer for recognizing the importance of the identifiability problem and for highlighting the need for clearer motivations, mathematical statements, and connections to prior work. We have revised the presentation around the distinct recovery stages and made their mathematical relationships more explicit. Manuscript references in our responses use the revised version; reviewer quotations retain their original numbering.
1. Roles of Conditions A–C and Assumptions 1–2
Reviewer question.
Response. The conditions address different ambiguities. We now separate the discrete hierarchy result from coordinate recovery and target-dependent refinement, rather than presenting their assumptions as a single undifferentiated requirement.
The resulting logical order is
\text{A + Assumption 1 + coverage} &\Longrightarrow \text{persistent–recurrent hierarchy},\\\\ \text{the hierarchy result + B} &\Longrightarrow \text{context-wise dynamic coordinates},\\\\ \text{context-wise recovery + C} &\Longrightarrow \text{a global coordinate chart},\\\\ \text{global recovery + the observed }(X,Y)\text{ law + Assumption 2} &\Longrightarrow \text{the target-relevant subset}. \end{aligned}$$ These statements use the population, regularity, and coverage conventions of Section 2.1 and Appendix C.1. The common tools from [1–3] are acknowledged explicitly in the revised Appendix B (p. 16). Our contribution is the additional identification of the unlabeled hierarchy and shared state correspondence, followed by a clear separation of the requirements for context-wise, global, and target-dependent recovery. To provide intuition for Assumption 1, Section 2.3 and the new Appendix C.5 (p. 22) give an observable channel with conditional mean $m_0(h)+u_e+v_r$, independent of the static background. Averaging over common histories produces a translated signature. Nonlinear history dependence and nonadditive conditional covariance remain possible. This supplies a nontrivial sufficient family while keeping the condition's scope explicit.