- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces SC-SCfC, a continuous-time network that models hidden-state evolution using multiple adaptive exponential decay timescales while preserving closed-form propagation between irregular observations. Its state-conditioned matrix allocation extension allows decay along data-dependent latent directions, with experiments across four benchmark families showing competitive performance in classification and remaining-useful-life regression.
Critical strengths
- The paper addresses the interesting problem of modelling time series with irregularly spaced observations.
- I believe that the proposed approach is interesting and well motivated.
Critical weaknesses
- For me, the main issue is readability. The paper is difficult to follow in places.
- The quantitative results do not appear particularly impressive. Statistical significance testing would help establish the reliability of the findings.
Questions for authors
In my view, the paper is borderline, and I am leaning towards rejection. However, I am open to reconsidering my score.
- Could you clarify Figure 1? I believe its readability could be improved.
- Could you comment on the identifiability of the model?
- Could the computations described in lines 240–250 lead to numerical instability? Please discuss this concern.
- Could you justify the choice of baselines? Around line 290, you state that the baselines differ across tasks. Why is this the case?
- Are the differences in the reported scores statistically significant?
- Could you report runtimes for the proposed method and the baselines?
Thank you for the constructive review and for being open to reconsidering your score.
W1 / Q1: Readability and Figure 1. Figure 1 is a conceptual illustration, not an experimental result.
Following your suggestion, the revised PDF contains a redrawn Figure 1:
The revised PDF also states the readout in Sec. 3.1 and rewrites the five densest sentences of Sec. 3 so that each idea comes before its notation. The prediction at event i is yi=F([h(ti−);zi]), which uses the current observation.
Q2: Identifiability. Our results do not rely on parameter identifiability, and we do not claim it. Three levels should be distinguished.
Learned rates and directions should therefore be read as one functional representation that the network found, not as recovered ground-truth timescales.
Q3: Numerical stability of lines 240–250. Exact positive definiteness (S=∑kBkBk⊤+εI⪰εI) guarantees that the Cholesky factor exists. In general κ2(S)≤(∑k∥Bk∥22+ε)/ε, which can be large. What keeps it under control in practice:
The revised PDF notes the identity-offset initialization in Sec. 3.3, and the final version adds the full argument.