缺失面板数据的逐项推断:一种简单且实例最优的方法
Entrywise Inference for Missing Panel Data: A Simple and Instance-Optimal Approach
AI总结:
本文针对交错采用导致的面板数据缺失问题,提出一种基于矩阵代数和SVD的简单高效估计方法,并构造了实例最优的逐项置信区间,其宽度达到贝叶斯Cramér-Rao下界。
摘要:
纵向或面板数据可以表示为一个矩阵,其行以个体为单位索引,列以时间为单位索引。我们考虑由交错采用引起的面板数据缺失版本所关联的推断问题。我们提出了一种计算高效的估计程序,仅涉及简单的矩阵代数和奇异值分解,并证明了其在估计每个缺失项时误差的非渐近高概率界。通过控制与适当缩放的高斯变量的接近程度,我们开发并分析了一种数据驱动的程序,用于构造具有预先指定覆盖率的逐项置信区间。尽管方法简单,我们的程序却具有实例最优性:我们证明其置信区间的宽度与通过贝叶斯Cramér-Rao论证导出的非渐近实例下界相匹配。我们在多种数值示例中展示了理论刻画结果的精确性。我们的分析基于一个适用于矩阵去噪模型中基于SVD算法的一般推断工具箱,该工具箱可能具有独立的研究价值。
英文摘要:
Longitudinal or panel data can be represented as a matrix with rows indexed by units and columns indexed by time. We consider inferential questions associated with the missing data version of panel data induced by staggered adoption. We propose a computationally efficient procedure for estimation, involving only simple matrix algebra and singular value decomposition, and prove non-asymptotic and high-probability bounds on its error in estimating each missing entry. By controlling proximity to a suitably scaled Gaussian variable, we develop and analyze a data-driven procedure for constructing entrywise confidence intervals with pre-specified coverage. Despite its simplicity, our procedure turns out to be instance-optimal: we prove that the width of our confidence intervals match a non-asymptotic instance-wise lower bound derived via a Bayesian Cramér-Rao argument. We illustrate the sharpness of our theoretical characterization on a variety of numerical examples. Our analysis is based on a general inferential toolbox for SVD-based algorithm applied to the matrix denoising model, which might be of independent interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。