• Corpus ID: 238226888

# Causal Matrix Completion

@article{Agarwal2021CausalMC,
title={Causal Matrix Completion},
author={Anish Agarwal and Munther A. Dahleh and Devavrat Shah and Dennis Shen},
journal={ArXiv},
year={2021},
volume={abs/2109.15154}
}
• Published 30 September 2021
• Computer Science, Mathematics
• ArXiv
Matrix completion is the study of recovering an underlying matrix from a sparse subset of noisy observations. Traditionally, it is assumed that the entries of the matrix are “missing completely at random” (MCAR), i.e., each entry is revealed at random, independent of everything else, with uniform probability. This is likely unrealistic due to the presence of “latent confounders”, i.e., unobserved factors that determine both the entries of the underlying matrix and the missingness pattern in the…

## Figures and Tables from this paper

• Computer Science
2022 30th European Signal Processing Conference (EUSIPCO)
• 2022
Through a series of experiments, this paper studies and compares the performance of various LRMC algorithms that were originally successful for data-independent sampling patterns and considers various settings where the sampling mask is dependent on the underlying data values.
• A. Agarwal
• Computer Science
ACM SIGMETRICS Performance Evaluation Review
• 2022
This work explores how to answer counterfactual questions using observational data-which is increasingly available due to digitization and pervasive sensors-and/or very limited experimental data, and discusses connections between matrix/tensor completion and time series analysis and reinforcement learning.
• Computer Science
• 2022
Estimation of CausalSim on both real and synthetic datasets and two use cases shows that it provides accurate counterfactual predictions, reducing prediction error by 44% and 53% on average compared to expert-designed and supervised learning baselines.
• Economics
• 2022
It is crucial to successfully quantify causal eﬀects of a policy intervention to determine whether the policy achieved the desired outcomes. We present a deterministic approach to a classical method
• Economics
ArXiv
• 2022
We propose a generalization of the synthetic control and synthetic interventions methodology to the dynamic treatment regime. We consider the estimation of unit-specific treatment effects from panel
• Economics
ArXiv
• 2022
We consider the classical problem of decision-making using panel data , in which a decision-maker, called the principal, gets noisy, repeated measurements of multiple units (or agents). We consider a
• Computer Science
ArXiv
• 2022
This work designs two-phase bandit algorithms that first use subsampling and low-rank matrix estimation to obtain a substantially smaller targeted set of products and then apply a UCB procedure on the target products to find the best one.
• Mathematics
ArXiv
• 2022
We consider the problem of counterfactual inference in sequentially designed experiments wherein a collection of N units each undergo a sequence of interventions for T time periods, based on policies
• Computer Science, Mathematics
• 2022
A latent factors model is introduced over the counterfactual means that serves as a non-parametric generalization of the non-linear mixed effects model and the bilinear latent factor model considered in prior works to provide inference guarantees for thecounterfactual mean at the smallest possible scale.

## References

SHOWING 1-10 OF 61 REFERENCES

• Computer Science
NeurIPS
• 2019
This paper tackles MNAR matrix completion by solving a different matrix completion problem first that recovers missingness probabilities, and establishes finite-sample error bounds for how accurate these probability estimates are and how well these estimates debias standard matrix completion losses for the original matrix to be completed.
• Computer Science, Psychology
NeurIPS
• 2018
This work proposes a latent variable named "user intent" to govern the temporal changes of item missingness, and a hidden Markov model to represent such a process, and explores two types of constraints to achieve a more compact and interpretable representation of user intents.
• Computer Science, Mathematics
NeurIPS
• 2020
An estimation of the loading coefficients and a data imputation method based on estimators of means, variances and covariances of missing variables, which prove identifiability of the PPCA parameters.
This paper introduces a simple estimation procedure, called Universal Singular Value Thresholding (USVT), that works for any matrix that has "a little bit of structure" and achieves the minimax error rate up to a constant factor.
• Computer Science
IEEE Transactions on Information Theory
• 2010
This paper shows that, under certain incoherence assumptions on the singular vectors of the matrix, recovery is possible by solving a convenient convex program as soon as the number of entries is on the order of the information theoretic limit (up to logarithmic factors).
• Computer Science
ArXiv
• 2012
A theory of matrix completion for the extreme case of noisy 1-bit observations is developed and it is shown that the maximum likelihood estimate under a suitable constraint returns an accurate estimate of M when ||M||_{\infty} <= \alpha, and rank(M) <= r.
• Computer Science, Mathematics
Proceedings of the National Academy of Sciences
• 2019
A simple procedure to compensate for the bias of the widely used convex and nonconvex estimators and derive distributional characterizations for the resulting debiased estimators, which enable optimal construction of confidence intervals/regions for the missing entries and the low-rank factors.
• Computer Science
ICML
• 2019
This work proposes an estimator that integrates the imputed errors and propensities in a doubly robust way to obtain unbiased performance estimation and alleviate the effect of the propensity variance.
• Computer Science
Statistics and Computing
• 2020
This paper proposes matrix completion methods to recover Missing Not At Random (MNAR) data to predict if the doctors should administrate tranexomic acid to patients with traumatic brain injury, that would limit excessive bleeding.
• Computer Science, Mathematics
IEEE Transactions on Information Theory
• 2022
Two new estimators are proposed, based on singular value thresholding and nuclear norm minimization, to recover the matrix under this assumption, and involve no tuning parameters, and are shown to be consistent under a low rank assumption.