- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
HiRCA uses an engineering subsystem partition as a soft prior to learn latent subsystem states and their temporal graph. Each observed variable is predicted using self-history, contemporaneous target-excluded subsystem context, and gated cross-variable histories. Calibrated residual scores support subsystem screening followed by candidate-first variable ranking. Experiments evaluate graph recovery and root localization on two hierarchical synthetic systems and four industrial datasets, reporting means and standard deviations over five seeds. The reported localization results are competitive, although the additional benefit of subsystem screening varies across datasets.
Critical strengths
- The distinction between shared subsystem variation and additional variable-level predictive effects is well motivated. The target-excluded construction provides a concrete way to operationalize this distinction, and Appendix A appropriately limits its theoretical result to population predictive support rather than claiming general causal identifiability.
- The evaluation covers both variable and joint time-variable localization, with five-seed variability. Reported results are promising: HiRCA leads variable Avg@10 on TEP (0.472) and joint Avg*@500 on three of four real datasets (Table 4). The real-data ablation and limitations section candidly report cases where screening hurts.
Critical weaknesses
- Two construction details weaken the claimed correspondence between the learned mechanism and its diagnostic/graph outputs. Equation (32) weights each cross-variable path by co-membership and the learned gate probability, but the graph score in Eq. (33) omits both factors. A nearly disabled path can therefore retain a large reported graph score; the graph-recovery results need justification against the effective predictor. Separately, Appendix D, lines 837–841, replaces the target-excluded context with the full pooled representation for effectively singleton slots. This reintroduces the current target into its own predictor and permits a self-reconstruction shortcut that can suppress the residual used for diagnosis. The frequency and empirical impact of this fallback are not reported.
- The experiments do not isolate the contribution of the learned hierarchy. The only component ablation retains the entire hierarchical predictor and calibration, removing only screening (Section 4.4). Its synthetic Avg@10 gains are 0.004 and 0.001; real joint Avg*@500 is unchanged or slightly worse on every dataset (Tables 5–7). A matched flat/fixed-membership predictor with the same calibration and comparable access to contemporaneous observations is needed. The synthetic generator also uses the correct partition and jointly perturbs selected variables and their parent subsystems (Section 4.1), leaving robustness to inaccurate priors or variable-only faults untested. Real-data partitions, event construction/splits, and baseline tuning are insufficiently specified to assess reproducibility and comparison fairness.
Questions for authors
- Does the implementation of Eq. (33) include the co-membership and gate factors omitted from the equation? How do graph-recovery results change when edges are scored by their effective gated contribution?
- How often is the singleton fallback used on each dataset, and do the main RCA results hold when its context is replaced by a strictly target-independent alternative?
- Can you provide a matched flat/fixed-membership control and the exact real-data membership maps, train/validation/calibration/test construction, and baseline tuning protocol? These would clarify whether the gains come from learned hierarchy rather than prior information, calibration, or evaluation choices.
2 comments
Dear Reviewer,
We have uploaded our rebuttal and revised manuscript, and we hope that our responses have helped clarify the concerns you raised. We would sincerely appreciate it if you could take a moment to review our responses at your convenience. If you have any remaining questions or concerns, we would be more than happy to provide further clarification.
We truly appreciate your time and consideration, and thank you once again for your valuable feedback.
Best regards, The Authors
Thank you for identifying the mismatch between the equation and implementation. We corrected the effective graph score and context fallback and updated the experiments.
W1/Q1. Effective graph scores. The original equation and path-score implementation omitted soft co-membership and gate factors. We now multiply each path norm by co-membership and gate probability before hard support and target-wise normalization, aligning scores with effective predictive paths. Using identical model weights, candidate support and normalization, we apply the same tail-gap rule to both datasets, searching upper tails containing 2–50% of eligible edges separately for subsystem and within-subsystem graphs. Within-subsystem variable-graph results are:
Results remain close after weighting. The main text and appendix consistently use the new effective score, with the equation and graph tables updated accordingly.
W1/Q2. Strict target exclusion. The former pooled fallback could include the current target. We replaced it with non-target pooling and zero context when peer mass is insufficient. Variable and joint time-variable localization results under this mechanism are shown below as five-seed means:
Strong localization performance remains with strict target exclusion. These results are used throughout the main text and appendix.
W2/Q3. Hierarchical modeling. We added No-hierarchy, which removes subsystem representations, assignments, latent graphs and context, and No-context, which removes only context. Retrained models use the same residual calibration fitted on normal-operation data. Full and No-context retain two-stage inference; No-hierarchy uses direct ranking. Five-seed mean variable Avg@10 is:
Full exceeds No-hierarchy on five datasets, supporting hierarchical prediction.
W2/Q3. Membership priors. Fixed freezes correct assignments while training other modules. Random preserves group sizes, shuffles the prior used for initialization and assignment regularization, and keeps assignments learnable. Mean Avg@10 with two-stage inference is:
Full exceeds Random on five datasets, while Fixed is generally close to Full, characterizing the contributions of engineering structure and assignment learning.
Joint synthetic perturbations model direct variable faults together with concurrent shared changes; root labels identify directly perturbed observed variables. The appendix now specifies the construction of Linear and Nonlinear, including generating mechanisms, fault injection, root labels, data splits and window settings.
The real-data appendix lists complete memberships, splits, event counts and training/calibration settings. TEP follows the six-group framework in MOSAIC [1], with XMEAS_37–41 additionally assigned to Stripper; causRCA groups follow the second device level of node paths. K/K_max is 6/8, 6/8, 5/7 and 3/5, with 15, 25, 22 and 34 fault events. Normalization and residual calibration are fitted on normal training data; validation controls early stopping. Baselines use their respective variable-level inputs and fitting procedures, while HiRCA additionally uses engineering assignments.
[1] Fan et al. MOSAIC, 2026. TEP preprocessing.