Compressed Subspace Learning Based on Canonical Angle Preserving Property

07/14/2019
by   Yuchen Jiao, et al.
0

A standard way to tackle the challenging task of learning from high-dimensional data is to exploit its underlying low-dimensional structure. Union of Subspaces (UoS) is a popular and powerful model to describe such structure which assumes that the data lies in the union of a collection of low-dimensional subspaces. Extracting useful information from UoS structure of data has become the task of the newly-emerged field of subspace learning. In this paper, we investigate how random projection, an efficient and commonly-used method for dimensionality reduction, distorts the UoS structure of data. Here the fine details of UoS structure are described in terms of canonical angles (also known as principal angles) between subspaces, which is a well-known characterization for relative subspace positions by a sequence of angles. It is proved that random projection with the so-called Johnson-Lindenstrauss (JL) property approximately preserves canonical angles between subspaces. As canonical angles completely determine the relative position of subspaces, our result indicates that random projection approximately preserves structure of a union of subspaces. Inspired by this result, we propose in this paper the framework of Compressed Subspace Learning (CSL), which enables to extract useful information from the UoS structure of data in a greatly reduced dimension and has the advantage of lower computational cost and memory requirements. We demonstrate the effectiveness of CSL in various subspace-related tasks such as subspace visualization, active subspace detection, and subspace clustering.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2014

Subspace clustering of dimensionality-reduced data

Subspace clustering refers to the problem of clustering unlabeled high-d...
research
05/23/2019

Johnson-Lindenstrauss Property Implies Subspace Restricted Isometry Property

Dimensionality reduction is a popular approach to tackle high-dimensiona...
research
07/25/2019

Theory of Spectral Method for Union of Subspaces-Based Random Geometry Graph

Spectral Method is a commonly used scheme to cluster data points lying c...
research
01/17/2014

An Analysis of Random Projections in Cancelable Biometrics

With increasing concerns about security, the need for highly secure phys...
research
11/08/2021

Grassmannian learning mutual subspace method for image set recognition

This paper addresses the problem of object recognition given a set of im...
research
10/05/2020

Subspace Embeddings Under Nonlinear Transformations

We consider low-distortion embeddings for subspaces under entrywise nonl...
research
04/17/2020

Projection-Cost-Preserving Sketches: Proof Strategies and Constructions

In this note we illustrate how common matrix approximation methods, such...

Please sign up or login with your details

Forgot password? Click here to reset