Structured Sampling for Robust Euclidean Distance Geometry

Abstract

This paper addresses the problem of estimating the positions of points from distance measurements corrupted by sparse outliers. Specifically, we consider a setting with two types of nodes: anchor nodes, for which exact distances to each other are known, and target nodes, for which complete but corrupted distance measurements to the anchors are available. To tackle this problem, we propose a novel algorithm powered by Nyström method and robust principal component analysis. Our method is computationally efficient as it processes only a localized subset of the distance matrix and does not require distance measurements between target nodes. Empirical evaluations on synthetic datasets, designed to mimic sensor localization, and on molecular experiments, demonstrate that our algorithm achieves accurate recovery with a modest number of anchors, even in the presence of high levels of sparse outliers.

References in corpus (16)

• Efficient Estimation of Word Representations in Vector Space
• Euclidean Distance Matrices: Essential Theory, Algorithms and Applications
• Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation
• Robust CUR Decomposition: Theory and Imaging Applications
• Accelerated Structured Alternating Projections for Robust Spectrally Sparse Signal Recovery
• Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
• Robust PCA by Manifold Optimization
• Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection
• Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling
• Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning
• Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent
• On the Robustness of Cross-Concentrated Sampling for Matrix Completion
• Deeply Learned Robust Matrix Completion for Large-scale Low-rank Data Recovery
• Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees
• Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery
• Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization