Raanan Rohekar, Yaniv Gurwicz, Shami Nisimov, Gal Novik
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. If it links a repository, it is listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We present a constraint-based algorithm for learning causal structures from observational timeseries data, in the presence of latent confounders. We assume a discrete-time, stationary structural vector autoregressive process, with both temporal and contemporaneous causal relations. One may ask if temporal and contemporaneous relations should be treated differently. The presented algorithm gradually refines a causal graph by learning long-term temporal relations before shortterm ones, where contemporaneous relations are learned last. This ordering of causal relations to be learnt leads to a reduction in the required number of statistical tests. We validate this reduction empirically and demonstrate that it leads to higher accuracy for synthetic data and more plausible causal graphs for real-world data compared to state-of-the-art algorithms.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2306.00624")
get_code_for_paper("2306.00624")
have("2306.00624")
Connect an agent — have() is free.