Choosing an Algorithmο
A curated guide to the algorithms most Tetrad users should start with.
Tetrad provides many structure-learning algorithms. This short list highlights the most recommended ones, with crisp summaries and links to full per-algorithm pages.
If youβre new to Tetrad, start here.
π Choosing an Algorithmο
Most users choose between:
DAG/CPDAG algorithms (assume no hidden confounders)
PAG algorithms (allow hidden confounders and selection bias)
A quick rule of thumb:
No hidden confounders β Use DAG/CPDAG methods
(FGES, BOSS, PC, PC-Max)Hidden confounders possible β Use PAG methods
(FCI, GFCI, BFCI, FCIT)
π§ Recommended Algorithms (At a Glance)ο
This section lists the top algorithms most users should consider first.
π DAG / CPDAG Methods (No Latent Confounders)ο
PC β PeterβClark Algorithm
π Constraint-based β’ ποΈ Ξ±-controlled β’ Output: CPDAG
Removes edges using CI tests and orients them using collider and propagation rules. A classic method offering explicit statistical control via Ξ±.
β Full page: PC
PC-Max
π Constraint-based β’ ποΈ Ξ±-controlled β’ Output: CPDAG
Variant of PC that selects separating sets with maximum p-value, improving orientation accuracy.
β Full page: PC-Max
FGES β Fast Greedy Equivalence Search
π Score-based β’ β‘ Highly scalable β’ Output: CPDAG
Greedy forwardβbackward search optimizing BIC. Very fast and scalable; a strong general-purpose default.
β Full page: FGES
BOSS β Best Order Score Search
π Score-based β’ π― Order-based β’ Output: CPDAG
Searches over variable orders and uses GrowβShrink Trees to score efficiently; often produces sharper orientations than FGES.
β Full page: BOSS
π§ Other Useful Algorithm Classesο
Several other methods specialize in:
Orientation only (FASK, LOFS, skew-based methods)
Non-Gaussian structure (LiNGAM, ICA-based models)
Time-series (PCMCI)
Markov blankets
Deterministic relations
These are powerful in the right contexts but are not typical starting points.
β See full catalog: Full Algorithm List
π Choosing CI Tests & Scores (Quick Guide)ο
Continuous (Gaussian-ish): Fisher Z, SEM-BIC
Discrete: G-test or Chi-square; BDeu/BIC
Mixed or nonlinear: KCI / RCIT (slower), basis-function methods (scalable)
Covariance-only datasets: Use methods accepting covariance matrices (e.g., BOSS, FGES)
β οΈ Common Pitfalls and Fixesο
Graph too dense: lower Ξ± (PC/FCI) or increase penalty (FGES/BOSS)
Graph too sparse: raise Ξ± or decrease penalty
Odd orientations: try PC-Max, BOSS, or minimal prior knowledge
Slow runtime: limit depth; use RFCI or FCIT; increase threads