Simultaneous robust subspace recovery and semi-stability of quiver representations

03/05/2020
by   Calin Chindris, et al.
0

We consider the problem of simultaneously finding lower-dimensional subspace structures in a given m-tuple of possibly corrupted, high-dimensional data sets all of the same size. We refer to this problem as simultaneous robust subspace recovery (SRSR) and provide a quiver invariant theoretic approach to it. We show that SRSR is a particular case of the more general problem of effectively deciding whether a quiver representation is semi-stable (in the sense of Geometric Invariant Theory) and, in case it is not, finding a subrepresentation certifying in an optimal way that the representation is not semi-stable. In this paper, we show that SRSR and the more general quiver semi-stability problem can be solved effectively.

READ FULL TEXT

page 10

page 14

research
03/02/2018

An Overview of Robust Subspace Recovery

This paper will serve as an introduction to the body of work on robust s...
research
03/30/2018

Fast and Robust Subspace Clustering Using Random Projections

Over the past several decades, subspace clustering has been receiving in...
research
12/30/2019

Basis Pursuit and Orthogonal Matching Pursuit for Subspace-preserving Recovery: Theoretical Analysis

Given an overcomplete dictionary A and a signal b = Ac^* for some sparse...
research
11/30/2022

Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity

Let G be a graph and suppose we are given, for each v ∈ V(G), a strict o...
research
01/20/2020

Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications

The problem of finding the sparsest vector (direction) in a low dimensio...
research
08/31/2020

Edmonds' problem and the membership problem for orbit semigroups of quiver representations

A central problem in algebraic complexity, posed by J. Edmonds, asks to ...
research
06/24/2014

Fast, Robust and Non-convex Subspace Recovery

This work presents a fast and non-convex algorithm for robust subspace r...

Please sign up or login with your details

Forgot password? Click here to reset