- Rating
- 3
- Confidence
- 1
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper addresses causal structure learning from event counts aggregated into time intervals. For example, given only the number of alarms of each type in each interval, the goal is to determine whether one alarm type triggers another, whether their influence is reciprocal, and whether an alarm type triggers further events of the same type. Building on a continuous-time Hawkes process, the authors establish that the complete count distribution identifies the underlying connection structure, including self-excitation and directed cycles, under the stated assumptions. They also propose C-SHP, a practical algorithm combining approximate computations with comparisons among candidate graph structures. Experiments on synthetic data and a selected real-world alarm dataset report higher directed edge recovery performance than the compared methods.
Critical strengths
- The paper addresses a fundamental question of whether causal connections can still be distinguished after exact event times are lost. Under its assumptions, it establishes that the complete count distribution identifies connections involving self-excitation and directed cycles. The analysis explicitly addresses effects carried over from earlier events and the ambiguity that self-excitation can introduce when determining connection directions.
- The practical algorithm combines several checks when selecting connections. For each candidate graph, it adjusts the baseline event rates and connection strengths, then compares how well the graph explains the data while penalizing additional connections. It also uses several patterns in the event counts to assess direction and retains existing two-way connections when the evidence is inconclusive. This design accounts for uncertainty when applying theory-inspired criteria to a limited amount of observed data.
Critical weaknesses
Self-excitation is discussed extensively in the theoretical analysis, and the proposed algorithm explicitly includes a step for detecting self-loops. However, self-loop recovery is not directly evaluated in the reported experiments. The synthetic experiments report edge recovery scores excluding self-loops, while the real-world reference graph contains no self-loops. The experimental results therefore do not show how accurately the proposed algorithm identifies self-loops.
Questions for authors
- Why was self-loop recovery excluded from the reported evaluation? Since the synthetic graphs contain self-loops and the algorithm includes a step for detecting them, could you report self-loop recovery performance from the existing experiments, if available?
- While Assumption 1 defines the theoretical setting, could you discuss the main challenges in applying C-SHP to more complex real-world event datasets than the one evaluated here? In particular, what should practitioners consider when the data may not fully satisfy these assumptions, and which aspects of the method might need to be adapted?
4 comments
Q2: While Assumption 1 defines the theoretical setting, could you discuss the main challenges in applying C-SHP to more complex real-world event datasets than the one evaluated here? In particular, what should practitioners consider when the data may not fully satisfy these assumptions, and which aspects of the method might need to be adapted?
We thank the reviewer for this valuable suggestion. We agree that applying C-SHP to more complex real-world event sequences may present additional challenges beyond the theoretical setting considered in our work. We have clarified these practical considerations in Appendix D.8.
First, latent confounding and incomplete event observations. Assumption 1 requires causal sufficiency, whereas real-world event logs may omit relevant event types or common external drivers. Such unobserved factors may induce dependencies that are difficult to distinguish from direct excitation effects. Practitioners should therefore assess whether relevant event types or common external drivers are omitted.
Second, model misspecification and temporal heterogeneity. C-SHP assumes nonnegative excitation with shared-decay exponential kernels and time-invariant parameters. In practice, event dynamics may exhibit heterogeneous decay rates, longer-range temporal dependencies, or time-varying background intensities. Such departures may influence the accuracy of the discrete-time fitting procedure and the recovered structure. Extensions to more flexible excitation kernels or time-varying intensities are possible directions for future work, although their corresponding PGFL representations and identifiability properties would require further theoretical investigation. Kernel shape and changes in background intensities should therefore be assessed when applying the method. The reported robustness tests assess specific departures from these assumptions.
Third, observation quality and scalability. Real-world event logs may contain missing events, irregular observation periods, or substantial differences in event frequencies across types. These characteristics may influence the estimation of historical excitation states and PGFL-based statistics. Careful preprocessing, distinguishing missing observations from genuine zero-count intervals, and assessing the stability of the inferred structure are therefore important in practice. For higher-dimensional event systems, candidate-edge screening and sparsity-aware search strategies may improve computational efficiency, while preserving sufficient coverage of potentially relevant interactions. These considerations call for careful preprocessing and checking stability across decay and threshold choices.
We have added the practical considerations in Appendix D.8 ("Practical scope"). Appendix C.1 explains the observation-window and exposure approximations, Appendix C.6 discusses search cost and computational limits, and Appendix D.4 reports the kernel and hidden-parent tests relevant to these considerations.
Thank you for the detailed response and revisions. The added self-loop recovery results address my main concern, and the discussion of practical limitations answers my second question. I view these additions positively. However, as noted in my review, my expertise in this area is limited, and I am not confident enough in my independent assessment of the theoretical contributions to support a stronger recommendation. I therefore maintain my rating.
We sincerely thank you for your thoughtful feedback and for recognizing the improvements made in our revision. We greatly appreciate your positive assessment of the additional results and clarifications, as well as your careful and constructive review. We fully respect your assessment and are grateful for the time and effort you have devoted to evaluating our work. Your feedback has been invaluable in helping us strengthen our paper.
W1 & Q1: Why was self-loop recovery excluded from the reported evaluation? Since the synthetic graphs contain self-loops and the algorithm includes a step for detecting them, could you report self-loop recovery performance from the existing experiments, if available?
Thank you for pointing out the need to explicitly report the recovery of self-loops.
The original Figure 2 reported off-diagonal directed F1, which excluded self-loops from that metric. We now report F1 including self-loops for all six original sensitivity experiments in Appendix D.2 (Figure 5). For the original default 20-seed datasets, C-SHP achieved overall F1 of 0.9144 ± 0.0465 and self-loop F1 of 1.0000 ± 0.0000 (Appendix D.3). Self-loop recovery was therefore accurate in the existing default experiments as well.
To more comprehensively evaluate the ability to recover self-loops, we conducted a supplementary synthetic experiment in which the proportion of self-loops was increased from 20% to 40%. Each graph contains 20 event types and 8 self-loops, in addition to bidirectional edges and longer directed cycles. The decay rate used during the data generation process was set to 0.35, while the decay rate used by C-SHP during model fitting was 0.175. The results are reported as the mean ± standard deviation across 20 random seeds.
In every graph evaluated, C-SHP accurately recovered all 8 self-loops without producing any false-positive self-loops, while maintaining an overall F1 score of 0.9739. These results demonstrate that, under the tested settings—even when the decay rate used for model fitting differs from the one used to generate the data—the method can still accurately recover self-loops.
We have added F1 results including self-loops for all six original sensitivity experiments in Appendix D.2 (Figure 5). Appendix D.3 separately reports self-loop F1 for the original default 20-seed setting. The supplementary enriched-cycle results appear in Section 5 (Figure 3(c)), with their generation protocol in Appendix D.3 and the evaluation definitions in Appendix D.1.