- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
This paper is about estimating Markov transition probabilities for monotone degradation processes from sparse observations collected over heterogeneous intervals. It proposes BDS, which uses an explicit spectral decomposition of the upper-bidiagonal matrix to evaluate the transition needed by the likelihood. The authors also provides the computational complexity of the method. Experiments on synthetic data, NASA battery data, and XJTU-SY bearing data compare BDS with general matrix, banded matrix, and EM-based methods.
Critical strengths
1: The studied computational problem: learning degradation dynamics from sparse, heterogeneous, long-horizon observations is very important.
2:There are experiments on both synthetic benchmarks and two real-world datasets, demonstrating practical scalability of the algorithm.
Critical weaknesses
1: Theorem 4.1 is just a special factorization of the classical Opitz/divided-difference formula for functions of upper-bidiagonal matrices. Key prior work by Opitz, de Boor, Higham, Davis, Descloux, and Van Loan is not cited.
2: The diagonalization underlying Theorem 4.1 fails at repeated transition probabilities. Since , the transition matrix is an unreduced upper-bidiagonal matrix. Its eigenvector recurrence implies that every eigenspace is one-dimensional; hence any repeated diagonal eigenvalue makes the matrix defective. Consequently, no invertible eigenvector matrix exists such that .
3: The baseline comparison is unfairly weak. BDS is compared with naive divided differences and generic dense eigendecomposition, rather than an optimized structured implementation of the classical bidiagonal/divided-difference formula. Thus, the paper does not establish that the proposed method improves upon existing structured methods.
4: The bound is established theoretically. However, the reported implementation uses ForwardDiff, for which the manuscript itself gives a per-gradient cost of . Therefore, the experiments do not implement or empirically validate the headline gradient complexity.
Questions for authors
See the weakness part.