Average performance analysis of the stochastic gradient method for online PCA

04/03/2018
by   Stéphane Chrétien, et al.
0

This paper studies the complexity of the stochastic gradient algorithm for PCA when the data are observed in a streaming setting. We also propose an online approach for selecting the learning rate. Simulation experiments confirm the practical relevance of the plain stochastic gradient approach and that drastic improvements can be achieved by learning the learning rate.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/20/2021

Stochastic Learning Rate Optimization in the Stochastic Approximation and Online Learning Settings

In this work, multiplicative stochasticity is applied to the learning ra...
research
05/25/2022

Learning from time-dependent streaming data with online stochastic algorithms

We study stochastic algorithms in a streaming framework, trained on samp...
research
06/04/2015

Rivalry of Two Families of Algorithms for Memory-Restricted Streaming PCA

We study the problem of recovering the subspace spanned by the first k p...
research
02/17/2021

POLA: Online Time Series Prediction by Adaptive Learning Rates

Online prediction for streaming time series data has practical use for m...
research
09/21/2019

Using Statistics to Automate Stochastic Optimization

Despite the development of numerous adaptive optimizers, tuning the lear...
research
05/28/2019

AdaOja: Adaptive Learning Rates for Streaming PCA

Oja's algorithm has been the cornerstone of streaming methods in Princip...
research
04/03/2019

Exponentially convergent stochastic k-PCA without variance reduction

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

Please sign up or login with your details

Forgot password? Click here to reset