mlsanityData to 7 Oct 2026

Distributional Shrinkage I: Universal Denoiser Beyond Tweedie's Formula

arXiv 2511.09500 ↗First posted 12 Nov 2025stat.ML cs.LG math.STcited by 0

Not on the map. Why?

Abstract (arXiv)

We study the problem of denoising when only the noise level is known, not the noise distribution. Independent noise Z corrupts a signal X, yielding the observation Y = X + σ Z with known σ ∈ (0,1). We propose universal denoisers, agnostic to both signal and noise distributions, that recover the signal distribution PX from PY. When the focus is on distributional recovery of PX rather than on individual realizations of X, our denoisers achieve order-of-magnitude improvements over the Bayes-optimal denoiser derived from Tweedie's formula, which achieves O(σ2) accuracy. They shrink PY toward PX with O(σ4) and O(σ6) accuracy in matching generalized moments and densities. Drawing on optimal transport theory, our denoisers approximate the Monge--Amp`ere equation with higher-order accuracy and can be implemented efficiently via score matching. Let q denote the density of PY. For distributional denoising, we propose replacing the Bayes-optimal denoiser, T^*(y) = y + σ2 nabla log q(y), with denoisers exhibiting less-aggressive distributional shrinkage, T1(y) = y + fracσ22 nabla log q(y), T2(y) = y + fracσ22 nabla log q(y) - fracσ48 nabla !left( frac12 | nabla log q(y) |2 + nabla · nabla log q(y) right)!.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 46 references that are in the map. First posted on arXiv 12 Nov 2025.

Builds on

19 of 46 references.

References · 19

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  3. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
  4. 2023Consistency Trajectory Models: Learning Probability Flow ODE Trajectory of Diffusioncited by 448
  5. 2023The probability flow ODE is provably fastcited by 145
  6. 2020Generative Modeling with Denoising Auto-Encoders and Langevin Samplingcited by 118
  7. 2018How Well Generative Adversarial Networks Learn Distributionscited by 78
  8. 2022Statistical Efficiency of Score Matching: The View from Isoperimetrycited by 63
  9. 2019Neural Empirical Bayescited by 46
  10. 2013Density Estimation in Infinite Dimensional Exponential Familiescited by 41
  11. 2018Deep Energy Estimator Networkscited by 34
  12. 2019Estimating Certain Integral Probability Metric (IPM) is as Hard as Estimating under the IPMcited by 11
7 more
  1. 2021Reversible Gromov-Monge Sampler for Simulation-Based Inferencecited by 10
  2. 2024Optimal convex M-estimation via score matchingcited by 9
  3. 2025Stein's unbiased risk estimate and Hyv"arinen's score matchingcited by 6
  4. 2024Denoising Diffusions with Optimal Transport: Localization, Curvature, and Multi-Scale Complexitycited by 5
  5. 2025No-Regret Generative Modeling via Parabolic Monge-Amp`ere PDEcited by 4
  6. 2023A New Perspective On Denoising Based On Optimal Transportcited by 2
  7. 2025Constrained Denoising, Empirical Bayes, and Optimal Transportcited by 2

Built on by

Not cited yet.