噪声不完全二元矩阵的统计推断
Statistical Inference for Noisy Incomplete Binary Matrix
摘要:
本文研究了带噪声的不完全二进制(或1位)矩阵的统计推断。尽管不确定性量化对矩阵完备化的重要性,但大多数分类矩阵完备化文献都集中在点估计和预测上。本文进一步讨论了二元矩阵完备化的统计推断问题。在一个流行的非线性因子分析模型下,我们得到了一个点估计,并证明了它的渐近正态性。此外,我们的分析采用了灵活的遗漏项设计,不需要一个随机抽样计划所需的大多数现有的矩阵完成的渐近结果。在合理的条件下,所提出的估计是统计有效的和最优的意义下,Cramer-Rao下界渐近实现的模型参数。考虑了两种应用,包括(1)连接两种形式的教育测试和(2)连接美国参议院多年的唱名投票记录。第一个应用程序可以比较参加不同考试形式的考生,第二个应用程序可以比较没有在参议院任职的参议员的自由保守性。
英文摘要:
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 the 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。