Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Easy, robust approximate message passing for planted spike models
Misha Ivkov, Tselil Schramm
We present a simple and efficient algorithm for robust approximate message passing (AMP) in the spiked matrix setting. In particular, let be a sufficiently small cons…
cs.DS2024
Fast, robust approximate message passing
Misha Ivkov, Tselil Schramm
We give a fast, spectral procedure for implementing approximate-message passing (AMP) algorithms robustly. For any quadratic optimization problem over symmetric matrices with i…
cs.DS2023
Semidefinite programs simulate approximate message passing robustly
Misha Ivkov, Tselil Schramm
Approximate message passing (AMP) is a family of iterative algorithms that generalize matrix power iteration. AMP algorithms are known to optimally solve many average-case optimiza…