Statistical inference for noisy incomplete binary matrix

Chen, Yunxiao ORCID: 0000-0002-7215-2324, Li, Chengcheng, Ouyang, Jing and Xu, Gongjun (2023) Statistical inference for noisy incomplete binary matrix. Journal of Machine Learning Research, 24. ISSN 1532-4435

Text (Chen_statistical-inference--published) - Published Version Available under License Creative Commons Attribution. Download (935kB)

• Author
• https://www.jmlr.org/papers/v24/22-0214....

Abstract

We consider the statistical inference for noisy incomplete binary (or 1-bit) matrix. Despite the importance of uncertainty quantification to matrix completion, most of the categorical matrix completion literature focuses on point estimation and prediction. This paper moves one step further toward statistical inference for binary matrix completion. Under a popular nonlinear factor analysis model, we obtain a point estimator and derive its asymptotic normality. Moreover, our analysis adopts a flexible missing-entry design that does not require a random sampling scheme as required by most of the existing asymptotic results for matrix completion. Under reasonable conditions, the proposed estimator is statistically efficient and optimal in the sense that the Cramer-Rao lower bound is achieved asymptotically for the model parameters. Two applications are considered, including (1) linking two forms of an educational test and (2) linking the roll call voting records from multiple years in the United States Senate. The first application enables the comparison between examinees who took different test forms, and the second application allows us to compare the liberal-conservativeness of senators who did not serve in the Senate at the same time.

Item Type:	Article
Official URL:	https://www.jmlr.org/
Additional Information:	© 2023 The Authors
Divisions:	Statistics
Subjects:	H Social Sciences > HA Statistics
Date Deposited:	06 Mar 2023 15:15
Last Modified:	17 Oct 2024 18:00
URI:	http://eprints.lse.ac.uk/id/eprint/118350

Actions (login required)

View Item