Content
- April 12: Primer Chapter 1
- April 19: Primer Chapter 2
- April 26: no course
- May 3: Primer Chapter 3
Assignment: Primer Study questions 3.2.1, 3.3.2, 3.4.1 - May 10: Causality, Sections 2.2 to 2.5
Project questions:
- Find and unterstand a correctness proof of the IC algorithm
- What is the complexity of the first step of the IC algorithm (might be known, start with literature search)? Is it NP-hard? Is there a subexponential implementation?
- What is the fastest implementation of the third step? - May 17: Causality, Sections 2.6 to 2.9
Assignment: I added some examples for the IC algorithms to the Material section
Project question:
- Find and understand a proof of Theorem 2.6.2 - May 24: Causality, Sections 3.1 to 3.3
Assignment: I added two exercises regarding identifiability - May 31: Causality, Sections 3.4, 3.5
Assignment: Example in Causality Book, Section 3.4.3 - June 7: Causality, Sections 4.1, 4.2
Project question: Read this paper.
Are there any graph classes for which the Gröbner basis algorithm runs in polynomial time? (in linear models)
Start with the directed edges forming a path.
Useful resources: Algebraic Problems in Structural Equation Modeling, Identification in Tree-shaped Linear Structural Causal Models - June 14: Causality, Section 4.3
- June 21: Causality, Sections 4.4, 4.5
- June 28: Causality, Sections 5.1, 5.2, 5.3
- July 5: Causality, Sections 5.4, 6.1
- July 12: Causality, Sections 6.2, 6.3