Research map / Probabilistic and scientific modeling / Causal discovery
From Temporal to Contemporaneous Iterative Causal Discovery in the Presence of Latent Confounders
Raanan Yehezkel Rohekar, Shami Nisimov, Yaniv Gurwicz, Gal Novik
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Refine temporal relations before contemporaneous relations, testing longer lags first (ablation) | TS-ICD · Binary time-series | Causal accuracy: 0.2158 -> 0.2321; 0.2080 -> 0.2321 | Improved |
| Refine temporal relations before contemporaneous relations, testing longer lags first (ablation) | TS-ICD · Binary time-series | CI tests: 388 -> 371; 413 -> 371 | Improved |
| Change the CI-test ordering to random (ablation) | TS-ICD · Binary time-series | Skeleton F1: 0.4744 -> 0.4744 | No clear effect |
| Change the CI-test ordering to swapped, with contemporaneous edges first (ablation) | TS-ICD · Binary time-series | Skeleton F1: 0.4744 -> 0.4744 | No clear effect |
| Use TS-ICD's temporal-first ordering rather than competing algorithms' orderings | Causal discovery algorithms · Binary time series | Skeleton F1: 0.3602 -> 0.4744; 0.2740 -> 0.4744 | Improved |
| Use TS-ICD's temporal-first ordering rather than competing algorithms' orderings | Causal discovery algorithms · Binary time series | CI tests: 554 -> 371; 550 -> 371; 1351 -> 371 | Improved |
| Use TS-ICD on larger graphs instead of LPCMCI | Causal discovery algorithms · 90-node linear-Gaussian graphs | Causal accuracy: 0.16 -> 0.21 | Improved |
| Use TS-ICD on larger graphs instead of LPCMCI | Causal discovery algorithms · 90-node linear-Gaussian graphs | CI tests: 11164 -> 8704 | Improved |
| Use TS-ICD instead of LPCMCI | Causal discovery algorithms · Linear-Gaussian time series | Causal accuracy: 0.2948 -> 0.2500 | Hurt |
| Use TS-ICD instead of LPCMCI | Causal discovery algorithms · Linear-Gaussian time series | CI tests: 1192 -> 875 | Improved |
| Use TS-ICD instead of SVAR-FCI or LPCMCI | Causal discovery algorithms · Binary time series | Causal accuracy: 0.2014 -> 0.2321; 0.1443 -> 0.2321 | Improved |
Closest papers by meaning
- Learning Causal Relations from Subsampled Time Series with Two Time-Slices (ICML 2024 · similarity 0.91)
- Local Identifying Causal Relations in the Presence of Latent Variables (ICML 2025 · similarity 0.91)
- Discovering Mixtures of Structural Causal Models from Time Series Data (ICML 2024 · similarity 0.90)
- Differentiable Causal Discovery for Latent Hierarchical Causal Models (ICLR 2025 · similarity 0.90)
- Causal learning with the invariance principle (NeurIPS 2026 · similarity 0.90)
- CausalTab: Pretraining Across Causal Environments for Tabular Causal Discovery (NeurIPS 2026 · similarity 0.90)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
