Matrix Completion, Counterfactuals, and Factor Analysis of Missing Data
نویسندگان
چکیده
This article proposes an imputation procedure that uses the factors estimated from a tall block along with re-rotated loadings wide to impute missing values in panel of data. Assuming strong factor structure holds for full data and its sub-blocks, it is shown common component can be consistently at four different rates convergence without requiring regularization or iteration. An asymptotic analysis estimation error obtained. application our counterfactuals when potential outcomes have structure. We study average individual treatment effects on treated establish normal distribution theory useful hypothesis testing.
منابع مشابه
High-Rank Matrix Completion and Subspace Clustering with Missing Data
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspaces. This generalizes the standard low-rank matrix completion problem to situations in which the matrix rank can be quite high or even full rank. Since the columns belong to a union of subspaces, this problem may also ...
متن کاملMissing Entries Matrix Approximation and Completion
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank approximations, similar algorithms appears recently in the literature under different names. In this work, we introduce new theorems for matrix approximation and show ...
متن کاملCorrigendum: SparRec: An effective matrix completion framework of missing data imputation for GWAS
This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the mater...
متن کاملSparRec: An effective matrix completion framework of missing data imputation for GWAS
Genome-wide association studies present computational challenges for missing data imputation, while the advances of genotype technologies are generating datasets of large sample sizes with sample sets genotyped on multiple SNP chips. We present a new framework SparRec (Sparse Recovery) for imputation, with the following properties: (1) The optimization models of SparRec, based on low-rank and l...
متن کاملGraph Matrix Completion in Presence of Outliers
Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Statistical Association
سال: 2021
ISSN: ['0162-1459', '1537-274X', '2326-6228', '1522-5445']
DOI: https://doi.org/10.1080/01621459.2021.1967163