Fast, robust approximate message passing
Misha Ivkov, Tselil Schramm

TL;DR
This paper introduces a spectral pre-processing method for approximate message passing algorithms that enhances robustness against localized perturbations in the input data, ensuring solutions remain close to the uncorrupted case.
Contribution
The authors develop a spectral procedure that makes AMP algorithms robust to small, localized input perturbations, a novel approach in the context of quadratic optimization.
Findings
The method guarantees solutions close to the unperturbed AMP output.
Performance degrades gracefully as the size of the perturbation increases.
The approach applies to any separable AMP algorithm with subgaussian entries.
Abstract
We give a fast, spectral procedure for implementing approximate-message passing (AMP) algorithms robustly. For any quadratic optimization problem over symmetric matrices with independent subgaussian entries, and any separable AMP algorithm , our algorithm performs a spectral pre-processing step and then mildly modifies the iterates of . If given the perturbed input for any supported on a principal minor, our algorithm outputs a solution which is guaranteed to be close to the output of on the uncorrupted , with where as depending only on .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Quantum Computing Algorithms and Architecture · graph theory and CDMA systems
MethodsAdversarial Model Perturbation
