Estimating causal effects of time-dependent exposures on a binary endpoint in a high-dimensional setting
Vah\'e Asvatourian, Cl\'elia Coutzac, Nathalie Chaput, Caroline, Robert, Stefan Michiels, Emilie Lanoy

TL;DR
This paper extends the IDA method by developing a chronologically ordered PC-algorithm (COPC) to better estimate causal effects of time-dependent biomarkers on binary outcomes in high-dimensional data, improving accuracy and structural correctness.
Contribution
The paper introduces the COPC-algorithm, an extension of the PC-algorithm, to incorporate temporal order in high-dimensional causal inference with time-dependent exposures.
Findings
COPC-algorithm produces CPDAGs closer to the true causal structure.
Causal effect estimates are more accurate with COPC-algorithm.
CPDAGs from COPC-algorithm have fewer non-chronologic edges.
Abstract
Recently, the intervention calculus when the DAG is absent (IDA) method was developed to estimate lower bounds of causal effects from observational high-dimensional data. Originally it was introduced to assess the effect of baseline biomarkers which do not vary over time. However, in many clinical settings, measurements of biomarkers are repeated at fixed time points during treatment exposure and, therefore, this method need to be extended. The purpose of this paper is then to extend the first step of the IDA, the Peter Clarks (PC)-algorithm, to a time-dependent exposure in the context of a binary outcome. We generalised the PC-algorithm for taking into account the chronological order of repeated measurements of the exposure and propose to apply the IDA with our new version, the chronologically ordered PC-algorithm (COPC-algorithm). A simulation study has been performed before applying…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
