Incremental kernel PCA and the Nyström method

by   Fredrik Hallgren, et al.

Incremental versions of batch algorithms are often desired, for increased time efficiency in the streaming data setting, or increased memory efficiency in general. In this paper we present a novel algorithm for incremental kernel PCA, based on rank one updates to the eigendecomposition of the kernel matrix, which is more computationally efficient than comparable existing algorithms. We extend our algorithm to incremental calculation of the Nyström approximation to the kernel matrix, the first such algorithm proposed. Incremental calculation of the Nyström approximation leads to further gains in memory efficiency, and allows for empirical evaluation of when a subset of sufficient size has been obtained.


page 1

page 2

page 3

page 4


Streaming Kernel PCA Algorithm With Small Space

Principal Component Analysis (PCA) is a widely used technique in machine...

ROIPCA: An Online PCA algorithm based on rank-one updates

Principal components analysis (PCA) is a fundamental algorithm in data a...

Efficient Multiple Incremental Computation for Kernel Ridge Regression with Bayesian Uncertainty Modeling

This study presents an efficient incremental/decremental approach for bi...

Streaming k-PCA: Efficient guarantees for Oja's algorithm, beyond rank-one updates

We analyze Oja's algorithm for streaming k-PCA and prove that it achieve...

Opacity of Memory Management in Software Transactional Memory

Opacity of Transactional Memory is proposed to be established by increme...

Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting

We derive a new proof to show that the incremental resparsification algo...

Code Repositories

Please sign up or login with your details

Forgot password? Click here to reset