Skip to content

Commit faecc79

Browse files
committed
update wording
1 parent f25d9bd commit faecc79

File tree

1 file changed

+5
-3
lines changed

1 file changed

+5
-3
lines changed

cuqi/implicitprior/_restorator.py

Lines changed: 5 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -237,17 +237,19 @@ def get_conditioning_variables(self):
237237
class TweediePrior(MoreauYoshidaPrior):
238238
"""
239239
Alias for MoreauYoshidaPrior following Tweedie's formula framework. TweediePrior
240-
defines priors where gradients are computed using MMSE (Minimum Mean Square Error) denoisers.
240+
defines priors where gradients are computed based on Tweedie's identity that links
241+
MMSE (Minimum Mean Square Error) denoisers with the underlying smoothed prior, see:
242+
- Laumont et al. https://arxiv.org/abs/2103.04715 or https://doi.org/10.1137/21M1406349
241243
242244
Tweedie's Formula
243245
-------------------------
244-
In the context of denoising, Tweedie's formula states that for a signal x
246+
In the context of denoising, Tweedie's identity states that for a signal x
245247
corrupted by Gaussian noise:
246248
247249
∇_x log p_e(x) = (D_e(x) - x) / e
248250
249251
where D_e(x) is the MMSE denoiser output and e is the noise variance.
250-
This enables us to compute gradient with MMSE denoisers in sampling algorithms like ULA.
252+
This enables us to perform gradient-based sampling with algorithms like ULA.
251253
252254
At implementation level, TweediePrior shares identical functionality with MoreauYoshidaPrior.
253255
Thus, it is implemented as an alias of MoreauYoshidaPrior, meaning all methods,

0 commit comments

Comments
 (0)