Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of the front door criterion in causal inference, explaining the conditions under which a set of variables satisfies this criterion for an ordered pair. It discusses the blocking of directed paths, the absence of backdoor paths, and the observation of blocked paths. The sufficient conditions for the front door criterion are detailed, emphasizing the importance of variables blocking paths effectively.