Peter Spirtes develops mathematical and computational methods for causal discovery. His work asks which causal conclusions can be recovered from statistical data and background knowledge when fully controlled experiments are unavailable, and how to turn the corresponding guarantees into practical algorithms.[ref]
Peter Spirtes by Carnegie Mellon University. Research: the two goals of the Tetrad project and limitations of its assumptions
With Clark Glymour and Richard Scheines, he coauthored Causation, Prediction, and Search by Peter Spirtes, Clark Glymour and Richard Scheines. One important example is the PC algorithm, which uses conditional independence information to remove candidate edges and orient some of the remaining ones. Under its assumptions, the resulting graph represents an equivalence class of possible causal explanations; it need not recover every arrow in a unique graph. Making these limitations explicit is part of the method's contribution, rather than an exception to it.[ref]
Causation, Prediction, and Search by Peter Spirtes, Clark Glymour and Richard Scheines. Chapter 5, section 5.4.2, PC algorithm; Markov equivalence and the stated causal assumptions
Portrait of Peter Spirtes
. Portrait selected from the matching Carnegie Mellon institutional profile. Source. New to topics? Read the docs here!
