Skip to contentScholarGate
LibraryBookshelfDeskReview StudioAssistant
Sign in
On this page
IntuitionHow it worksWhen to use itStrengths & limitationsCommon pitfallsApplicationsFrequently asked🔒 Read the full methodSourcesRelated methods
Cite this pageSpotted an issue on this page? Report or suggest a fix →
Home›Causal inference›FCI Algorithm — Fast Causal Inference
Machine learningCausal discovery

FCI Algorithm — Fast Causal Inference

Fast Causal Inference (FCI) Algorithm · Also known as: FCI, Fast Causal Inference, FCI Causal Discovery, FCI Algoritması

The Fast Causal Inference (FCI) algorithm is a constraint-based causal discovery method introduced by Spirtes, Glymour, and Scheines in their landmark 2000 book Causation, Prediction, and Search. Unlike its predecessor the PC algorithm, FCI is specifically designed to handle the presence of latent (unmeasured) common causes and sample selection bias. It outputs a Partial Ancestral Graph (PAG), which faithfully represents the set of all causal structures consistent with the observed conditional independencies.

ScholarGate
  1. Machine learning
  2. v1
  3. 1 Sources
  4. PUBLISHED
Cite this page →
Tools & resources
Download slides
Learn & explore

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Method map

The neighbourhood of related methods — select a node to explore.

FCI Algorithm
Bayesian NetworkNOTEARS

When to use it

Use FCI when you suspect unmeasured confounders or sample selection bias — situations where the PC algorithm would give misleading results. FCI requires that the causal Markov condition and faithfulness hold in the true underlying graph, and it assumes that conditional independence tests are reliable (demanding large samples for high-dimensional data). For purely observed systems with no latent variables, PC is computationally cheaper. When the variable count is very large, consider RFCI (a faster approximation) or score-based methods such as NOTEARS.

Strengths & limitations

Strengths
  • Explicitly accounts for latent common causes and selection bias, producing provably correct output under its assumptions.
  • Output PAG conveys genuine uncertainty: circle marks communicate what causal orientation cannot be identified from data alone.
  • Asymptotically sound and complete — in the large-sample limit it recovers the true PAG equivalence class.
  • Modular design allows plug-in independence tests (Fisher-z, G-squared, kernel-based) suited to different data types.
Limitations
  • Computationally expensive: the Possible-D-Sep phase requires exponentially many conditional independence tests in the worst case.
  • Requires large sample sizes for reliable conditional independence testing, especially with many conditioning variables.
  • Faithfulness assumption may be violated in practice (e.g., through parameter cancellations), leading to incorrect edge removals.
  • Output PAG can be difficult to interpret for practitioners unfamiliar with ancestral graph semantics and circle-endpoint notation.

Frequently asked

What is the difference between FCI and the PC algorithm?

The PC algorithm assumes all common causes are observed and outputs a Completed Partially Directed Acyclic Graph (CPDAG). FCI relaxes this assumption, allowing for latent confounders and selection bias, and outputs a Partial Ancestral Graph (PAG) that uses circle and bidirected-arrow endpoints to represent causal uncertainty introduced by unobserved variables.

What does a bidirected arrow (↔) in the PAG output mean?

A bidirected arrow between variables X and Y in the PAG indicates that there is likely a latent common cause — an unmeasured variable that causally influences both X and Y. It does not mean X and Y cause each other directly; rather, their association is at least partially explained by one or more hidden confounders.

Is FCI suitable for small datasets?

FCI is not recommended for small datasets. Its correctness guarantees are asymptotic, and reliable conditional independence testing — especially when conditioning on large subsets — requires substantial sample sizes. With small samples, spurious independencies and missed dependencies can cascade through the algorithm, producing a PAG that misrepresents the true causal structure.

Sources

  1. Spirtes, P., Glymour, C., & Scheines, R. (2000). Causation, Prediction, and Search (2nd ed.). MIT Press. ISBN: 978-0-262-19440-2

How to cite this page

ScholarGate. (2026, June 2). Fast Causal Inference (FCI) Algorithm. ScholarGate. https://scholargate.app/en/causal-inference/fci-algorithm

Related methods

Bayesian NetworkNOTEARS

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

  • Bayesian NetworkBayesian↔ compare
  • NOTEARSCausal inference↔ compare
Compare side by side →

Similar methods

Causal Discovery AlgorithmsGES AlgorithmDAG Causal IdentificationNOTEARSBayesian NetworkFrontdoor AdjustmentBayesian Network with Measurement ErrorMachine Learning-Augmented Sensitivity Analysis for Causality

Related reference concepts

Directed Acyclic GraphBayesian NetworksCausal InferenceProbabilistic InferenceCausal IdentificationSensitivity Analysis

Spotted an issue on this page? Report or suggest a fix →

ScholarGate — FCI Algorithm (Fast Causal Inference (FCI) Algorithm). Retrieved 2026-07-21 from https://scholargate.app/en/causal-inference/fci-algorithm · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
Spirtes, Glymour & Scheines
Year
2000
Type
Constraint-based causal discovery algorithm
Subfamily
Causal discovery
Handles Latent Confounders
Yes
Output Representation
Partial Ancestral Graph (PAG)
Related methods
Bayesian NetworkNOTEARS
ScholarGate

A content-first reference library for research methods — what each one is, how it works, and where it comes from.

Open data (CC-BY)

Explore

  • Library
  • Search the library…
  • Browse by field
  • Fields
  • Journey
  • Compare
  • Which method?

Reference

  • Subjects
  • Atlas
  • Glossary
  • Methodology
  • Philosophy

Your tools

  • Bookshelf
  • Desk
  • Chat

Company

  • About
  • Pricing
  • Contact
  • Suggest a method

Entries are compiled from published sources for reference. Verifying the accuracy and suitability of any information for your own use remains your responsibility.

© 2026 ScholarGate · A research-method reference library
  • Privacy
  • Cookies
  • Terms
  • Delete account