Package edu.cmu.tetrad.algcomparison.algorithm.oracle.pag


package edu.cmu.tetrad.algcomparison.algorithm.oracle.pag
  • Classes
    Class
    Description
    Adjusts FGES-FCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.
    BFCI-Bryan: BOSS followed by the from-scratch, sepset-map-as-state formulation of the gated StarFCI extra-edge-removal step, with sepset RE-SELECTION (a gate-rejected separating set does not retire the pair; the next separating set is tried) and NO saturating step.
    BFCI-Bryan-Score: BFCI-Bryan (sepset re-selection under the legality gate) with a scoring step: a legal candidate is committed only if the RICF Gaussian BIC of its MAG strictly improves on the committed model's, following Bryan Andrews's "BFCI-Bryan with scoring" pseudocode.
    Adjusts FGES-FCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.
    Adjusts FGES-FCI to use a permutation algorithm (such as BOSS-Tuck) to do the initial steps of finding adjacencies and unshielded colliders.
    / Hidden from the interface on 2026-10-21 (no @Algorithm annotation): kept only so that saved sessions
    BOSS-CCD (Cyclic Causal Discovery with a BOSS adjacency superstructure).
    BOSS-FCI, the former name of BFCI.
    BOSS-POD, removed in Tetrad 8.0.0.
    CCD (Cyclic Causal Discovery)
    CFCI (Conservative FCI).
    Implements the CPW (Cyclic Pairwise) algorithm for causal discovery from continuous, causally sufficient observational data.
    Algorithm-comparison wrapper for the Murray-Watters/Glymour style Detect-Mimic search, DM.
    DM-FCIT, removed in Tetrad 8.0.0.
    DM-PC, removed in Tetrad 8.0.0.
    The Fast Causal Inference (FCI) algorithm.
    FCI-CPW: Run FCI with internally constructed PW-forbidden knowledge, then orient edges using a pairwise left-right rule on standardized data in cases that are safe under no-selection-bias cyclic semantics: Tail–tail (—) edges Orient per pairwise rule. Tail–circle (—o) edges If pairwise prefers x→y, set x→y (symmetrically, if prefers y→x, set y→x). Circle–circle (o–o) edges If pairwise prefers x→y, set x o→y (symmetrically for y→x).
    FCI-Max.
    This class represents the FCI Targeted Testing (FCIT) algorithm, which is variant of the *-FCI algorithm for learning causal structures from observational data using the BOSS algorithm as an initial CPDAG and using all score-based steps afterward.
    This class represents the FCI Targeted Testing (FCIT) algorithm, which is variant of the *-FCI algorithm for learning causal structures from observational data using the BOSS algorithm as an initial CPDAG and using all score-based steps afterward.
    This class represents the FCI Targeted Testing (FCIT) algorithm, which is variant of the *-FCI algorithm for learning causal structures from observational data using the BOSS algorithm as an initial CPDAG and using all score-based steps afterward.
    This class represents the FCI Targeted Testing (FCIT) algorithm, which is variant of the *-FCI algorithm for learning causal structures from observational data using the BOSS algorithm as an initial CPDAG and using all score-based steps afterward.
    FCIT-SL-Score-Check: the FCIT-SL algorithm with a MAG BIC SCORE CHECK applied to every candidate the search adjudicates.
    This class represents the FCI Targeted Testing (FCIT) algorithm, which is variant of the *-FCI algorithm for learning causal structures from observational data using the BOSS algorithm as an initial CPDAG and using all score-based steps afterward.
    The Fges-FCI class represents the Greedy Fast Causal Inference algorithm, adjusted as in *-FCI.
    The GFCI class represents the Greedy Fast Causal Inference algorithm, adjusted as in *-FCI.
    GMAS: a latent-variable search that uses no independence tests.
    GRaSP-FCI, an implentatation of *-FCI using GRaSP.
    The Iterative Causal Discovery (ICD) algorithm.
    IS-GFCI (Instance-Specific GFCI) wrapper for the algcomparison interface.
    Wrapper for LV-BOSS: the fully score-based latent-variable search that embeds a MAG projection inside a BOSS-style search over orders, scored by the exact RICF Gaussian MAG BIC (MagRicfBicScorer).
    This class represents the FCIT algorithm, which is an implementation of the FGES-FCI algorithm for learning causal structures from observational data using the BOSS algorithm as an initial CPDAG and using all score-based steps afterward.
    PAG-Sampling-RFCI, the former name of the class now called PagSamplingRfci.
    Jan 29, 2023 3:45:09 PM
    RFCI.
    Runs RFCI-BSC, which is RFCI with bootstrap sampling of PAGs.
    Adjusts GFCI to use a permutation algorithm (in this case SP) to do the initial steps of finding adjacencies and unshielded colliders.