Lecture

Causal Inference & Directed Graphs

Related lectures (55)
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Fixed Points in Graph Theory
Focuses on fixed points in graph theory and their implications in algorithms and analysis.
Statistical Analysis of Network Data
Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.
Graph Algorithms: Modeling and Traversal
Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.
Counterfactuals: SEM and D-Separation
Explores counterfactuals in SEMs and D-Separation in graphical models.
Bayesian Networks: Factorization and Sampling
Explains Bayesian Networks factorization and sampling methods using DAGs and Variable Elimination.
Probability & Stochastic Processes
Covers applied probability, stochastic processes, Markov chains, rejection sampling, and Bayesian inference methods.
Graph Algorithms II: Traversal and Paths
Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.
Graph Algorithms: Modeling and Representation
Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.
Linear Transformations: Matrices and Kernels
Covers linear transformations, matrices, kernels, and properties of invertible matrices.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.