DeepAI AI Chat
Log In Sign Up

Connection graph Laplacian methods can be made robust to noise

by   Noureddine El Karoui, et al.
berkeley college
Stanford University

Recently, several data analytic techniques based on connection graph laplacian (CGL) ideas have appeared in the literature. At this point, the properties of these methods are starting to be understood in the setting where the data is observed without noise. We study the impact of additive noise on these methods, and show that they are remarkably robust. As a by-product of our analysis, we propose modifications of the standard algorithms that increase their robustness to noise. We illustrate our results in numerical simulations.


page 1

page 2

page 3

page 4


Graph connection Laplacian and random matrices with random blocks

Graph connection Laplacian (GCL) is a modern data analysis technique tha...

Robust Multi-object Matching via Iterative Reweighting of the Graph Connection Laplacian

We propose an efficient and robust iterative solution to the multi-objec...

On the linear convergence of additive Schwarz methods for the p-Laplacian

We consider additive Schwarz methods for boundary value problems involvi...

Sparsification of the regularized magnetic Laplacian with multi-type spanning forests

In this paper, we consider a U(1)-connection graph, that is, a graph whe...

Solving Jigsaw Puzzles By The Graph Connection Laplacian

We propose a novel mathematical framework to address the problem of auto...

Robustness Analysis of the Data-Selective Volterra NLMS Algorithm

Recently, the data-selective adaptive Volterra filters have been propose...

The Vector Heat Method

This paper describes a method for efficiently computing parallel transpo...