Universality in polytope phase transitions and message passing algorithms

We consider a class of nonlinear mappings FAN in RN indexed by symmetric random matrices with independent entries. Within spin glass theory, special cases of these mapping correspond to iterating the TAP equations and were studied by Bolthausen. Within information theory, they are known as “approximate message passing: algorithms. We study the high-dimensional (large N) behavior of the iterates of F for polynomial functions F, and prove that it is universal: that is, it depends only on the first two moments of the entries of A, under a sub-Gaussian tail condition. As an application, we prove the universality of a certain phase transition arising in polytope geometry and compressed sensing. This solves, for a broad class of random projections, a conjecture by David Donoho and Jared Tanner