从信念传播推导AMP方程用于ℓ₂最小化问题
Derivation of the AMP equations from belief propagation for the $\ell_2$ minimisation problem
AI总结:
本文推导了从信念传播到AMP方程的转换,用于ℓ₂最小化问题中的信号恢复。
摘要:
我们考虑ℓ_p最小化问题,即寻找向量x∈R^N,使其在约束y=Ax下最小化‖x‖_p,其中y∈R^m已知,A是m×N随机矩阵,其独立同分布的中心化条目具有次高斯分布(m<N)。这可以视为统计力学问题的零温度版本,在其中引入了适合的吉布斯测度。对于此类吉布斯测度,存在相关的信念传播方程。我们证明在最简单的情况p=2下,信念传播迭代所得到的分布的均值在渐近意义上满足近似消息传递方程。
英文摘要:
We consider the $\ell_p$-minimisation, which consists of finding the vector $x\in\mathbb{R}^N$ which minimises $\|x\|_p$ subject to the linear constraint $y=Ax$, where $y\in\mathbb{R}^m$ is given and $A$ is a $m\times N$ random matrix with i.i.d. sub-Gaussian centred entries ($m<N$). This can be viewed as the zero temperature version of a statistical mechanics problem, in which one introduces a suitable Gibbs measure on $\mathbb{R}^N$. To such a Gibbs measure there are associated belief propagation equations. We prove in the easiest case $p=2$ that the means of the distributions obtained by the belief propagation iteration satisfy asymptotically the approximate message passing equations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。