Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Cui, Han, Yu, Zhiyuan, Liu, Jingbo
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2407.10763
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909538047754240
author Cui, Han
Yu, Zhiyuan
Liu, Jingbo
author_facet Cui, Han
Yu, Zhiyuan
Liu, Jingbo
contents Recently, Approximate Message Passing (AMP) has been integrated with stochastic localization (diffusion model) by providing a computationally efficient estimator of the posterior mean. Existing (rigorous) analysis typically proves the success of sampling for sufficiently small noise, but determining the exact threshold involves several challenges. In this paper, we focus on sampling from the posterior in the linear inverse problem, with an i.i.d. random design matrix, and show that the threshold for sampling coincides with that of posterior mean estimation. We give a proof for the convergence in smoothed KL divergence whenever the noise variance $Δ$ is below $Δ_{\rm AMP}$, which is the computation threshold for mean estimation introduced in (Barbier et al., 2020). We also show convergence in the Wasserstein distance under the same threshold assuming a dimension-free bound on the operator norm of the posterior covariance matrix, a condition strongly suggested by recent breakthroughs on operator norm bounds in similar replica symmetric systems. A key observation in our analysis is that phase transition does not occur along the sampling and interpolation paths assuming $Δ<Δ_{\rm AMP}$.
format Preprint
id arxiv_https___arxiv_org_abs_2407_10763
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Sampling from the Random Linear Model via Stochastic Localization Up to the AMP Threshold
Cui, Han
Yu, Zhiyuan
Liu, Jingbo
Statistics Theory
Recently, Approximate Message Passing (AMP) has been integrated with stochastic localization (diffusion model) by providing a computationally efficient estimator of the posterior mean. Existing (rigorous) analysis typically proves the success of sampling for sufficiently small noise, but determining the exact threshold involves several challenges. In this paper, we focus on sampling from the posterior in the linear inverse problem, with an i.i.d. random design matrix, and show that the threshold for sampling coincides with that of posterior mean estimation. We give a proof for the convergence in smoothed KL divergence whenever the noise variance $Δ$ is below $Δ_{\rm AMP}$, which is the computation threshold for mean estimation introduced in (Barbier et al., 2020). We also show convergence in the Wasserstein distance under the same threshold assuming a dimension-free bound on the operator norm of the posterior covariance matrix, a condition strongly suggested by recent breakthroughs on operator norm bounds in similar replica symmetric systems. A key observation in our analysis is that phase transition does not occur along the sampling and interpolation paths assuming $Δ<Δ_{\rm AMP}$.
title Sampling from the Random Linear Model via Stochastic Localization Up to the AMP Threshold
topic Statistics Theory
url https://arxiv.org/abs/2407.10763