Distributed Robust Subspace Recovery
From MaRDI portal
Publication:4685332
Abstract: We propose distributed solutions to the problem of Robust Subspace Recovery (RSR). Our setting assumes a huge dataset in an ad hoc network without a central processor, where each node has access only to one chunk of the dataset. Furthermore, part of the whole dataset lies around a low-dimensional subspace and the other part is composed of outliers that lie away from that subspace. The goal is to recover the underlying subspace for the whole dataset, without transferring the data itself between the nodes. We first apply the Consensus-Based Gradient method to the Geometric Median Subspace algorithm for RSR. For this purpose, we propose an iterative solution for the local dual minimization problem and establish its r-linear convergence. We then explain how to distributedly implement the Reaper and Fast Median Subspace algorithms for RSR. The proposed algorithms display competitive performance on both synthetic and real data.
Recommendations
- Distributed estimation based on multi-hop subspace decomposition
- Robust Recovery of Signals From a Structured Union of Subspaces
- Robust Distributed Estimation Using the Embedded Subgraphs Algorithm
- Fast, robust and non-convex subspace recovery
- Robust and scalable distributed recursive least squares
- Distributed matrix completion and robust factorization
- Subspace Methods for Joint Sparse Recovery
- Distributed reconstruction via alternating direction method
- A robust and efficient algorithm for distributed compressed sensing
- Distributed Recovery of Jointly Sparse Signals Under Communication Constraints
Cites work
- scientific article; zbMATH DE number 1893714 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 3352737 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A novel M-estimator for robust PCA
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
- Consensus-Based Distributed Total Least Squares Estimation in Ad Hoc Wireless Sensor Networks
- Consensus-based distributed support vector machines
- Convex Analysis
- Cooperative distributed multi-agent optimization
- Diffusion Adaptation Strategies for Distributed Optimization and Learning Over Networks
- Distributed Sparse Linear Regression
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Fast, robust and non-convex subspace recovery
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
- On the Convergence of the Lagged Diffusivity Fixed Point Method in Total Variation Image Restoration
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Regularization techniques for learning with matrices
- Robust computation of linear models by convex relaxation
Cited in
(3)
This page was built for publication: Distributed Robust Subspace Recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685332)
