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

大数据集的高效高斯过程回归

Efficient Gaussian Process Regression for Large Data Sets

Anjishnu Banerjee, David Dunson, Surya Tokdar

摘要:

高斯过程(GP)被广泛用于非参数回归,分类和时空建模,部分是由于丰富的文献的理论性质。然而,GP的一个众所周知的限制其使用的缺点是昂贵的计算,通常是O($n^3$),在执行必要的矩阵求逆时,$n$表示数据点的数量。在大型数据集中,数据存储和处理也会导致计算瓶颈,估计和预测值的数值稳定性会随着$n$而降低。为了解决这些问题,已经提出了各种各样的方法,最近的选择包括空间数据分析中的预测过程和机器学习中的回归量子集。这些方法的基本思想是使用数据的一个子集,导致对子集的敏感性和在估计未被子集很好覆盖的区域中的精细尺度结构的限制的问题。受压缩感知文献的启发,我们提出了一种将所有数据点随机投影到低维子空间的方法。我们证明了这种方法的优越性,从理论的角度来看,并通过使用模拟和真实数据的例子。一些关键词:贝叶斯;压缩感知;降维;高斯过程;随机投影;子集选择

英文摘要:

Gaussian processes (GPs) are widely used in nonparametric regression, classification and spatio-temporal modeling, motivated in part by a rich literature on theoretical properties. However, a well known drawback of GPs that limits their use is the expensive computation, typically O($n^3$) in performing the necessary matrix inversions with $n$ denoting the number of data points. In large data sets, data storage and processing also lead to computational bottlenecks and numerical stability of the estimates and predicted values degrades with $n$. To address these problems, a rich variety of methods have been proposed, with recent options including predictive processes in spatial data analysis and subset of regressors in machine learning. The underlying idea in these approaches is to use a subset of the data, leading to questions of sensitivity to the subset and limitations in estimating fine scale structure in regions that are not well covered by the subset. Motivated by the literature on compressive sensing, we propose an alternative random projection of all the data points onto a lower-dimensional subspace. We demonstrate the superiority of this approach from a theoretical perspective and through the use of simulated and real data examples. Some Keywords: Bayesian; Compressive Sensing; Dimension Reduction; Gaussian Processes; Random Projections; Subset Selection

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

↑