多路聚类下的算法子采样
Algorithmic subsampling under multiway clustering
AI总结:
针对多路聚类相关数据,提出新的算法子采样方法,建立相关渐近理论,发现其可抵御渐近分布退化,模拟验证推断准确性更高,并推导了两类估计量的性质,给出扫描数据应用实例。
摘要:
本文针对多路聚类相关数据提出了一种新的算法子采样(数据草图)方法。我们为多路算法子样本均值建立了新的一致弱大数定律和新的中心极限定理。由此,我们发现算法子采样的一个额外优势:它能够抵御多路聚类下渐近分布可能出现的退化,甚至非高斯退化。模拟研究支持这一新结果,并表明使用算法子采样的推断比不使用算法子采样的推断具有更高的准确性。应用这些基础渐近理论,我们推导了多路算法子采样广义矩估计量和多路算法子采样M估计量的一致性和渐近正态性。我们展示了其在扫描数据上的一个应用。
英文摘要:
This paper proposes a novel method of algorithmic subsampling (data sketching) for multiway cluster dependent data. We establish a new uniform weak law of large numbers and a new central limit theorem for the multiway algorithmic subsample means. Consequently, we discover an additional advantage of the algorithmic subsampling that it allows for robustness against potential degeneracy, and even non-Gaussian degeneracy, of the asymptotic distribution under multiway clustering. Simulation studies support this novel result, and demonstrate that inference with the algorithmic subsampling entails more accuracy than that without the algorithmic subsampling. Applying these basic asymptotic theories, we derive the consistency and the asymptotic normality for the multiway algorithmic subsampling generalized method of moments estimator and for the multiway algorithmic subsampling M-estimator. We illustrate an application to scanner data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。