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

基于等距傅里叶表示从十亿数据点高效进行高斯过程回归

Equispaced Fourier representations for efficient Gaussian process regression from a billion data points

Philip Greengard, Manas Rachh, Alex Barnett

AI总结:

提出一种基于等距傅里叶网格的快速高斯过程回归算法,利用Toeplitz结构和FFT降低计算复杂度,在十亿数据点上实现高效高精度求解。

摘要:

我们提出了一种基于傅里叶变换的快速算法,用于低维高斯过程回归。该算法通过等距笛卡尔频率网格上的$M$个节点的复指数来逼近平移不变协方差核。这产生了一个具有Toeplitz结构的权重空间$M\times M$系统矩阵,因此可以通过快速傅里叶变换(FFT)在${\mathcal O}(M \log{M})$次操作内将其应用于向量,且与数据点数量$N$无关。使用非均匀FFT可以在${\mathcal O}(N + M \log{M})$次操作内建立线性系统。这使得通过迭代求解器实现高效的大规模回归成为可能,即使对于具有肥尾谱密度的核(大$M$)也是如此。我们提供了核逼近和后验均值误差的界限。针对一维、二维和三维的平方指数核与Matérn核的数值实验表明,在精度相当的情况下,通常比最先进的秩结构求解器快1-2个数量级。我们的方法允许在标准台式机上用2分钟完成$N=10^9$个数据点的二维Matérn-$\mbox{$\frac{3}{2}$}$回归,后验均值精度为$10^{-3}$。这开启了比以往大100倍的空间统计应用。

英文摘要:

We introduce a Fourier-based fast algorithm for Gaussian process regression in low dimensions. It approximates a translationally-invariant covariance kernel by complex exponentials on an equispaced Cartesian frequency grid of $M$ nodes. This results in a weight-space $M\times M$ system matrix with Toeplitz structure, which can thus be applied to a vector in ${\mathcal O}(M \log{M})$ operations via the fast Fourier transform (FFT), independent of the number of data points $N$. The linear system can be set up in ${\mathcal O}(N + M \log{M})$ operations using nonuniform FFTs. This enables efficient massive-scale regression via an iterative solver, even for kernels with fat-tailed spectral densities (large $M$). We provide bounds on both kernel approximation and posterior mean errors. Numerical experiments for squared-exponential and Matérn kernels in one, two and three dimensions often show 1-2 orders of magnitude acceleration over state-of-the-art rank-structured solvers at comparable accuracy. Our method allows 2D Matérn-$\mbox{$\frac{3}{2}$}$ regression from $N=10^9$ data points to be performed in 2 minutes on a standard desktop, with posterior mean accuracy $10^{-3}$. This opens up spatial statistics applications 100 times larger than previously possible.

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

↑