Pith. sign in

REVIEW 3 cited by

Improving Finite Sample Performance of Causal Discovery by Exploiting Temporal Structure

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.19503 v1 pith:HVWTUDZJ submitted 2024-06-27 stat.ME stat.ML

classification stat.MEstat.ML
keywords algorithmcausaldatabackgroundcohortdiscoveryefficientlyerrors
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Methods of causal discovery aim to identify causal structures in a data driven way. Existing algorithms are known to be unstable and sensitive to statistical errors, and are therefore rarely used with biomedical or epidemiological data. We present an algorithm that efficiently exploits temporal structure, so-called tiered background knowledge, for estimating causal structures. Tiered background knowledge is readily available from, e.g., cohort or registry data. When used efficiently it renders the algorithm more robust to statistical errors and ultimately increases accuracy in finite samples. We describe the algorithm and illustrate how it proceeds. Moreover, we offer formal proofs as well as examples of desirable properties of the algorithm, which we demonstrate empirically in an extensive simulation study. To illustrate its usefulness in practice, we apply the algorithm to data from a children's cohort study investigating the interplay of diet, physical activity and other lifestyle factors for health outcomes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Score-Based Causal Discovery with Temporal Background Information

    stat.ME 2025-02 conditional novelty 6.0 of 10

    TGES extends greedy equivalence search with tiered background knowledge and is proven sound and complete in the large sample limit, while improving finite-sample recall over temporal PC.

  2. Are you doing better than random guessing? A call for using negative controls when evaluating causal discovery algorithms

    stat.ME 2024-12 accept novelty 6.0 of 10

    Causal discovery evaluations should report negative control baselines, because common metrics can look good under random guessing.

  3. Integrating Background Knowledge for Scalable Causal Discovery

    stat.ML 2026-07 accept novelty 5.0 of 10

    Integrating adjacency, orientation, and gap background knowledge during PC, SNAP, MB-by-MB, LDECC, and LOAD reduces CI tests and improves causal-effect estimates under standard assumptions.

Pith tools