How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Exact-MMSE PnP-ISTA has monotone objective and vanishing gradient
Statement
Let , let , and let be a Borel probability measure on that is not concentrated on any affine hyperplane. Use the analytic Gaussian posterior-mean map and potential constructed from in the local lemma. This map is used as the exact MMSE plug-in map; no fitted parameter or training guarantee is assumed. Let be and suppose for some . Suppose the extended-real objective has finite infimum in , fix , and run from any . Then and is finite for every ; in extended-real order for ; the finite sequence converges; and , where is the ordinary gradient of its restriction to the open set . This is a stationarity conclusion only: it asserts no global minimizer, objective rate, iterate convergence, posterior sampling, or trained-network guarantee.
Statement references
Facts & Assumptions
Given: The integer , the Borel probability prior on not concentrated on any affine hyperplane, , the exact MMSE denoiser and potential constructed from , a function with the displayed -Lipschitz-gradient bound, a finite infimum for , , , and an arbitrary initial point .
Tweedie identity, positive Jacobian, and the MMSE proximal potential: maps into the open set , is smooth on and off it, and is the unique global minimizer of .
Plug-and-play ISTA with a denoiser: a PnP-ISTA update takes and sets .
Descent inequality for a Lipschitz gradient: if is with -Lipschitz gradient, then for all .
Lipschitz map, -Hölder map for rational , and contraction: an -Lipschitz map satisfies for all points in its domain.
The Euclidean inner product on : the Euclidean gradient and norm use and .
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: the Euclidean norm satisfies the triangle inequality and positive homogeneity.
Proof
For a point , define the extended-real quadratic model . By [F3] and , its smooth part majorizes and is tight at . Adding preserves the majorization; when both objective values are . Thus for every , and in extended-real order.
For put and define . By [F3], for every , , and . Its gradient is , so the triangle inequality and positive homogeneity [F6], the Lipschitz bound [F4], and the hypothesis on give . On , .
Completing the square gives . By [F1] and the exact update in [F2] with , is the unique global minimizer of . Hence . Also for , where is finite, so is finite.
The sequence is finite, nonincreasing by step 2.1, and bounded below by . It therefore converges: if , then for every some has , and every has .
Because minimizes , step 2.1 and the identity in step 1.2 yield . Summing from to gives . The nonnegative summands therefore tend to zero.
Apply [F3] to with gradient Lipschitz constant and point , taking . Then . Step 3.2 implies .
For , is a global minimizer of and belongs to the open set , where is differentiable. For every direction , the global minimum gives nonnegative directional difference quotients along and for small positive increments; taking limits gives . Thus . Since on , ; step 4.1 now proves .
Depends on
- Tweedie identity, positive Jacobian, and the MMSE proximal potential
- Plug-and-play ISTA with a denoiser
- Descent inequality for a Lipschitz gradient
- Lipschitz map, $\alpha$-Hölder map for rational $0 < \alpha \le 1$, and contraction
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
Used by
Dependency tree · two levels
50 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Xiaojian Xu, Yu Sun, Jiaming Liu, Brendt Wohlberg, and Ulugbek S. Kamilov, Provable Convergence of Plug-and-Play Priors with MMSE Denoisers, IEEE Signal Processing Letters 27 (2020), arXiv:2005.07685 (standard reference, not scraped)
- Rémi Gribonval and Mila Nikolova, On Bayesian Estimation and Proximity Operators, Applied and Computational Harmonic Analysis 50 (2021), 49–72, arXiv:1807.04021 (standard reference, not scraped)
- Neal Parikh and Stephen Boyd, Proximal Algorithms, Foundations and Trends in Optimization 1(3) (2014) (standard reference, not scraped)