Event Details:
Tuesday, March 29, 2022
8:30am - 9:30am PDT
This event is open to:
General Public
Free and open to the public
Tuesday, March 29, 2022 [Link to join] (ID: 996 2837 2037, Password: 386638)
- Speaker 1: Michael Oberst (MIT)
- Title: Regularizing towards Causal Invariance: Linear Models with Proxies
- Abstract: We propose a method for learning linear models whose predictive performance is robust to causal interventions on unobserved variables, when noisy proxies of those variables are available. Our approach takes the form of a regularization term that trades off between in-distribution performance and robustness to interventions. Under the assumption of a linear structural causal model, we show that a single proxy can be used to create estimators that are prediction optimal under interventions of bounded strength. This strength depends on the magnitude of the measurement noise in the proxy, which is, in general, not identifiable. In the case of two proxy variables, we propose a modified estimator that is prediction optimal under interventions up to a known strength. We further show how to extend these estimators to scenarios where additional information about the "test time" intervention is available during training. We evaluate our theoretical findings in synthetic experiments and using real data of hourly pollution levels across several cities in China.
- Speaker 2: Shuangning Li (Stanford University
- Title: Random Graph Asymptotics for Treatment Effect Estimation under Network Interference
- Abstract: The network interference model for causal inference places all experimental units at the vertices of an undirected exposure graph, such that treatment assigned to one unit may affect the outcome of another unit if and only if these two units are connected by an edge. This model has recently gained popularity as means of incorporating interference effects into the Neyman--Rubin potential outcomes framework; and several authors have considered estimation of various causal targets, including the direct and indirect effects of treatment. In this paper, we consider large-sample asymptotics for treatment effect estimation under network interference in a setting where the exposure graph is a random draw from a graphon. When targeting the direct effect, we show that -- in our setting -- popular estimators are considerably more accurate than existing results suggest, and provide a central limit theorem in terms of moments of the graphon. Meanwhile, when targeting the indirect effect, we leverage our generative assumptions to propose a consistent estimator in a setting where no other consistent estimators are currently available. We also show how our results can be used to conduct a practical assessment of the sensitivity of randomized study inference to potential interference effects. Overall, our results highlight the promise of random graph asymptotics in understanding the practicality and limits of causal inference under network interference.
Related Topics
Explore More Events
-
Lecture
Data Feminism for AI
-John A. and Cynthia Fry Gunn Rotunda, E241 at the ChEM-H / Neuro, 290 Jane Stanford Way, 2nd floor, Stanford, CA 94305 -
Conference
2024 Stanford Data Science Conference
-Paul Brest Hall (Law School), 555 Salvatierra Walk, Stanford, CA 94305 -
Causal Science Center
Bay Area Tech Economics Seminar
-John A. and Cynthia Fry Gunn Rotunda, E241 at the ChEM-H / Neuro, 290 Jane Stanford Way, 2nd floor, Stanford, CA 94305