Dynamic Subspace Estimation with Grassmannian Geodesics

03/26/2023
by   Cameron J. Blocker, et al.
0

Dynamic subspace estimation, or subspace tracking, is a fundamental problem in statistical signal processing and machine learning. This paper considers a geodesic model for time-varying subspaces. The natural objective function for this model is non-convex. We propose a novel algorithm for minimizing this objective and estimating the parameters of the model from data with Grassmannian-constrained optimization. We show that with this algorithm, the objective is monotonically non-increasing. We demonstrate the performance of this model and our algorithm on synthetic data, video data, and dynamic fMRI data.

READ FULL TEXT

page 6

page 10

page 19

page 20

page 21

page 24

research
09/11/2018

Phaseless Subspace Tracking

This work takes the first steps towards solving the "phaseless subspace ...
research
02/03/2023

Efficient Gradient Approximation Method for Constrained Bilevel Optimization

Bilevel optimization has been developed for many machine learning tasks ...
research
09/16/2019

On-line Non-Convex Constrained Optimization

Time-varying non-convex continuous-valued non-linear constrained optimiz...
research
04/04/2015

Convex Denoising using Non-Convex Tight Frame Regularization

This paper considers the problem of signal denoising using a sparse tigh...
research
01/18/2015

Correntropy Induced L2 Graph for Robust Subspace Clustering

In this paper, we study the robust subspace clustering problem, which ai...
research
03/14/2017

Subspace Learning in The Presence of Sparse Structured Outliers and Noise

Subspace learning is an important problem, which has many applications i...
research
12/14/2019

A subspace-accelerated split Bregman method for sparse data recovery with joint l1-type regularizers

We propose a subspace-accelerated Bregman method for the linearly constr...

Please sign up or login with your details

Forgot password? Click here to reset