Incremental Structure Discovery of Classification via Sequential Monte Carlo
Changze Huang, Di Wang

TL;DR
This paper introduces a novel method combining Gaussian Processes and Sequential Monte Carlo to automatically discover and adapt classification models with minimal prior knowledge, suitable for online data processing.
Contribution
It extends GP-based structure discovery with SMC to handle latent variables and adapt models dynamically as new data arrives, improving online classification performance.
Findings
Automatically discovers classification structures from data.
Outperforms existing methods with up to 10% accuracy gain.
Effectively learns features on both synthetic and real-world data.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Machine Learning and Data Classification · Time Series Analysis and Forecasting
MethodsGreedy Policy Search
