Online Adaptive Principal Component Analysis and Its extensions

01/23/2019
by   Jianjun Yuan, et al.
0

We propose algorithms for online principal component analysis (PCA) and variance minimization for adaptive settings. Previous literature has focused on upper bounding the static adversarial regret, whose comparator is the optimal fixed action in hindsight. However, static regret is not an appropriate metric when the underlying environment is changing. Instead, we adopt the adaptive regret metric from the previous literature and propose online adaptive algorithms for PCA and variance minimization, that have sub-linear adaptive regret guarantees. We demonstrate both theoretically and experimentally that the proposed algorithms can adapt to the changing environments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2023

Two derivations of Principal Component Analysis on datasets of distributions

In this brief note, we formulate Principal Component Analysis (PCA) over...
research
02/06/2020

Minimizing Dynamic Regret and Adaptive Regret Simultaneously

Regret minimization is treated as the golden rule in the traditional stu...
research
04/19/2018

On optimal allocation of treatment/condition variance in principal component analysis

The allocation of a (treatment) condition-effect on the wrong principal ...
research
11/11/2015

Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?

In the current context of data explosion, online techniques that do not ...
research
02/19/2017

Online Robust Principal Component Analysis with Change Point Detection

Robust PCA methods are typically batch algorithms which requires loading...
research
07/01/2022

Efficient Adaptive Regret Minimization

In online convex optimization the player aims to minimize her regret aga...
research
06/16/2015

PCA with Gaussian perturbations

Most of machine learning deals with vector parameters. Ideally we would ...

Please sign up or login with your details

Forgot password? Click here to reset