Method evidence record

GES Algorithm

Greedy Equivalence Search (GES) is a score-based algorithm for learning the causal structure of a set of variables from observational data. Introduced by David Maxwell Chickering in 2002, GES operates directly on Markov equivalence classes of directed acyclic graphs (DAGs), represented as completed partially directed acyclic graphs (CPDAGs). Under the assumptions of causal sufficiency and a faithful data-generating process, GES is proven to recover the true equivalence class in the large-sample limit.

Sources recorded, not reviewed

Source record

Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.

Greedy Equivalence Search (GES)

Taxonomic method record · ml-model / causal-inference

Chickering, D. M. (2002). Optimal structure identification with greedy search. Journal of Machine Learning Research, 3, 507–554. · URL

Open full method

Curated claims

Claims persisted in the evidence ledger, each with its own assessment.

No curated claims yet

This view does not invent a claim assessment when the ledger has none.

Related methods

Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.