Causal Matrix Completion under Multiple Treatments via Mixed Synthetic Nearest Neighbors
Not on the map. Why?
Abstract (arXiv)
Synthetic Nearest Neighbors (SNN) provides a principled solution to causal matrix completion under missing-not-at-random (MNAR) by exploiting local low-rank structure through fully observed anchor submatrices. However, its effectiveness critically relies on sufficient data availability within each treatment level, a condition that often fails in settings with multiple or complex treatments. In this work, we propose Mixed Synthetic Nearest Neighbors (MSNN), a new entry-wise causal identification estimator that integrates information across treatment levels. We show that MSNN retains the finite-sample error bounds and asymptotic normality guarantees of SNN, while enlarging the effective sample size available for estimation. Empirical results on synthetic and real-world datasets illustrate the efficacy of the proposed approach, especially under data-scarce treatment levels.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 10 of its 15 references that are in the map. First posted on arXiv 12 Mar 2026.
Builds on
10 of 15 references.
References · 10
- 2021Causal Matrix Completioncited by 45
- 2019Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm Assumptioncited by 29
- 2020Synthetic Interventionscited by 25
- 2018Imputation and low-rank estimation with Missing Not At Random datacited by 21
- 2023Synthetic Combinations: A Causal Inference Framework for Combinatorial Interventionscited by 12
- 2022Doubly robust nearest neighbors in factor modelscited by 9
- 2021TenIPS: Inverse Propensity Sampling for Tensor Completioncited by 7
- 2024Learning Counterfactual Distributions via Kernel Nearest Neighborscited by 2
- 2025Generalized Tensor Completion with Non-Random Missingnesscited by 1
- 2025Causal Inference on Sequential Treatments via Tensor Completioncited by 1
Built on by
Not cited yet.