arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1203.3524stat.MLcs.LG
收藏

加速二值高斯过程分类

Speeding up the binary Gaussian process classification

Aalto University(阿尔托大学)

Jarno Vanhatalo, Aki Vehtari

摘要:

高斯过程(GP)是许多概率模型的有吸引力的构建块。然而,它们的缺点是随着数据的增加而快速增加的推理时间和内存需求。这个问题可以用压缩支持的(CS)协方差函数来缓解,它产生稀疏的协方差阵,计算速度快,存储成本低。CS函数以前曾用于GP回归,但这里的重点是分类问题。这带来了新的挑战,因为后验推理必须近似完成。我们利用的期望传播算法,并显示其标准的实现必须进行修改,以获得计算的好处,从稀疏的协方差阵。我们研究了四个CS协方差函数,并表明,它们可能会导致大量的推理时间相比,全球支持的功能。

英文摘要:

Gaussian processes (GP) are attractive building blocks for many probabilistic models. Their drawbacks, however, are the rapidly increasing inference time and memory requirement alongside increasing data. The problem can be alleviated with compactly supported (CS) covariance functions, which produce sparse covariance matrices that are fast in computations and cheap to store. CS functions have previously been used in GP regression but here the focus is in a classification problem. This brings new challenges since the posterior inference has to be done approximately. We utilize the expectation propagation algorithm and show how its standard implementation has to be modified to obtain computational benefits from the sparse covariance matrices. We study four CS covariance functions and show that they may lead to substantial speed up in the inference time compared to globally supported functions.

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

↑