Lecture
Causal Inference: Front Door Criterion
Related lectures (32)
Causal Inference & Directed Graphs
Explores causal inference, directed graphs, and fairness in algorithms, emphasizing conditional independence and the implications of DAGs.
Causal Inference: Understanding Treatment Effects
Explores treatment effects, confounding variables, and challenges in interpreting observational study results.
Model Selection and Local Geometry
Explores model selection challenges in causal models and the impact of local geometry on statistical inference.
Causal Inference: Learning Graph Structures
Explores causal inference through learning graph structures for causal reasoning from observational data.
Shortest Path in Directed Graphs
Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.
Counterfactuals: SEM and D-Separation
Explores counterfactuals in SEMs and D-Separation in graphical models.
Graphical Definition: Level Sets and Domains
Covers the graphical definition of functions, focusing on level sets and domains.
Fixed Points in Graph Theory
Focuses on fixed points in graph theory and their implications in algorithms and analysis.
Decentralized Systems: Gossip Protocol
Covers the Gossip Protocol in decentralized systems, focusing on its correctness and efficiency.
Introduction to Shortest Path
Introduces the concept of shortest path, discussing weighted paths, Hamiltonian paths, and path optimization algorithms.