Efficient Multiple Incremental Computation for Kernel Ridge Regression with Bayesian Uncertainty Modeling
Bo-Wei Chen, Nik Nailah Binti Abdullah, and Sangoh Park

TL;DR
This paper introduces an efficient incremental/decremental approach for Kernel Ridge Regression that reduces computational time for big data streams while maintaining accuracy, and extends it to Bayesian uncertainty modeling.
Contribution
It proposes a novel batch processing mechanism for incremental KRR applicable to large-scale and high-dimensional data, including Bayesian uncertainty integration.
Findings
Significantly reduced computational time compared to baseline methods.
Maintained accuracy equivalent to nonincremental approaches.
Effective for variable streaming data analysis.
Abstract
This study presents an efficient incremental/decremental approach for big streams based on Kernel Ridge Regression (KRR), a frequently used data analysis in cloud centers. To avoid reanalyzing the whole dataset whenever sensors receive new training data, typical incremental KRR used a single-instance mechanism for updating an existing system. However, this inevitably increased redundant computational time, not to mention applicability to big streams. To this end, the proposed mechanism supports incremental/decremental processing for both single and multiple samples (i.e., batch processing). A large scale of data can be divided into batches, processed by a machine, without sacrificing the accuracy. Moreover, incremental/decremental analyses in empirical and intrinsic space are also proposed in this study to handle different types of data either with a large number of samples or high…
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.
