Tetrad Manual
  • About
    • 📚 Project Background
    • 👥 Contributors
    • 📄 Papers and Books
    • 📬 Questions or Suggestions?
  • Quickstart
    • 1. Add a Data or Simulation Box
      • Option A — Load data
      • Option B — Simulate data
    • 2. (Optional) Add Prior Knowledge
    • 3. Run a Causal Search
    • 4. View and Edit the Graph
    • 5. Save and Export
  • Workflows
    • Causal Analysis Workflows
      • 🧭 What You’ll Learn
      • 📌 Why a Workflow Matters
      • 🗺️ How the Workflow Is Organized
      • 🧠 Practical Advice Before You Begin
      • 🙌 Where to Start
    • Data Exploration: Understanding Your Data Before Causal Discovery
      • 1. Load and Inspect Your Data
      • 2. Review Variable Types
      • 3. Examine Marginal Distributions with Histograms
      • 4. Explore Pairwise Relationships with the Plot Matrix
      • 5. Consider Linearity and Gaussianity (Informally)
      • 6. Reflect on Causal Sufficiency and Latent Variables
      • 7. Clarify Your Modeling Goals
      • 8. Moving Forward
      • Practical Notes
    • Algorithm Selection and Assumptions
      • What This Page Covers
      • 1. Which Assumptions Matter?
        • 1.1. Causal Sufficiency
        • 1.2. Functional Form and Distribution
        • 1.3. Modeling Goal
        • 1.4. Sample Size and Dimensionality
      • 2. Major Algorithm Families in Tetrad
        • 2.1. Constraint-Based Methods
        • 2.2. Score-Based Methods
        • 2.3. Hybrid Methods
        • 2.4 Time Series Data (Lagged Variables)
      • 3. Mapping Assumptions to Starting Choices
      • 4. Choosing Tests and Scores
        • 4.1. Independence Tests
        • 4.2. Scores
      • 5. What If You’re Unsure?
      • 6. Using Grid Search Effectively
      • 7. Summary
      • 🧭 Next Step
    • Manual Exploration: Try Searches Interactively
      • Why Use Manual Exploration?
      • When Manual Exploration Is Useful
      • Pipelines: The Interactive Workflow
      • Building a Simple Pipeline
      • Examples of Manual Exploration
        • A. Varying Test Sensitivity
        • B. Comparing Algorithms
        • C. Adding Background Knowledge
        • D. Exploring Nonlinearity or Non-Gaussianity
      • Inspecting Results
      • How Manual Exploration Leads to Grid Search
      • Tips for Effective Manual Exploration
      • Summary
      • 🧭 Next Step
    • Running Searches and Grid Search Tips
      • Why Use Grid Search?
      • From Single Runs to Systematic Search
      • Running a Basic Search
      • What to Sweep in Grid Search
        • 1. Significance Level (α) — Test-Based Methods
        • 2. Penalty or Discount — Score-Based Methods
        • 3. Algorithm Choice
        • 4. Tests and Scores
      • Interpreting Grid Search Results
        • 1. Markov Consistency
        • 2. Model Complexity
      • A Practical Starter Pattern
      • Reading Grid Search Output
      • Common Pitfalls to Avoid
        • Sweeping Too Many Parameters at Once
        • Changing Background Knowledge Too Early
        • Delaying Diagnostics
        • Not Recording What Was Tried
      • Where Grid Search Fits in the Workflow
      • 🧭 Next Step
    • Model Evaluation and Markov Checking
      • Why Model Evaluation Matters
      • What the Markov Checker Does
        • Intuition
      • Running the Markov Checker in Tetrad
      • Interpreting Markov Checker Output
        • Key Outputs
        • How to Read the Results
      • Minimal Markov-Consistent Models
      • Comparing Models from Grid Search
      • Important Caveats
        • Markov Checking Is Not a Proof
        • Test Choice Matters
        • Sampling Variability Exists
      • Beyond Markov Checking
      • Practical Tips
      • Summary
      • 🧭 Next Step
    • Interpreting Results
      • 1. What a Discovered Graph Represents
      • 2. Types of Output and Their Meaning
        • 2.1 Fully Directed Acyclic Graphs (DAGs)
        • 2.2 Completed Partially Directed Acyclic Graphs (CPDAGs)
        • 2.3 Partial Ancestral Graphs (PAGs)
      • 3. Interpreting Common Edge Marks
      • 4. Robustness and Stability
      • 5. What You Can Say (With Care)
      • 6. What You Should Avoid Saying Unqualified
      • 7. Using Background Knowledge
      • 8. Communicating Uncertainty Clearly
      • 9. Documenting Your Analysis
      • 10. Summary
      • 🧭 What’s Next
    • Example: Auto MPG Analysis with Grid Search
      • 1. The Auto MPG Dataset
        • Data Preparation
      • 2. Loading and Exploring the Data in Tetrad
        • Visual Exploration
      • 3. Algorithm Choice and Assumptions
        • Causal Sufficiency
        • Algorithm: BOSS
        • Score: Degenerate Gaussian BIC
      • 4. Setting Up the Grid Search
        • Step 1: Connect the Data
        • Step 2: Algorithms Tab
        • Step 3: Table Columns Tab
        • Step 4: Comparison Tab (Initial Setup)
        • Step 5: Set Parameter Ranges
      • 5. Running the Comparison
      • 6. Interpreting the Comparison Results
        • Choosing a Model
      • 7. Viewing the Selected Graph
      • 8. What This Example Illustrates
      • 9. Next Steps
    • Example: Auto MPG Analysis with Grid Search (Extended)
      • 1. The Auto MPG Dataset
        • Data Preparation
      • 2. Loading and Exploring the Data in Tetrad
        • Visual Exploration
      • 3. Algorithm Choice and Assumptions
        • Causal Sufficiency
        • Algorithm: BOSS
        • Score: Degenerate Gaussian BIC
      • 4. Setting Up and Running the Grid Search
      • 5. Choosing a Representative DAG
      • 6. Parameter Estimation with the Hybrid CG Estimator
        • Example: Horsepower → Acceleration
      • 7. Interpreting “Acceleration” in the Auto MPG Data
      • 8. Cross-Checking with Adjustment Total Effects
      • 9. What This Extended Example Illustrates
      • 10. Summary
    • Example: Auto MPG Analysis with Grid Search
      • 1. The Auto MPG Dataset
        • Data Preparation
      • 2. Loading and Exploring the Data in Tetrad
        • Visual Exploration
      • 3. Algorithm Choice and Assumptions
        • Causal Sufficiency
        • Algorithm: BOSS
        • Score: Degenerate Gaussian BIC
      • 4. Setting Up the Grid Search
        • Step 1: Connect the Data
        • Step 2: Algorithms Tab
        • Step 3: Table Columns Tab
        • Step 4: Comparison Tab (Initial Setup)
        • Step 5: Set Parameter Ranges
      • 5. Running the Comparison
      • 6. Interpreting the Comparison Results
        • Choosing a Model
      • 7. Viewing the Selected Graph
      • 8. What This Example Illustrates
      • 9. Next Steps
      • Extension: Parameter Estimation with Mixed Data (Hybrid CG)
        • Hybrid CG Estimation Workflow
      • Example: Horsepower → Acceleration
      • Interpreting the Acceleration Variable
      • Extension: Adjustment and Total Causal Effects
        • Adjustment Workflow
      • What These Extensions Demonstrate
  • Tetrad Interface
    • Overview
      • Main Window
        • Sessions
        • The box palette
        • The workbench
        • Menus
        • Settings
        • Logging pane
      • Working with Data
        • Importing data
        • Viewing and editing data
        • Linking data and graphs
        • Saving and exporting data
      • Running Algorithms
        • Launching a search
        • Choosing tests and scores
        • Setting parameters
        • Running and monitoring
        • Re-running with modified settings
      • Graph Editor
        • Opening and creating graphs
        • Basic editing operations
        • Layout and visualization
        • Background knowledge and tiers
        • Saving and exporting graphs
      • Viewing and Exporting Results
        • Graph results
        • Tabular and numeric results
        • Exporting graphs and tables
        • Reusing results in pipelines
      • Estimate model parameters
        • Basic workflow
        • Inspecting the fitted model
        • Relationship to graphs and search
        • Where to look next
      • Simulation and Utilities
        • Simulating data on the workbench
        • Resampling and bootstrap workflows
        • Grid Search (overview)
        • Other utilities
    • Box by Box
      • Data Box
        • Purpose
        • Typical workflow
        • Key controls
        • Common patterns & tips
        • Related pages
      • Knowledge Box
        • Purpose
        • Typical workflow
        • Key controls
        • Common patterns & tips
        • Related pages
      • Search Box
        • Purpose
        • Wizard workflow
        • Connecting data, knowledge, and outputs
        • Common patterns & tips
        • Related pages
      • Latent Clusters Box
        • Purpose
        • Typical workflow
        • Key controls
        • Common patterns & tips
        • Related pages
      • Graph Box
        • Purpose
        • Typical workflow
        • Key controls
        • Common patterns & tips
        • Related pages
      • Compare Box
        • Purpose
        • Typical workflow
        • Types of comparisons
        • Key controls
        • Common patterns & tips
        • Related pages
      • Parametric Model Box
        • Purpose
        • Typical workflow
        • Key controls
        • Common patterns & tips
        • Related pages
      • Estimator Box
        • Purpose
        • Typical workflow
        • Key controls
        • Common patterns & tips
        • Estimator types and detail pages
        • Related pages
      • Updater Box
        • Purpose
        • Typical workflow
        • Updater types and detail pages
        • Connecting the Updater with other boxes
        • Common patterns & tips
        • Related pages
      • Regression box
        • Multiple Linear Regression
        • Logistic Regression
        • Adjustment Total Effects
        • IDA Check
        • Interpretation and workflow notes
        • Summary
      • Instantiated Model Box
        • Purpose
        • Typical workflow
        • Key controls
        • Common patterns & tips
        • Related pages
      • Simulation Box
        • Purpose
        • Simulation setup
        • Running a simulation
        • Using simulated graphs and data in other boxes
        • Common patterns & tips
        • Related pages
      • Grid Search Box (Data)
        • Purpose of Data-Based Grid Search
        • When This Mode Is Used
        • Basic Setup
        • Algorithms Tab
        • Table Columns Tab
        • Comparison Tab
        • Interpreting Results
        • View Graphs Tab
        • Notes and Best Practices
        • Summary
      • Grid Search (Simulation)
        • When to Use Simulation-Based Grid Search
        • Key Difference from Data-Based Grid Search
        • Step 1: Select a Simulation
        • Step 2: Algorithms Tab
        • Step 3: Table Columns Tab
        • Step 4: Comparison Tab
        • Step 5: Run Counts and Randomness
        • Running the Comparison
        • Interpreting Simulation Results
        • Common Pitfalls
        • Summary
        • 🧭 Next Steps
      • Note Box
        • Purpose
        • Typical workflow
        • Key controls
        • Common patterns & tips
        • Related pages
      • Latent Structure Box (removed)
        • Where its searches went
        • Opening an older session
        • Related pages
    • Data Preparation
      • Where data preparation happens in Tetrad
      • Typical data preparation workflow
      • What the rest of this section covers
      • Start with the Data Audit
      • When one dataset holds more than one mechanism
        • Data Audit
        • Causal Unmix
    • Detail Callouts
      • Data box
        • Data subset / resample
        • Detail: Nonlinearity Checks
        • Detail: N-tad Explorer
      • Search box
        • Detail: Bootstrapping and Ensemble Graphs
      • Graph box
        • Detail: Graph Menu (Graph Box)
        • Detail: Display Subgraphs
      • Compare box
        • Detail: Markov Checker
        • Detail: Vertex Checker
      • Parametric Model box
        • Detail: Parametric & Instantiated Model Types
        • Detail: Bayes (Multinomial) Parametric Model
        • Detail: SEM (Linear) Parametric Model
        • Detail: Hybrid (Conditional Gaussian) Parametric Model
        • Detail: Generalized Parametric Model
      • Estimator box
        • Detail: ML Bayes Estimator
        • Detail: Dirichlet Estimator
        • Detail: EM Bayes Estimator
        • Detail: SEM (Linear) Estimator
        • Detail: Hybrid CG Estimator
        • Detail: NN Estimator
        • Detail: Generalized SEM Estimator
      • Updater box
        • Detail: Junction Tree Updater
        • Detail: Approximate Updater
        • Detail: Row Summing Updater
        • Detail: SEM Updater
      • Regression box
        • Detail: Adjustment and Total Effects: Amenability and Discrete Variables
        • Detail: IDA Check (Regression box)
      • Instantiated Model box
        • Detail: Bayes (Multinomial) Instantiated Model
        • Detail: SEM (Linear) Instantiated Model
        • Detail: Hybrid (Conditional Gaussian) Instantiated Model
        • Detail: Generalized Instantiated Model
      • Simulation box
        • Detail: Simulation types
  • Python and R Bindings
    • py-tetrad (Python Binding)
    • rpy-tetrad (R Binding)
    • When to Use These Bindings
    • Related Python Ecosystem Tools
      • Relationship to Tetrad
      • Recommendation
  • Graphs and DataSets
    • Graph Types and Formats
      • 1. Core Graph Types in Tetrad
        • 1.1 DAG — Directed Acyclic Graph
        • 1.2 CPDAG — Completed Partially Directed Acyclic Graph
        • 1.3 MAG — Maximal Ancestral Graph
        • 1.4 PAG — Partial Ancestral Graph
      • 2. Endpoint Marking System
      • 3. PAG Edge-Specialization Markup (Optional GUI Feature)
        • 3.1 Two Independent Attributes
        • (A) Visibility
        • (B) Directness
        • 3.2 The Four Directed-Edge Types
        • 3.3 Undirected Edges Represent Selection Bias
      • 4. Saving and Loading Graphs
        • 4.1 Conceptual Plain-Text Format
      • 5. Graphs and Data: Name Matching
      • 6. Summary
    • Data Types and Formats
      • 1. Overview of Supported Formats
      • 2. Dataset Format (Tabular Data)
        • Notes
      • 3. Discrete Data
      • 4. Continuous Data
      • 5. Covariance and Correlation Matrices
        • 5.1 Required Structure
        • 5.2 Lower Triangle Covariance Matrix Example
        • 5.3 Full Square Covariance Matrix Example (Current Default)
        • 5.4 Correlation Matrices
        • 5.5 Common Parsing Errors for Covariance/Correlation Files
      • 6. Lower-Triangular Format
        • 6.1 Note on GUI Display
      • 7. Exporting Data from Tetrad
      • 8. Summary
  • Search Algorithms
    • Choosing an Algorithm
      • 🔍 Choosing an Algorithm
      • 🧭 Recommended Algorithms (At a Glance)
      • 🔍 DAG / CPDAG Methods (No Latent Confounders)
      • 🌀 PAG Methods (Hidden Confounders Allowed)
      • 🔧 Other Useful Algorithm Classes
      • 🎛 Choosing CI Tests & Scores (Quick Guide)
      • ⚠️ Common Pitfalls and Fixes
    • Search Algorithms — By Type
      • Legend — Algorithm Categories
        • Extra Structural Badges
      • 🔍 Constraint-Based Algorithms (CPDAG / PAG)
      • 📏 Score-Based Algorithms (CPDAG)
      • 🌀 Hybrid Algorithms (Score + FCI)
      • 🎨 Non-Gaussian, Moment-Based, and Orientation Algorithms
      • Nonlinear & Distribution-Shift Algorithms
      • 📦 Stability / Resampling / Ensemble Wrappers
      • 🧪 Specialized / Utility Algorithms
      • Latent Clustering (Measurement Block Discovery)
      • Latent Structure / Measurement-Model Construction
    • Search Algorithms — Alphabetical
      • 1. BFCI — Best-Order Score Search + FCI Refinement
        • 1.1. Key Idea
        • 1.2. When to Use
        • 1.3. Strengths
        • 1.4. Limitations
        • 1.5. How It Differs From Related Algorithms
        • 1.6. Prior Knowledge Support
        • 1.7. Key Parameters in Tetrad
        • 1.8. Reference
        • 1.9. Summary
      • 2. BOSS — Best Order Score Search
        • 2.1. Key idea
        • 2.2. When to use
        • 2.3. How it works (at a glance)
        • 2.4. Strengths
        • 2.5. Limitations
        • 2.6. How it relates to other Tetrad algorithms
        • 2.7. Prior knowledge support
        • 2.8. Parameters
        • 2.9. Reference
        • 2.10. Summary
      • 3. BPC — Build Pure Clusters
        • 3.1. Basic Assumptions
        • 3.2. High-Level Algorithm
        • 3.3. Output and Interpretation
        • 3.4. Parameters in Tetrad
        • 3.5. Strengths
        • 3.6. Limitations
        • 3.7. Reference
        • 3.8. Summary
      • 4. CAM — Causal Additive Model
        • 4.1. Key Idea
        • 4.2. When to Use CAM
        • 4.3. Prior Knowledge Support
        • 4.4. Strengths
        • 4.5. Limitations
        • 4.6. Key Parameters in Tetrad
        • 4.7. Reference
        • 4.8. Summary
      • 5. CCD — Cyclic Causal Discovery
        • 5.1. Key Idea
        • 5.2. When to Use
        • 5.3. Prior Knowledge Support
        • 5.4. Strengths
        • 5.5. Limitations
        • 5.6. Key Parameters in Tetrad
        • 5.7. Reference
        • 5.8. Summary
      • 6. CD-NOD-BOSS
      • 7. CD-NOD — Causal Discovery from Nonstationary / Distribution-Shifted Data
        • 7.1. Key Idea
        • 7.2. When to Use
        • 7.3. Prior Knowledge Support
        • 7.4. Strengths
        • 7.5. Limitations
        • 7.6. Key Parameters in Tetrad / Scripting
        • 7.7. Reference
        • 7.8. Summary
      • 8. CFCI
      • 9. Conservative PC (CPC) — Conservative Collider Orientation
        • 9.1. Key Idea
        • 9.2. When to Use
        • 9.3. Prior Knowledge Support
        • 9.4. Strengths
        • 9.5. Limitations
        • 9.6. Key Parameters in Tetrad
        • 9.7. Reference
        • 9.8. Summary
      • 10. CStaR (Causal Stability Ranking)
        • 10.1. High-level idea
        • 10.2. Inputs
        • 10.3. Outputs
        • 10.4. Parameters
        • 10.5. When to use CStaR
        • 10.6. References
        • 10.7. Summary
      • 11. DAGMA — Learning DAGs via M-Matrices and Log-Determinant Acyclicity
        • 11.1. Key Idea
        • 11.2. When to Use
        • 11.3. Prior Knowledge Support
        • 11.4. Strengths
        • 11.5. Limitations
        • 11.6. Key Parameters in Tetrad
        • 11.7. Reference
        • 11.8. Summary
      • 12. DirectLiNGAM
        • 12.1. Key Idea
        • 12.2. When to Use
        • 12.3. Prior Knowledge Support
        • 12.4. Strengths
        • 12.5. Limitations
        • 12.6. Key Parameters in Tetrad
        • 12.7. Reference
        • 12.8. Summary
      • 13. Factor Analysis
        • 13.1. Purpose
        • 13.2. When to Use
        • 13.3. How It Works (Conceptual)
        • 13.4. Strengths
        • 13.5. Limitations
        • 13.6. Relation to Other Latent Tools
        • 13.7. References
        • 13.8. Summary
      • 14. FAS — Fast Adjacency Search
        • 14.1. Key Idea
        • 14.2. When to Use
        • 14.3. Case Study: High-dimensional fMRI Preprocessing
        • 14.4. Prior Knowledge Support
        • 14.5. Strengths
        • 14.6. Limitations
        • 14.7. Key Parameters in Tetrad
        • 14.8. Reference
        • 14.9. Summary
      • 15. FASK — Fast Adjacency Skewness
        • 15.1. Key Idea
        • 15.2. When to Use
        • 15.3. Prior Knowledge Support
        • 15.4. Strengths
        • 15.5. Limitations
        • 15.6. Key Parameters in Tetrad
        • 15.7. Reference
        • 15.8. Summary
      • 16. FASK-Vote — Multi-Dataset FASK Voting over IMaGES
        • 16.1. Key Idea
        • 16.2. When to Use
        • 16.3. Prior Knowledge Support
        • 16.4. Strengths
        • 16.5. Limitations
        • 16.6. ImagES Parameters
        • 16.7. FASK Parameters
        • 16.8. Reference
        • 16.9. Summary
      • 17. FCI — Fast Causal Inference
        • 17.1. Key idea
        • 17.2. When to use FCI
        • 17.3. Assumptions
        • 17.4. How it works (at a glance)
        • 17.5. How it relates to other Tetrad algorithms
        • 17.6. Strengths
        • 17.7. Limitations
        • 17.8. Prior knowledge
        • 17.9. Key parameters in Tetrad
        • 17.10. References
      • 18. FCI-Max
      • 19. FCIT — FCI with Targeted Testing
        • 19.1. Key Idea
        • 19.2. When to Use
        • 19.3. Strengths
        • 19.4. Limitations
        • 19.5. How It Differs From Related Algorithms
        • 19.6. Prior Knowledge Support
        • 19.7. Key Parameters in Tetrad
        • 19.8. Reference
        • 19.9. Summary
      • 20. FGES — Fast Greedy Equivalence Search
        • 20.1. Key Idea
        • 20.2. A Nuanced View of Scalability and Sparsity
        • 20.3. When to Use FGES
        • 20.4. Prior Knowledge Support
        • 20.5. Strengths
        • 20.6. Limitations
        • 20.7. Key Parameters in Tetrad
        • 20.8. Reference
        • 20.9. Summary
      • 21. FGES-MB — FGES Markov Blanket Search
        • 21.1. Key idea
        • 21.2. When to use FgesMb
        • 21.3. Prior knowledge support
        • 21.4. Strengths
        • 21.5. Limitations
        • 21.6. Key parameters in Tetrad
        • 21.7. Reference
        • 21.8. Summary
      • 22. FLOP
      • 23. FOFC — Find One-Factor Clusters
        • 23.1. Key Idea
        • 23.2. When to Use
        • 23.3. Prior Knowledge Support
        • 23.4. Strengths
        • 23.5. Limitations
        • 23.6. Key Parameters in Tetrad
        • 23.7. Reference
        • 23.8. Summary
      • 24. FTFC — Find Two-Factor Clusters (Sextad-Based)
        • 24.1. Key Idea
        • 24.2. Relation to FOFC and GFFC
        • 24.3. When to Use FTFC
        • 24.4. Strengths
        • 24.5. Limitations
        • 24.6. Parameters in Tetrad
        • 24.7. Reference
        • 24.8. Summary
      • 25. GFCI — Greedy Fast Causal Inference
        • 25.1. 🔍 Key Idea
        • 25.2. 🎯 When to Use GFCI
        • 25.3. 🧠 Prior Knowledge
        • 25.4. ⭐ Strengths
        • 25.5. ⚠️ Limitations
        • 25.6. 🔧 Key Parameters (Tetrad)
        • 25.7. ⛓ Relation to Other Algorithms
        • 25.8. 📚 Reference
      • 26. GFFC — Generalized Find Factor Clusters
        • 26.1. Key Idea
        • 26.2. Algorithm Overview
        • 26.3. Why Use GFFC?
        • 26.4. Strengths
        • 26.5. Limitations
        • 26.6. Parameters in Tetrad
        • 26.7. Reference
        • 26.8. Summary
      • 27. GRaSP — Greedy Relaxations of the Sparsest Permutation
        • 27.1. Key idea
        • 27.2. When to use
        • 27.3. How it works (at a glance)
        • 27.4. Strengths
        • 27.5. Limitations
        • 27.6. How it relates to other Tetrad algorithms
        • 27.7. Prior knowledge support
        • 27.8. Key parameters in Tetrad
        • 27.9. Reference
        • 27.10. Summary
      • 28. GRaSP-FCI — Greedy Relaxations of Sparsest Permutation + FCI Refinement
        • 28.1. Key Idea
        • 28.2. When to Use
        • 28.3. Strengths
        • 28.4. Limitations
        • 28.5. How It Differs From Related Algorithms
        • 28.6. Prior Knowledge Support
        • 28.7. Key Parameters in Tetrad
        • 28.8. Reference
        • 28.9. Summary
      • 29. IMaGES — Pooled Multi-Dataset Scoring
        • 29.1. How to use it
        • 29.2. What the pooled score is
        • 29.3. When pooling is the right choice
        • 29.4. Assumptions and limits
        • 29.5. Prior knowledge
        • 29.6. Reference
        • 29.7. Summary
      • 30. IOD — FCI with Independent Overlapping Datasets
        • 30.1. Key Idea
        • 30.2. When to Use
        • 30.3. Prior Knowledge Support
        • 30.4. Strengths
        • 30.5. Limitations
        • 30.6. Key Parameters in Tetrad
        • 30.7. Reference
        • 30.8. Summary
      • 31. ION
      • 32. Latent Clusters
        • 32.1. Key Idea
        • 32.2. When to Use
        • 32.3. Prior Knowledge Support
        • 32.4. Strengths
        • 32.5. Limitations
        • 32.6. Latent Cluster Algorithms in Tetrad
        • 32.7. Relationship to Latent Structure Algorithms
        • 32.8. Summary
      • 33. LiNG-D — Cyclic LiNGAM (Lacerda et al.)
        • 33.1. Key Idea
        • 33.2. When to Use
        • 33.3. Prior Knowledge Support
        • 33.4. Strengths
        • 33.5. Limitations
        • 33.6. Key Parameters in Tetrad
        • 33.7. Reference
        • 33.8. Summary
      • 34. LiNGAM — ICA-Based LiNGAM
        • 34.1. Key Idea
        • 34.2. When to Use
        • 34.3. Prior Knowledge Support
        • 34.4. Strengths
        • 34.5. Limitations
        • 34.6. Key Parameters in Tetrad
        • 34.7. Reference
        • 34.8. Summary
      • 35. LV-Heuristic — Heuristic Latent-Variable PAG from a Single DAG
        • 35.1. What LV-Heuristic Is (and Is Not)
        • 35.2. Key Idea
        • 35.3. When to Use LV-Heuristic
        • 35.4. Strengths
        • 35.5. Limitations
        • 35.6. How LV-Heuristic Differs From Other Mixed-Strategy Algorithms
        • 35.7. Prior Knowledge Support
        • 35.8. Key Parameters in Tetrad
        • 35.9. Reference
        • 35.10. Summary
      • 36. Mimbuild Bollen
        • 36.1. Purpose
        • 36.2. How It Works (Conceptual)
        • 36.3. Strengths
        • 36.4. Limitations
        • 36.5. Relation to Other Latent Tools
        • 36.6. References
        • 36.7. Summary
      • 37. Mimbuild PCA
        • 37.1. Purpose
        • 37.2. How It Works (Conceptual)
        • 37.3. Strengths
        • 37.4. Limitations
        • 37.5. Relation to Other Latent Tools
        • 37.6. References
        • 37.7. Summary
      • 38. PagSamplingRfci
        • 38.1. Key Idea
        • 38.2. When to Use
        • 38.3. Prior Knowledge Support
        • 38.4. Strengths
        • 38.5. Limitations
        • 38.6. Key Parameters in Tetrad
        • 38.7. Reference
        • 38.8. Summary
      • 39. Pairwise Orientation Methods — FaskPw & RSkew
        • 39.1. Overview
        • 39.2. FaskPw — FASK Pairwise Left–Right Orientation
        • 39.3. Key Idea
        • 39.4. When to Use
        • 39.5. Strengths
        • 39.6. Limitations
        • 39.7. Parameters in Tetrad
        • 39.8. RSkew — Robust Skewness Orientation (Hyvärinen & Smith, 2013)
        • 39.9. Key Idea (informal)
        • 39.10. When to Use
        • 39.11. Strengths
        • 39.12. Limitations
        • 39.13. Parameters in Tetrad
        • 39.14. Prior Knowledge Support
        • 39.15. Summary
      • 40. PC — Peter–Clark Algorithm
        • 40.1. Key Idea
        • 40.2. When to Use
        • 40.3. Prior Knowledge Support
        • 40.4. Strengths
        • 40.5. Limitations
        • 40.6. Key Parameters in Tetrad
        • 40.7. Historical Notes
        • 40.8. Additional Reference
        • 40.9. Summary
      • 41. PC-Max — PC with Maximum-p Collider Orientation
        • 41.1. Key Idea
        • 41.2. When to Use
        • 41.3. Relation to Standard PC
        • 41.4. Prior Knowledge Support
        • 41.5. Strengths
        • 41.6. Limitations
        • 41.7. Key Parameters in Tetrad
        • 41.8. Reference
        • 41.9. Summary
      • 42. PC-MB — PC Markov Blanket Search
        • 42.1. Key Idea
        • 42.2. When to Use
        • 42.3. Prior Knowledge Support
        • 42.4. Strengths
        • 42.5. Limitations
        • 42.6. Key Parameters in Tetrad
        • 42.7. Reference
        • 42.8. Summary
      • 43. PCMCI — Time-Series Causal Discovery (Runge et al.)
        • 43.1. Key Idea
        • 43.2. When to Use
        • 43.3. Prior Knowledge Support
        • 43.4. Strengths
        • 43.5. Limitations
        • 43.6. Key Parameters in Tetrad
        • 43.7. Reference
        • 43.8. Summary
      • 44. R3
      • 45. Restricted BOSS — Target-Focused Best Order Score Search
        • 45.1. Key Idea
        • 45.2. When to Use
        • 45.3. Prior Knowledge Support
        • 45.4. Strengths
        • 45.5. Limitations
        • 45.6. Key Parameters in Tetrad
        • 45.7. Reference
        • 45.8. Summary
      • 46. RFCI — Really Fast Causal Inference
        • 46.1. Key Idea
        • 46.2. When to Use
        • 46.3. Prior Knowledge Support
        • 46.4. Strengths
        • 46.5. Limitations
        • 46.6. Key Parameters in Tetrad
        • 46.7. Reference
        • 46.8. Summary
      • 47. RFCI-BSC
        • 47.1. Key Idea
        • 47.2. When to Use
        • 47.3. Prior Knowledge Support
        • 47.4. Strengths
        • 47.5. Limitations
        • 47.6. Key Parameters in Tetrad
        • 47.7. Reference
        • 47.8. Summary
      • 48. SingleGraphAlg (Imported Graph Wrapper)
        • 48.1. What it does
        • 48.2. Typical workflow
        • 48.3. When to use (and when not to)
      • 49. Skew
      • 50. SP — Sparsest Permutation
        • 50.1. Key idea
        • 50.2. When to use
        • 50.3. How it works (at a glance)
        • 50.4. Strengths
        • 50.5. Limitations
        • 50.6. How it relates to other Tetrad algorithms
        • 50.7. Prior knowledge support
        • 50.8. Reference
        • 50.9. Summary
      • 51. SP-FCI — Sparsest-Permutation FCI
        • 51.1. Key Idea
        • 51.2. When to Use
        • 51.3. Strengths
        • 51.4. Limitations
        • 51.5. Key Parameters in Tetrad
        • 51.6. Knowledge Support
        • 51.7. Relation to Other Algorithms
        • 51.8. References
        • 51.9. Summary
      • 52. StabilitySelection
        • 52.1. Key Idea
        • 52.2. When to Use
        • 52.3. Prior Knowledge Support
        • 52.4. Strengths
        • 52.5. Limitations
        • 52.6. Key Parameters in Tetrad
        • 52.7. Reference
        • 52.8. Summary
      • 53. StARS
        • 53.1. Key Idea
        • 53.2. When to Use
        • 53.3. Prior Knowledge Support
        • 53.4. Strengths
        • 53.5. Limitations
        • 53.6. Key Parameters in Tetrad
        • 53.7. Reference
        • 53.8. Summary
      • 54. Trek-MIMIC
      • 55. TSC — Trek Separation Clusters
        • 55.1. Intended use
        • 55.2. Model assumptions (NOLAC version)
        • 55.3. High-level algorithm sketch
        • 55.4. Inputs and outputs
        • 55.5. Key parameters
        • 55.6. Practical guidance
        • 55.7. Limitations
        • 55.8. Related methods
        • 55.9. Summary
  • Tests & Scores
    • Choosing Tests & Scores
      • 1. Continuous, Approximately Gaussian Data
        • Recommended Tests
        • Recommended Scores
        • Best-Fit Algorithms
      • 2. Discrete Data (Binary / Ordinal / Categorical)
        • Recommended Tests
        • Recommended Scores
        • Best-Fit Algorithms
      • 3. Mixed Continuous/Discrete Data
        • A. Conditional Gaussian (CG)
        • B. Degenerate Gaussian (DGC)
        • C. Basis Function (BF) Tests/Scores
      • 4. Non-Gaussian Linear Models
        • Recommended Tests
        • Recommended Scores
        • Best-Fit Algorithms
      • 5. Nonlinear Models
        • A. Kernel Conditional Independence Test (KCI)
        • B. Random Conditional Independence Test (RCIT)
        • B. Basis Function Test / Score (Recommended for scalability)
      • 6. Latent Variable Workflows (Block-Based Search)
        • Block-Based Tests/Scores
        • Compatible Algorithms
        • Typical Workflow
      • Summary Table (Practical Defaults)
      • Next Steps
    • Tests and Scores: By Type
      • Independence Tests
        • Independence Tests Overview
      • Scores
        • Scores Overview
      • How Tests and Scores Are Used in Algorithms
    • Tests and Scores — Alphabetical
      • 1. Basis Function BIC Score
        • 1.1. Summary
        • 1.2. When to use
        • 1.3. Model class
        • 1.4. Score form (conceptual)
        • 1.5. Parameters
        • 1.6. Strengths
        • 1.7. Limitations
        • 1.8. References
      • 2. Basis Function Likelihood Ratio Test
        • 2.1. Summary
        • 2.2. When to use
        • 2.3. Assumptions
        • 2.4. Test details (conceptual)
        • 2.5. Parameters
        • 2.6. Strengths
        • 2.7. Limitations
        • 2.8. References
      • 3. BDeu Score
        • 3.1. Summary
        • 3.2. When to use
        • 3.3. Model class
        • 3.4. Score form (conceptual)
        • 3.5. Parameters
        • 3.6. Strengths
        • 3.7. Limitations
        • 3.8. References
      • 4. BF-BGe (Basis Function BGe)
      • 5. BGe Score
      • 6. Blocks-BIC
      • 7. Blocks-Test-TS (Trek separation)
      • 8. Chi-Square Test
        • 8.1. Summary
        • 8.2. When to use
        • 8.3. Assumptions
        • 8.4. Test details (conceptual)
        • 8.5. Parameters
        • 8.6. Strengths
        • 8.7. Limitations
        • 8.8. References
      • 9. Conditional Gaussian BIC Score
        • 9.1. Summary
        • 9.2. When to use
        • 9.3. Model class
        • 9.4. Score form (conceptual)
        • 9.5. Parameters
        • 9.6. Strengths
        • 9.7. Limitations
        • 9.8. References
      • 10. Conditional Gaussian Likelihood Ratio Test
        • 10.1. Summary
        • 10.2. When to use
        • 10.3. Assumptions
        • 10.4. Test details (conceptual)
        • 10.5. Parameters
        • 10.6. Strengths
        • 10.7. Limitations
        • 10.8. References
        • 10.9. References
      • 11. CORD
      • 12. Degenerate Gaussian BIC Score
        • 12.1. Summary
        • 12.2. When to use
        • 12.3. Model class
        • 12.4. Score form (conceptual)
        • 12.5. Parameters
        • 12.6. Strengths
        • 12.7. Limitations
        • 12.8. References
      • 13. Degenerate Gaussian Likelihood Ratio Test
        • 13.1. Summary
        • 13.2. When to use
        • 13.3. Assumptions
        • 13.4. Test details (conceptual)
        • 13.5. Parameters
        • 13.6. Strengths
        • 13.7. Limitations
        • 13.8. References
      • 14. DG-BGe (Degenerate Gaussian BGe Score)
      • 15. Discrete BIC Score
        • 15.1. Summary
        • 15.2. When to use
        • 15.3. Model class
        • 15.4. Score form (conceptual)
        • 15.5. Parameters
        • 15.6. Strengths
        • 15.7. Limitations
      • 16. Extended BIC (EBIC) Score
        • 16.1. Summary
        • 16.2. When to use
        • 16.3. Model class
        • 16.4. Score form (conceptual)
        • 16.5. Parameters
        • 16.6. Strengths
        • 16.7. Limitations
        • 16.8. References
      • 17. Equivalence (TOST)
      • 18. FFCI (Fourier Features Conditional Independence)
      • 19. FFML Score
      • 20. Fisher Z Test
        • 20.1. Summary
        • 20.2. When to use
        • 20.3. Assumptions
        • 20.4. Test details (conceptual)
        • 20.5. Parameters
        • 20.6. Strengths
        • 20.7. Limitations
        • 20.8. References
      • 21. Fisher Z, Causal Learn (Python)
      • 22. G-Square Test
        • 22.1. Summary
        • 22.2. When to use
        • 22.3. Assumptions
        • 22.4. Test details (conceptual)
        • 22.5. Parameters
        • 22.6. Strengths
        • 22.7. Limitations
        • 22.8. References
      • 23. GCM (Generalized Covariance Measure)
      • 24. Generalized Information Criterion (GIC) Scores
        • 24.1. Summary
        • 24.2. When to use
        • 24.3. Model class
        • 24.4. Score form (conceptual)
        • 24.5. Parameters
        • 24.6. Strengths
        • 24.7. Limitations
        • 24.8. References
      • 25. Instance-specific BDeu Score
      • 26. KCI, Causal Learn (Python)
      • 27. Kernel Conditional Independence Test (KCI)
        • 27.1. Summary
        • 27.2. When to use
        • 27.3. Assumptions
        • 27.4. Test details (conceptual)
        • 27.5. Parameters
        • 27.6. Strengths
        • 27.7. Limitations
        • 27.8. References
      • 28. m-Separation Test
        • 28.1. Summary
        • 28.2. When to use
        • 28.3. Assumptions
        • 28.4. Test details (conceptual)
        • 28.5. Parameters in Tetrad
        • 28.6. Strengths
        • 28.7. Limitations
        • 28.8. References
      • 29. Minimax Conditional Independence Test
      • 30. m-Separation Score
        • 30.1. Summary
        • 30.2. When to use
        • 30.3. Model class
        • 30.4. Score form (conceptual)
        • 30.5. Parameters in Tetrad
        • 30.6. Strengths
        • 30.7. Limitations
      • 31. Poisson BIC Test
        • 31.1. Summary
        • 31.2. When to use
        • 31.3. Relation to Poisson Prior Score
        • 31.4. Test details (conceptual)
        • 31.5. Parameters
        • 31.6. Strengths
        • 31.7. Limitations
      • 32. Poisson Prior Score
        • 32.1. Summary
        • 32.2. When to use
        • 32.3. Model class
        • 32.4. Score form (conceptual)
        • 32.5. Parameters
        • 32.6. Strengths
        • 32.7. Limitations
        • 32.8. Relation to other penalties
      • 33. Probabilistic Independence Test
        • 33.1. Summary
        • 33.2. When to use
        • 33.3. Assumptions
        • 33.4. Test details (conceptual)
        • 33.5. Parameters
        • 33.6. Strengths
        • 33.7. Limitations
      • 34. RCIT, Causal Learn (Python)
      • 35. Random Conditional Independence Test (RCIT)
        • 35.1. Summary
        • 35.2. When to use
        • 35.3. Assumptions
        • 35.4. Test details (conceptual)
        • 35.5. Parameters
        • 35.6. Strengths
        • 35.7. Limitations
        • 35.8. Relationship to other CI tests in Tetrad
        • 35.9. References
      • 36. SEM BIC Score
        • 36.1. Summary
        • 36.2. When to use
        • 36.3. Model class
        • 36.4. Score form (conceptual)
        • 36.5. Parameters
        • 36.6. Strengths
        • 36.7. Limitations
      • 37. SEM BIC Test
        • 37.1. Summary
        • 37.2. When to use
        • 37.3. Relation to SEM BIC Score
        • 37.4. Test details (conceptual)
        • 37.5. Strengths
        • 37.6. Limitations
      • 38. Stratified Rank (Domain-Pooled)
      • 39. TRFF BIC Score
      • 40. TRFF-LR-Test
      • 41. TSBI (Trek Separation Blocks Independence)
      • 42. Zhang–Shen Bound Score
        • 42.1. Summary
        • 42.2. When to use
        • 42.3. Model class
        • 42.4. Score form (conceptual)
        • 42.5. Parameters
        • 42.6. Strengths
        • 42.7. Limitations
        • 42.8. References
  • Experimental Methods
    • What the marking means
    • Seeing them in the interface
    • The list, as of Tetrad 8.0.0
      • Experimental algorithms
      • Experimental independence tests
      • Experimental scores
    • Deprecated methods
  • Parameters
    • A
      • acceptanceProportion
      • adaptiveBasisSelection
      • addOriginalDataset
      • adjustOrientations
      • allowBidirected
      • allowInternalRandomness
      • alpha
      • alphaDefault0.05
      • amBetaAlpha
      • amBetaBeta
      • amCoefHigh
      • amCoefLow
      • amCoefSymmetric
      • amDerivativeMax
      • amDerivativeMin
      • amDistortionType
      • amEnsureInvertibility
      • amFirstDerivMax
      • amFirstDerivMin
      • amNumPostNonlinearFunctions
      • amRescaleMax
      • amRescaleMin
      • amTaylorSeriesDegree
      • anmNoiseKind
      • anmNoiseStrength
      • anmNonlinearity
      • anmPreset
      • applyR1
      • avgDegree
    • B
      • basisRankTransform
      • basisScale
      • basisType
      • betaHigh
      • betaLow
      • bgeAlphaMu
      • bgeAlphaWOffset
      • binsPerContXY
      • binsPerContZ
      • bootstrappingNumThreads
      • bossAlg
      • bwMaxRows
    • C
      • cacheScores
      • calculateEuclidean
      • catRho
      • cciScoreAlpha
      • cdnodColliderStyle
      • cdnodContextMargin
      • cdnodExcludeContextsFromS
      • cdnodGreedyContexts
      • cdnodMaxContextsPerNode
      • cdnodMaxPMargin
      • cdnodScoreContexts
      • cellTableType
      • cgExact
      • checkAdjacencySepsets
      • checkType
      • clusterSizes
      • coefHigh
      • coefLow
      • coefSymmetric
      • colliderDiscoveryRule
      • colliderOrientationStyle
      • completeRuleSetUsed
      • concurrentFAS
      • conditioningThreshold
      • conflictRule
      • connected
      • convergenceThreshold
      • cordEngine
      • cordLearningRate
      • cordMaxLeafNodes
      • cordNumEstimators
      • cordNumThresholds
      • cordSeed
      • cordSymmetric
      • correlationThreshold
      • covHigh
      • covLow
      • covSymmetric
      • cpdag
      • cstarCpdagAlgorithm
      • customNoiseExpression
      • customNoiseOption
      • cutoffConstrainSearch
      • cutoffDataSearch
      • cutoffIndTest
      • cyclicCoefHigh
      • cyclicCoefLow
      • cyclicCoefStyle
      • cyclicMaxProd
      • cyclicRadius
    • D
      • daoErrorDistribution
      • daoRandomizeOrder
      • daoSfIn
      • daoSfOut
      • dataType
      • deCoupling
      • deDerivedNoise
      • dedupByCpdag
      • deEmitConfigColumn
      • deInteraction
      • deMaxLevels
      • deMinLevels
      • deNumDerived
      • deNumFactors
      • deNumResponses
      • depth
      • deResponseNoise
      • deSelection
      • deSortByConfiguration
      • determinismThreshold
      • differentGraphs
      • discreteInteractionOrder
      • discretize
      • dmMergeThreshold
      • doColliderOrientation
      • doFgesFirst
      • doHigherRankExpansion
      • doLegalityGating
      • domainColumn
      • doOneEquationOnly
      • doPossibleDsep
    • E
      • ebicGamma
      • effectiveSampleSize
      • equivalenceMargin
      • equivalenceMarginMultiplier
      • errorsNormal
      • ess
      • excludeSelectionBias
      • extraEdgeRemovalStep
    • F
      • fa_threshold
      • faithfulnessAssumed
      • faskAdjacencyMethod
      • faskAssumeLinearity
      • faskDelta
      • faskLeftRightRule
      • faskNonempirical
      • faskOverrideBlockLength
      • faskOverrideBootstraps
      • faskPoolAdjacency
      • faskPoolAdjacencyOrientations
      • faskPoolExternalAdjacencyFraction
      • faskPoolExternalOrientations
      • fasRule
      • fastIcaA
      • fastIcaMaxIter
      • fastIcaTolerance
      • fcitCorrectness
      • fcitSlAllowClassEscape
      • fcitStartsWith
      • fDegree
      • fdrQ
      • ffmlFfFeatures
      • ffmlInteractionLambda
      • ffmlRidge
      • fileOutPath
      • fisherEpsilon
      • flopNumRestarts
      • fofcAlpha
    • G
      • gammaHigh
      • gammaLow
      • gcmControlFunction
      • gcmMultiplierSamples
      • gcmRegressorType
      • gcmRffFeatures
      • gcmRffSigma
      • gcmRidge
      • gcmZTruncationLimit
      • generalSemErrorTemplate
      • generalSemFunctionTemplateLatent
      • generalSemFunctionTemplateMeasured
      • generalSemParameterTemplate
      • ginBackend
      • ginPermutations
      • ginRidge
      • gmasAllowAdditions
      • gmasLookaheadDepth
      • gmasTriangleEscapeOnly
      • graspAlg
      • graspBreakAfterImprovement
      • graspCheckCovering
      • graspDepth
      • graspForwardTuckOnly
      • graspNonSingularDepth
      • graspOrderedAlg
      • graspSingularDepth
      • graspToleranceDepth
      • graspUseRaskuttiUhler
      • graspUseScore
      • graspUseVpScoring
      • guaranteeAcyclic
      • guaranteeCpdag
      • guaranteeIid
      • guaranteePag
    • H
      • henckelPruning
      • hiddenDimension
      • hiddenDimensions
    • I
      • ia
      • imagesMetaAlg
      • imapAlpha
      • include_structure_model
      • includeAllNodes
      • includeNegativeCoefs
      • includeNegativeSkewsForBeta
      • includePositiveCoefs
      • includePositiveSkewsForBeta
      • inputScale
      • instanceRow
      • instanceSpecificAlpha
      • interceptHigh
      • interceptLow
      • intervalBetweenRecordings
      • intervalBetweenShocks
      • ionAdjacencySearch
      • ionPathLengthSearch
      • ipen
      • is
      • itr
    • K
      • kciAlpha
      • kciCutoff
      • kciEpsilon
      • kciNumBootstraps
      • kciUseApproximation
      • kernelRegressionSampleSize
      • kernelType
      • kernelWidth
      • kmlBandwidthMultiplier
      • kmlFeatureType
      • kmlJitter
      • kmlLambda
      • kmlNumFeatures
    • L
      • lambda1
      • linearHigh
      • linearLow
      • lingamPruneAlpha
      • lingamRefitAndPrune
      • logFinalOrientations
      • lowerBound
      • lvHeuristicOnly
    • M
      • manualLambda
      • maxBlockingPathLength
      • maxCategories
      • maxCellsPerStratum
      • maxCorrelation
      • maxDegree
      • maxDiscriminatingPathLength
      • maxDistinctValuesDiscrete
      • maxIndegree
      • maxit
      • maxIterations
      • maxLatentSubsetSize
      • maxObservedLevelsPerVar
      • maxOutdegree
      • maxPaxPOrientationHeuristicMaxLength
      • maxPOrientationMaxPathLength
      • maxPossibleSepPathLength
      • maxRank
      • maxRuns
      • maxScoreDrop
      • maxSepsetSize
      • mb
      • mcAlpha
      • meanHigh
      • meanLow
      • measurementVariance
      • mgmParam1
      • mgmParam2
      • mgmParam3
      • mimbuildType
      • mimicGroupSpecs
      • mimicNumSharedParents
      • mimLatentGroupSpecs
      • mimLatentMeasuredImpureParents
      • mimMeasuredMeasuredImpureAssociations
      • mimMeasuredMeasuredImpureParents
      • mimMetaEdgeConnectionType
      • mimMimNumStructuralNodes
      • mimNumChildrenPerGroup
      • mimNumStructuralEdges
      • mimNumStructuralNodes
      • minCategories
      • minCountPerCell
      • minimaxFfFeatures
      • minimaxFfSigma
      • minimaxIrlsIters
      • minimaxMaxNu
      • minimaxPermutations
      • minimaxRidge
      • minimaxScale
      • minParamSampleSize
      • minSampleSizePerCell
      • minStratumSize
      • missingDataPolicy
      • missingEmMaxIterations
      • missingEmRidge
      • missingEmTolerance
      • missingEssMode
      • missingNumImputations
      • missingTestwiseCommonRows
      • mnarNumExtraInfluences
      • mnarNumVariablesWithMissing
      • mnarThreshold
    • N
      • noiseExpression
      • noRandomlyDeterminedIndependence
      • numBasisFunctions
      • numberOfExpansions
      • numberResampling
      • numBscBootstrapSamples
      • numCategories
      • numCategoriesToDiscretize
      • numFactors
      • numFfFeatures
      • numLags
      • numLatents
      • numMeasures
      • numRandomizedSearchModels
      • numRuns
      • numStarts
      • numSub-samples
      • numSubsamples
      • numThreads
    • O
      • optimalAcrossBranches
      • orientAndPrune
      • orientationAlpha
      • orientTowardMConnections
      • orientVisibleFeedbackLoops
      • osDegradeCensorProp
      • osDegradeCensorQuantile
      • osDegradeMissingMechanism
      • osDegradeMissingProp
      • osDegradeOrdinalizeProp
      • osFormIndexNoise
      • osFormInteraction
      • osFormNonlinearity
      • osGraphAvgSystemDegree
      • osGraphEdgeDensity
      • osGraphNumContext
      • osGraphNumHiddenContext
      • osGraphNumIndices
      • osGraphNumOutcomes
      • osGraphNumSystem
      • osPanelEmitSubjectColumn
      • osPanelEmitSubjectsAsDataSets
      • osPanelNumSubjects
      • osPanelSubjectShiftSd
      • osSerialArCoef
      • osSerialIndexMemoryHigh
      • osSerialIndexMemoryLow
      • osSerialMaxLag
      • osSerialPropCrossLag
      • osTypeDiscreteOutcome
      • osTypeNumCategories
      • osTypePropContextDiscrete
      • osTypePropSystemDiscrete
      • otherPermMethod
      • outputCpdag
      • outputRBD
    • P
      • parallelized
      • pathsMaxDistanceFromEndpoint
      • pathsMaxLength
      • pathsMaxLengthAdjustment
      • pathsMaxNumSets
      • pathsNearWhichEndpoint
      • pcHeuristic
      • pcOrderRefinement
      • pcRefinementAlpha
      • penaltyDiscount
      • penaltyDiscountDefault1
      • penaltyDiscountZs
      • percentDiscrete
      • percentResampleSize
      • percentStability
      • percentSubsampleSize
      • piThr
      • poissonLambda
      • polynomialConstant
      • polynomialDegree
      • poolDataSets
      • pooledTestMethod
      • poolImputations
      • precomputeCovariances
      • preserveMarkov
      • priorEquivalentSampleSize
      • probabilityOfEdge
      • probCycle
      • probRemoveColumn
      • probTwoCycle
      • pythonCiServer
      • pythonExe
    • R
      • randomizeColumns
      • randomSelectionSize
      • raRadius
      • rbRadius
      • rcit.approx
      • rcit.centerFeatures
      • rcit.lambda
      • rcit.numFeaturesXY
      • rcit.numFeaturesZ
      • rcit.permutations
      • rcit.rcitMode
      • rcitNumF
      • rcitNumF2
      • rcitNumFeatures
      • recoveryOddsThreshold
      • recursive
      • recursiveDepth
      • regularizationLambda
      • reharvestSepsets
      • removeAlmostCycles
      • removeEffectNodes
      • requireImapStates
      • resamplingEnsemble
      • resamplingWithReplacement
      • rescueAction
      • resolveAlmostCyclicPaths
      • rlcdAllowNonLeafX
      • rlcdCeilingValue
      • rlcdCensorCeiling
      • rlcdCheckV
      • rlcdKnowledgeInStage1
      • rlcdLatentGate
      • rlcdMaxK
      • rlcdObservedExplanationAlpha
      • rlcdObservedExplanationCheck
      • rlcdPartitionCliqueThreshold
      • rlcdQualifyObservedCauses
      • rlcdResolveTwoIndicatorLatents
      • rlcdStabilityRuns
      • rlcdStabilityTimeLimit
      • rlcdStage1Fges
      • rlcdStage1None
      • rlcdUnfoldCovers
    • S
      • sampleSize
      • sampleStyle
      • saveBootstrapGraphs
      • saveLatentVars
      • scaleFreeAlpha
      • scaleFreeBeta
      • scaleFreeDeltaIn
      • scaleFreeDeltaOut
      • scalingFactor
      • scoreCheckPenaltyDiscount
      • scoreTestCalibratedPValues
      • seed
      • selectionMinEffect
      • selfLoopCoef
      • semBicRule
      • semBicStructurePrior
      • semGicRule
      • semImSimulationType
      • sepsetFinderMethod
      • shrinkageMode
      • significanceChecked
      • simulationErrorType
      • simulationParam1
      • simulationParam2
      • singularityLambda
      • skewEdgeThreshold
      • skipNumRecords
      • splitDelta
      • stableFAS
      • standardize
      • StARS.cutoff
      • startFromCompleteGraph
      • stratifiedPermutations
      • stratifyByDomain
      • structurePrior
      • symmetricFirstStep
    • T
      • takeLogs
      • targetName
      • targets
      • testTimeout
      • tetrad_test_bpc
      • tetrad_test_fofc
      • thr
      • thresholdAlpha
      • thresholdBHat
      • thresholdForNumEigenvalues
      • thresholdNoRandomConstrainSearch
      • thresholdNoRandomDataSearch
      • thresholdW
      • timeLag
      • timeLagReplicatingGraph
      • timeLimit
      • timeout
      • topBracket
      • topK
      • trffFfFeatures
      • trffNu
      • trffRidge
      • trffSymmetrized
      • trimmingStyle
      • trueErrorVariance
      • truncationLimit
      • tscClusterRank
      • tscClusterSize
      • tscEnableHierarchy
      • tscMinRankDrop
      • tscMinRedundancy
      • tscMode
      • tscPcUseBoss
      • tscSingletonPolicy
      • twoCycleAlpha
      • twoCycleScreeningThreshold
    • U
      • upperBound
      • useAdaptiveZBins
      • useBes
      • useBesDefaultTrue
      • useBossAdjacencies
      • useCorrDiffAdjacencies
      • useDataOrder
      • useEquivalenceRemoval
      • useFasAdjacencies
      • useGap
      • useIlsRestarts
      • useMaxAcrossStrata
      • useMaxPHeuristic
      • useMaxPOrientationHeuristic
      • usePass0
      • useSaturatingStep
      • useScore
      • useSkewAdjacencies
      • useVarimax
    • V
      • varHigh
      • varLow
      • verbose
    • W
      • wThreshold
    • Z
      • zsMaxIndegree
      • zSRiskBound
  • Glossary
    • Adjacent
    • Degree
    • Indegree
    • Markov Blanket
    • Markov Equivalent Graphs
    • Meek Orientation Rules
    • Mixed Ancestral Graph (MAG)
    • Multiple Indicator Model
    • Outdegree
    • Partial Ancestral Graph (PAG)
    • CPDAG
    • Scale Free Graph
    • Trek
  • Appendices
    • An Introduction to PAGs
    • Arc Specializations in PAGs
    • Solving Out of Memory Errors
  • Contributors
    • 🌟 Founders & Early Leadership
    • 🧭 Project Direction & Architecture
    • 🔬 Algorithmic & Research Contributions
    • 🛠 Software Engineering & Infrastructure
    • 🏛 Funding Acknowledgment
  • Papers and Books
  • Change Log
    • 8.0.0 — November 2026
Tetrad Manual
  • Tests & Scores
  • Tests and Scores — Alphabetical
  • View page source

Tests and Scores — Alphabetical

Below is the complete set of per-test and per-score documentation pages for Tetrad’s statistical tests and scoring methods.

  • 1. Basis Function BIC Score
  • 2. Basis Function Likelihood Ratio Test
  • 3. BDeu Score
  • 4. BF-BGe (Basis Function BGe)
  • 5. BGe Score
  • 6. Blocks-BIC
  • 7. Blocks-Test-TS (Trek separation)
  • 8. Chi-Square Test
  • 9. Conditional Gaussian BIC Score
  • 10. Conditional Gaussian Likelihood Ratio Test
  • 11. CORD
  • 12. Degenerate Gaussian BIC Score
  • 13. Degenerate Gaussian Likelihood Ratio Test
  • 14. DG-BGe (Degenerate Gaussian BGe Score)
  • 15. Discrete BIC Score
  • 16. Extended BIC (EBIC) Score
  • 17. Equivalence (TOST)
  • 18. FFCI (Fourier Features Conditional Independence)
  • 19. FFML Score
  • 20. Fisher Z Test
  • 21. Fisher Z, Causal Learn (Python)
  • 22. G-Square Test
  • 23. GCM (Generalized Covariance Measure)
  • 24. Generalized Information Criterion (GIC) Scores
  • 25. Instance-specific BDeu Score
  • 26. KCI, Causal Learn (Python)
  • 27. Kernel Conditional Independence Test (KCI)
  • 28. m-Separation Test
  • 29. Minimax Conditional Independence Test
  • 30. m-Separation Score
  • 31. Poisson BIC Test
  • 32. Poisson Prior Score
  • 33. Probabilistic Independence Test
  • 34. RCIT, Causal Learn (Python)
  • 35. Random Conditional Independence Test (RCIT)
  • 36. SEM BIC Score
  • 37. SEM BIC Test
  • 38. Stratified Rank (Domain-Pooled)
  • 39. TRFF BIC Score
  • 40. TRFF-LR-Test
  • 41. TSBI (Trek Separation Blocks Independence)
  • 42. Zhang–Shen Bound Score
Previous Next

© Copyright 2025.

Built with Sphinx using a theme provided by Read the Docs.