DeepAI AI Chat
Log In Sign Up

Adaptive PCA for Time-Varying Data

by   Salaheddin Alakkari, et al.
Trinity College Dublin

In this paper, we present an online adaptive PCA algorithm that is able to compute the full dimensional eigenspace per new time-step of sequential data. The algorithm is based on a one-step update rule that considers all second order correlations between previous samples and the new time-step. Our algorithm has O(n) complexity per new time-step in its deterministic mode and O(1) complexity per new time-step in its stochastic mode. We test our algorithm on a number of time-varying datasets of different physical phenomena. Explained variance curves indicate that our technique provides an excellent approximation to the original eigenspace computed using standard PCA in batch mode. In addition, our experiments show that the stochastic mode, despite its much lower computational complexity, converges to the same eigenspace computed using the deterministic mode.


page 1

page 2

page 3

page 4


An Acceleration Scheme for Memory Limited, Streaming PCA

In this paper, we propose an acceleration scheme for online memory-limit...

Online Memorization of Random Firing Sequences by a Recurrent Neural Network

This paper studies the capability of a recurrent neural network model to...

Approximating intractable short ratemodel distribution with neural network

We propose an algorithm which predicts each subsequent time step relativ...

Exponentially convergent stochastic k-PCA without variance reduction

We present Matrix Krasulina, an algorithm for online k-PCA, by generaliz...

A New Simulation Algorithm for Absorbing Receiver in Molecular Communication

The simulation of diffusion-based molecular communication systems with a...