A theory of condition for unconstrained perturbations

09/26/2019
by   Paul Breiding, et al.
0

Traditionally, the theory of condition numbers assumes errors in the data that are constrained to be tangent to the input space. We extend this theory to unconstrained perturbations in the case when the input space is an embedded submanifold of an ambient Euclidean space. We will show that the way how the input space is curved inside the ambient space affects the condition number. Furthermore, we exhibit a connection to the sensitivity analysis of Riemannian optimization problems. We validate our main results in two prototypical applications by numerical experiments. The applications we consider are recovery of low-rank matrices in compressed sensing and n-camera triangulation in computer vision.

READ FULL TEXT

page 23

page 27

research
02/28/2021

Sensitivity of low-rank matrix recovery

We characterize the first-order sensitivity of approximately recovering ...
research
04/27/2023

Structured level-2 condition numbers of matrix functions

Matrix functions play an increasingly important role in many areas of sc...
research
04/13/2020

Analysis of The Ratio of ℓ_1 and ℓ_2 Norms in Compressed Sensing

We first propose a novel criterion that guarantees that an s-sparse sign...
research
09/04/2020

Smoothed analysis of the condition number under low-rank perturbations

Let M be an arbitrary n by n matrix of rank n-k. We study the condition ...
research
08/02/2020

Geometrically Enriched Latent Spaces

A common assumption in generative models is that the generator immerses ...
research
04/22/2019

Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence

The task of recovering a low-rank matrix from its noisy linear measureme...

Please sign up or login with your details

Forgot password? Click here to reset