arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1410.1503stat.COstat.ME
收藏

距离协方差的快速计算

Fast Computing for Distance Covariance

Xiaoming Huo, Gabor J. Szekely

摘要:

距离协方差和距离相关已被广泛用于度量一对随机变量或随机向量之间的相关性。如果距离协方差和距离相关的计算直接根据其定义来实现,则其计算复杂度为O($n^2$),这与其他更快的方法相比是不利的。在本文中,我们表明,计算距离协方差和距离相关的实值随机变量可以实现一个O(n log n)的算法,这是可比其他计算效率高的算法。我们导出的平方距离协方差的无偏估计量的新公式是一个U-统计量。这一事实意味着之前通过更复杂的方法导出的一些很好的渐近性质。我们将快速计算算法应用于一些合成数据。我们的工作将使距离相关适用于更广泛的一类应用。

英文摘要:

Distance covariance and distance correlation have been widely adopted in measuring dependence of a pair of random variables or random vectors. If the computation of distance covariance and distance correlation is implemented directly accordingly to its definition then its computational complexity is O($n^2$) which is a disadvantage compared to other faster methods. In this paper we show that the computation of distance covariance and distance correlation of real valued random variables can be implemented by an O(n log n) algorithm and this is comparable to other computationally efficient algorithms. The new formula we derive for an unbiased estimator for squared distance covariance turns out to be a U-statistic. This fact implies some nice asymptotic properties that were derived before via more complex methods. We apply the fast computing algorithm to some synthetic data. Our work will make distance correlation applicable to a much wider class of applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑