从批量破碎随机样本中进行密度估计
Density estimation from batched broken random samples
AI总结:
本文提出了一种基于伪对数似然的参数方法,用于从多个破碎样本批次中估计联合分布密度,并证明了估计器在样本数量上的快速收敛性。
摘要:
破碎随机样本问题最初由DeGroot,Feder和Gole(1971,Ann. Math. Statist.)提出:在每个观测(批次)中,从具有密度p(x,y)的联合分布中随机抽取M个独立同分布点对((X_i,Y_i))_{i=1}^M,但我们只能分别观察到无序的多集合(X_i)_{i=1}^M和(Y_i)_{i=1}^M;即配对信息丢失。对于大的M,从单个观测中推断p已被证明本质上是不可能的。在本文中,我们提出了一种基于伪对数似然的参数方法,用于从N个独立的破碎样本批次中估计p,并在温和假设下证明了我们的估计器在N上的快速收敛率,并且在M上是均匀的。
英文摘要:
The broken random sample problem was first introduced by DeGroot, Feder, and Gole (1971, Ann. Math. Statist.): in each observation (batch), a random sample of $M$ i.i.d. point pairs $ ((X_i,Y_i))_{i=1}^M$ is drawn from a joint distribution with density $p(x,y)$, but we can observe only the unordered multisets $(X_i)_{i=1}^M$ and $(Y_i)_{i=1}^M$ separately; that is, the pairing information is lost. For large $M$, inferring $p$ from a single observation has been shown to be essentially impossible. In this paper, we propose a parametric method based on a pseudo-log-likelihood to estimate $p$ from $N$ i.i.d. broken sample batches, and we prove a fast convergence rate in $N$ for our estimator that is uniform in $M$, under mild assumptions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。