A geometric framework for asymptotic inference of principal subspaces in PCA

09/05/2022
by   Dimbihery Rabenoro, et al.
0

In this article, we develop an asymptotic method for testing hypothesis on the set of all linear subspaces arising from PCA and for constructing confidence regions for this set. This procedure is derived from intrinsic estimation in each Grassmannian, endowed with a structure of Riemannian manifold, to which each of these subspaces belong.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2018

An Infinitesimal Probabilistic Model for Principal Component Analysis of Manifold Valued Data

We provide a probabilistic and infinitesimal view of how the principal c...
research
07/19/2021

Van Trees inequality, group equivariance, and estimation of principal subspaces

We establish non-asymptotic lower bounds for the estimation of principal...
research
02/03/2017

Intrinsic Grassmann Averages for Online Linear and Robust Subspace Learning

Principal Component Analysis (PCA) is a fundamental method for estimatin...
research
10/01/2019

Thresholds in the Lattice of Subspaces of (F_q)^n

Let Q be an ideal (downward-closed set) in the lattice of linear subspac...
research
06/09/2022

Limit results for distributed estimation of invariant subspaces in multiple networks inference and PCA

We study the problem of estimating the left and right singular subspaces...
research
08/16/2016

Parameterized Principal Component Analysis

When modeling multivariate data, one might have an extra parameter of co...
research
03/26/2022

Principal Structure Identification: Fast Disentanglement of Multi-source Dataset

Analysis of multi-source data, where data on the same objects are collec...

Please sign up or login with your details

Forgot password? Click here to reset