PFCI
Penalized Fast Causal Inference for High-Dimensional Structure Learning
Implements Penalized Fast Causal Inference (PFCI), a two-stage causal structure learning procedure for high-dimensional settings with potential latent variables and selection bias. In the first stage, neighborhood selection via the Lasso constructs a sparse undirected skeleton. In the second stage, the Fast Causal Inference (FCI) algorithm orients edges on this reduced graph, producing a Partial Ancestral Graph (PAG) that accounts for latent confounders. The method is consistent under sparsity assumptions and substantially faster than standard FCI and RFCI in high dimensions. See Pal, Ghosh, and Yang (2025) <doi:10.48550/arXiv.2507.00173> for the underlying theory.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.0 |
rolling linux/jammy R-4.5 | PFCI_0.1.0.tar.gz |
77.2 KiB |
0.1.0 |
rolling linux/noble R-4.5 | PFCI_0.1.0.tar.gz |
77.2 KiB |
0.1.0 |
rolling source/ R- | PFCI_0.1.0.tar.gz |
35.1 KiB |
0.1.0 |
latest linux/jammy R-4.5 | PFCI_0.1.0.tar.gz |
77.2 KiB |
0.1.0 |
latest linux/noble R-4.5 | PFCI_0.1.0.tar.gz |
77.2 KiB |
0.1.0 |
latest source/ R- | PFCI_0.1.0.tar.gz |
35.1 KiB |
0.1.0 |
2026-04-23 source/ R- | PFCI_0.1.0.tar.gz |
0 B |