fasttreeid
Identifies Parameters in a Tree-Shaped SCM
Implements the algorithm by Briefs and Bläser (2025) <https://openreview.net/forum?id=8PHOPPH35D>, based on the approach of Gupta and Bläser (2024) <doi:10.1609/aaai.v38i18.30023>. It determines, for a structural causal model (SCM) whose directed edges form a tree, whether each parameter is unidentifiable, 1-identifiable or 2-identifiable (other cases cannot occur), using a randomized algorithm with provable running time O(n^3 log^2 n).
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.1 |
rolling source/ R- | fasttreeid_1.0.1.tar.gz |
14.9 KiB |
1.0.1 |
latest source/ R- | fasttreeid_1.0.1.tar.gz |
14.9 KiB |
1.0.1 |
2026-04-23 source/ R- | fasttreeid_1.0.1.tar.gz |
14.9 KiB |
1.0.1 |
2026-04-09 windows/windows R-4.5 | fasttreeid_1.0.1.zip |
410.9 KiB |