arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.07875cs.LGstat.ML
收藏

基于序贯蒙特卡洛的分类增量结构发现

Incremental Structure Discovery of Classification via Sequential Monte Carlo

Key Laboratory of High Confidence Software Technologies (Peking University)(高可信软件技术重点实验室(北京大学));School of Computer Science, Peking University(北京大学计算机学院)

Changze Huang, Di Wang

AI总结:

针对高斯过程分类依赖先验知识、难以适配在线数据特征偏移的问题,本文提出结合序贯蒙特卡洛的增量结构发现方法,可自动学习分类结构,在真实数据上准确率提升达10%。

摘要:

高斯过程(Gaussian Processes, GPs)为基于核函数和贝叶斯非参数学习的分类任务提供了强大的预测与不确定性理解框架。构建这类模型通常需要充足的先验知识来定义预选核函数,这对于按顺序处理数据的在线分类应用可能效果不佳,因为数据特征可能在处理过程中发生偏移。为了降低GPs对先验知识的要求,并从连续到达的数据中学习新特征,本文提出了一种新方法,能够在几乎无需先验知识的情况下自动发现复杂数据上的分类模型。我们的方法改编了近期提出的基于GP的时间序列结构发现技术,该技术整合了GPs与序贯蒙特卡洛(Sequential Monte Carlo, SMC)。我们将该技术扩展以处理GP分类中的额外潜变量,使方法能够有效且自适应地从连续输入中学习先验未知的分类结构。此外,我们的方法可通过更新模型结构来适配新一批数据。实验表明,该方法能够在合成数据和真实分类数据上自动整合多种核函数特征。在真实数据实验中,该方法在在线和离线设置下均优于多种分类方法,在一个基准数据集上实现了10%的准确率提升。

英文摘要:

Gaussian Processes (GPs) provide a powerful framework for making predictions and understanding uncertainty for classification with kernels and Bayesian non-parametric learning. Building such models typically requires strong prior knowledge to define preselect kernels, which could be ineffective for online applications of classification that sequentially process data because features of data may shift during the process. To alleviate the requirement of prior knowledge used in GPs and learn new features from data that arrive successively, this paper presents a novel method to automatically discover models of classification on complex data with little prior knowledge. Our method adapts a recently proposed technique for GP-based time-series structure discovery, which integrates GPs and Sequential Monte Carlo (SMC). We extend the technique to handle extra latent variables in GP classification, such that our method can effectively and adaptively learn a-priori unknown structures of classification from continuous input. In addition, our method adapts new batch of data with updated structures of models. Our experiments show that our method is able to automatically incorporate various features of kernels on synthesized data and real-world data for classification. In the experiments of real-world data, our method outperforms various classification methods on both online and offline setting achieving a 10\% accuracy improvement on one benchmark.

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

↑