GRACE-C: Generalized Rate Agnostic Causal Estimation via Constraints
Not on the map. Why?
Abstract (arXiv)
Graphical structures estimated by causal learning algorithms from time series data can provide misleading causal information if the causal timescale of the generating process fails to match the measurement timescale of the data. Existing algorithms provide limited resources to respond to this challenge, and so researchers must either use models that they know are likely misleading, or else forego causal learning entirely. Existing methods face up-to-four distinct shortfalls, as they might 1) require that the difference between causal and measurement timescales is known; 2) only handle very small number of random variables when the timescale difference is unknown; 3) only apply to pairs of variables; or 4) be unable to find a solution given statistical noise in the data. This research addresses these challenges. Our approach combines constraint programming with both theoretical insights into the problem structure and prior information about admissible causal interactions to achieve multiple orders of magnitude in speed-up. The resulting system maintains theoretical guarantees while scaling to significantly larger sets of random variables (>100) without knowledge of timescale differences. This method is also robust to edge misidentification and can use parametric connection strengths, while optionally finding the optimal solution among many possible ones.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 3 of its 36 references that are in the map. First posted on arXiv 18 May 2022.
Builds on
3 of 36 references.
References · 3
- 2020High-recall causal discovery for autocorrelated time series with latent confounderscited by 82
- 2020Constraint-Based Causal Discovery using Partial Ancestral Graphs in the presence of Cyclescited by 31
- 2013Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedurecited by 18
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.