arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2301.01412stat.ME
收藏

大规模周期数据的可分级高斯过程

A Scalable Gaussian Process for Large-Scale Periodic Data

Yongxiang Li, Yuting Pu, Changming Cheng, Qian Xiao

摘要:

周期性高斯过程(PGP)由于其高精度而被越来越多地用于对周期性数据进行建模。然而,计算PGP的可能性具有$\mathcal{O}\left(n^{3}\right)$($n$是数据大小)的高计算复杂度,这阻碍了其广泛应用。为了解决这个问题,我们针对信号处理应用中常见的网格收集的大规模周期性数据提出了一种新型循环PGP(CPGP)模型。建议CPGP的PGP的对数似然分解成两个计算可扩展的复合对数似然,这不涉及任何近似的总和。计算CPGP的似然性仅需要$\mathcal{O}\left(p^{2}\right)$(或在某些特殊情况下$\mathcal{O}\left(p\log p\right)$)时间用于网格观测,其中段长度$p$独立于且远小于$n$。仿真和真实的案例研究表明,CPGP的优越性超过一些国家的最先进的方法,特别是对于需要周期性估计的应用。这种新的建模技术可以大大提高PGP在许多领域的适用性,并允许许多以前难以解决的问题的建模。

英文摘要:

The periodic Gaussian process (PGP) has been increasingly used to model periodic data due to its high accuracy. Yet, computing the likelihood of PGP has a high computational complexity of $\mathcal{O}\left(n^{3}\right)$ ($n$ is the data size), which hinders its wide application. To address this issue, we propose a novel circulant PGP (CPGP) model for large-scale periodic data collected at grids that are commonly seen in signal processing applications. The proposed CPGP decomposes the log-likelihood of PGP into the sum of two computationally scalable composite log-likelihoods, which do not involve any approximations. Computing the likelihood of CPGP requires only $\mathcal{O}\left(p^{2}\right)$ (or $\mathcal{O}\left(p\log p\right)$ in some special cases) time for grid observations, where the segment length $p$ is independent of and much smaller than $n$. Simulations and real case studies are presented to show the superiority of CPGP over some state-of-the-art methods, especially for applications requiring periodicity estimation. This new modeling technique can greatly advance the applicability of PGP in many areas and allow the modeling of many previously intractable problems.

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

↑