- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper aims to extend existing results for bounding probabilities of causation (PoCs), from the setting of binary treatments and outcomes, to non-binary treatments and outcomes, and to incorporate partial structural assumptions and covariate- or mediator-specific information as additional constraints.
Critical strengths
(S1) Probabilities of causation are of fundamental interest in many areas of science, and providing good bounds on them can have practical utility.
Critical weaknesses
(W1) The theoretical undertaking is modest.
Existing results show how to bound PoCs using linear programs for binary treatments and outcomes. Extending this to the setting of multi-valued, non-binary data, even though technical, does not seem to be a major contribution. Similarly for the covariate-specific approaches, compared to existing work.
In summary, it is unclear whether the paper proposes fundamental new ideas in the area.
(W2) Competing approaches are not really engaged with properly.
Previous literature introduces and discusses tools for generic bounding from combinations of observations and experiments [1]. Even though cited, this work is not really engaged with properly: what is the benefit of the proposed method compared to such approaches, if any? This really needs to be clarified, because otherwise the direction of research is not well justified.
[1] Zhang, Junzhe, Jin Tian, and Elias Bareinboim. "Partial counterfactual identification from observational and experimental data." International conference on machine learning. PMLR, 2022.
(W3) Lack of rigor in the paper.
The basic PN, PS, and PNS quantities are introduced, and given ample space. However, the key object of interest in the paper, PNS$(k)$, is simply cited from another paper, and appears only inline without a formal definition or interpretation. This is highly unusual, to not even write down the definition of the key object being investigated.
(W4) Notation could be much improved.
The choice of notation in the paper is really suboptimal. Theorems 2 & 4, Corollary 3 have massive subscripts in the summation, which makes the reading very difficult. The notation could be heavily compressed and improved, to foster readability.
(W5) The space in the paper is utilized modestly.
The paper has 9 pages, but these pages are utilized modestly. The expanded notation eats away huge amounts of space; preliminary work and known bounds are given a lot of space as well, whereas some of the load-bearing, key concepts for the paper are deferred to previous work.
(W6) Theorem 4 may have issues.
Firstly, saying that satisfies the backdoor criterion, and I assume this is with respect to the pair . However, if so, what about a bidirected arrow between W and Y, which makes untrue, since the bidirected W <--> Y can never be closed. This seems like it invalidates the theorem.
(W7) Experiments do not test the main claim.
The paper describes multi-valued , but focuses on binary data, a setting already handled in previous work. This makes the experiments less convincing.
Questions for authors
See weaknesses.