Causal Matrix Completion
summary
Provides a causal model (potential outcomes) for matrix completion under MNAR, shows entries can be identified even when observation probability is zero, and builds an estimator called synthetic nearest neighbors that combines nearest neighbors and synthetic controls. Proves finite-sample consistency and asymptotic normality, gives entry-wise (max-norm) bounds (error scaling like R^{3/2}/√K under assumptions), supplies a variance estimator via second-moment de-noising, and demonstrates in simulations that SNN recovers distributions where USVT and softImpute fail for MCAR, LMNAR and MNAR.
AI-written summary · about
chapters (22)
- 0:00Intro
- 2:04Formal setup for matrix completion
- 2:54State-of-the-art: NO unified approach to different sparsity patterns
- 4:35Overview
- 5:13Does the sparsity pattern matter? An empirical example
- 6:45Missing completely at random (MCAR) data
- 8:14Limited-missing not at random (L-MNAR) data
- 8:54Missing not at random (MNAR) data
- 10:12MNAR data is abundant
- 10:47Nearest neighbors (NN)
- 11:26Synthetic controls (SC)
- 12:37SNN = SC + NN l'Academic Sudoku
- 14:47In general, we cannot infer missing entries...
- 15:21What type of missing is allowed?—selection on latent factors
- 17:01Other operating assumptions
- 18:33Simplifying assumption
- 19:00Theoretical results
- 23:08Optimal observation pattern
- 23:53Towards heteroskedastic variance estimation
- 25:01Heteroskedastic variance estimation algorithm
- 25:34Statistical guarantees
- 26:26An important connection
related talks
47mCausal Matrix Completion: Applications to Offline Causal Reinforcement Learning
52mCausal Matrix Estimation
11mCausal Inference For Socio-Economic & Engineering Systems
30mCounterfactual Inference For Sequential Experiment Design
37mLow-rank Matrix Completion: Adaptive Sampling Can Help When, How?
33mExplainable causal inference results
53mAdversarial Machine Learning and Instrumental Variables for Flexible Causal Modeling
30mTime Series Analysis via Matrix Estimation
