As a powerful Bayesian non-parameterized algorithm, the Gaussian process (GP) has performed a significant role in Bayesian optimization and signal processing. GPs have also advanced online decision-making systems because their posterior distribution has a closed-form solution. However, its training and inference process requires all historic data to be stored and the GP model to be trained from scratch. For those reasons, several online GP algorithms, such as O-SGPR and O-SVGP, have been specifically designed for streaming settings. In this paper, we present a new theoretical framework for online GPs based on the online probably approximately correct (PAC) Bayes theory. The framework offers both a guarantee of generalized performance and good accuracy. Instead of minimizing the marginal likelihood, our algorithm optimizes both the empirical risk function and a regularization item, which is in proportion to the divergence between the prior distribution and posterior distribution of parameters. In addition to its theoretical appeal, the algorithm performs well empirically on several regression datasets. Compared to other online GP algorithms, ours yields a generalization guarantee and very competitive accuracy.
翻译:作为强大的巴伊西亚非参数化算法,Gossian进程在Bayesian优化和信号处理中发挥了重要作用。Gossian进程还提高了在线决策系统,因为其后方分布具有封闭式解决方案。然而,它的培训和推断过程要求储存所有历史数据,并从零开始对GP模式进行培训。出于这些原因,一些在线GP算法,如O-SGPR和O-SGGP, 专门为流态设置设计了几套在线GP。在本文中,我们提出了基于在线可能大致正确(PAC)贝斯理论的新的在线GP理论框架。该框架既保证了普遍绩效,又提供了良好准确性的保证。我们的算法没有尽可能降低边际可能性,而是优化了经验风险功能和规范项目,这与先前分布和参数后方分布之间的差异成正比。除了理论上的吸引力外,该算法还在许多回归数据集上进行了良好的实验性表现。与其他在线GPK算法相比,我们的算法产生了普遍化保证和非常具有竞争力的准确性。