Nonparametric Deconvolution and Denoising using Simulation Based Inference

• URL: http://arxiv.org/abs/2606.21907v1
• Date: Sat, 20 Jun 2026 07:03:37 GMT
• Title: Nonparametric Deconvolution and Denoising using Simulation Based Inference
• Abstract summary: We learn a latent generative model by matching the observed data distribution to the noise-convolved model distribution.<n>Our method provides a practical, theoretically grounded approach to deconvolution under generative latent distribution models.
• Score: 3.6640504352010885
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Latent signals are often obscured by measurement noise, yet encode the underlying laws and dynamics of complex systems; learning both the signals and their distributions remains a central challenge in scientific inference. The noise is often non-negligible, and the likelihoods for expressive generative models are often intractable. We utilize a convolutional maximum mean discrepancy (convMMD) loss and propose a likelihood-free framework for nonparametric density deconvolution and empirical Bayes denoising under additive measurement error. Our method learns a latent generative model by matching the observed data distribution to the noise-convolved model distribution. This yields a differentiable, simulation-based objective for multivariate homoscedastic or heteroscedastic noise, compatible with expressive sieve classes such as Gaussian mixtures and normalizing flows. The learned density then serves as an empirical prior for posterior denoising of individual latent values. Theoretically, we extend convMMD from parametric to nonparametric estimation, proving finite-sample bounds for empirical sieve minimizers and $L_2$ convergence rates under Sobolev smoothness. These rates recover the classical inverse-problem dependence: polynomial for ordinary-smooth and logarithmic for super-smooth noises. Our method provides a practical, theoretically grounded approach to deconvolution and denoising under generative latent distribution models.

Related papers

• Minimax Theory of Likelihood-Based Deep Learning for Speckle Regression [2.436681150766912]
  We study the minimax estimation of smooth nonparametric regression functions using likelihood-based deep neural network (DNN) estimators.<n>Our framework accommodates both low-dimensional and sparse high-dimensional features.
  arXiv  Detail & Related papers  (2026-07-15T17:36:23Z)
• Provably Learning Diffusion Models under the Manifold Hypothesis: Collapse and Refine [60.669081685261965]
  Diffusion models generate high-dimensional data with remarkable quality.<n>How their training efficiently learns the score function remains theoretically unexplained.<n>We instantiate this principle as Score-induced Latent Diffusion (SiLD)
  arXiv  Detail & Related papers  (2026-05-16T16:51:10Z)
• Convolutional Maximum Mean Discrepancy for Inference in Noisy Data [10.176012052682072]
  We introduce a novel framework for inference with samples corrupted by potentially heteroscedastic noise from a known distribution.<n>We establish finite-sample deviation bounds that are unaffected by measurement error and prove an equivalence between testing under noise and kernel smoothing.<n>We demonstrate the practical effectiveness of our approach through simulations and applications in astronomy and social sciences.
  arXiv  Detail & Related papers  (2026-04-13T20:06:41Z)
• Information Theoretic Learning for Diffusion Models with Warm Start [8.455757095201314]
  We derive a tighter likelihood bound for noise driven models to improve the accuracy and efficiency of maximum likelihood learning.<n>Our key insight extends the classical KL divergence Fisher information relationship to arbitrary noise perturbations.<n>Treating the diffusion process as a Gaussian channel, we show that the proposed objective upper bounds the negative log-likelihood (NLL)
  arXiv  Detail & Related papers  (2025-10-23T18:00:59Z)
• Noise Conditional Variational Score Distillation [60.38982038894823]
  Noise Conditional Variational Score Distillation (NCVSD) is a novel method for distilling pretrained diffusion models into generative denoisers.<n>By integrating this insight into the Variational Score Distillation framework, we enable scalable learning of generative denoisers.
  arXiv  Detail & Related papers  (2025-06-11T06:01:39Z)
• A Simple Analysis of Discretization Error in Diffusion Models [3.6042771517920724]
  Diffusion models, formulated as discretizations of differential equations (SDEs), achieve state-of-the-art generative performance.<n>We present a simplified theoretical framework for analyzing the the-preserving-Maruyama discretization of variance-preserving SDEs.<n>Our work bridges theoretical rigor with practical efficiency in diffusion-based generative modeling.
  arXiv  Detail & Related papers  (2025-06-10T01:46:42Z)
• On the Relation Between Linear Diffusion and Power Iteration [42.158089783398616]
  We study the generation process as a correlation machine'' We show that low frequencies emerge earlier in the generation process, where the denoising basis vectors are more aligned to the true data with a rate depending on their eigenvalues. This model allows us to show that the linear diffusion model converges in mean to the leading eigenvector of the underlying data, similarly to the prevalent power iteration method.
  arXiv  Detail & Related papers  (2024-10-16T07:33:12Z)
• A Geometric Perspective on Diffusion Models [57.27857591493788]
  We inspect the ODE-based sampling of a popular variance-exploding SDE. We establish a theoretical relationship between the optimal ODE-based sampling and the classic mean-shift (mode-seeking) algorithm.
  arXiv  Detail & Related papers  (2023-05-31T15:33:16Z)
• From Denoising Diffusions to Denoising Markov Models [38.33676858989955]
  Denoising diffusions are state-of-the-art generative models exhibiting remarkable empirical performance. We propose a unifying framework generalising this approach to a wide class of spaces and leading to an original extension of score matching.
  arXiv  Detail & Related papers  (2022-11-07T14:34:27Z)
• Optimizing Information-theoretical Generalization Bounds via Anisotropic Noise in SGLD [73.55632827932101]
  We optimize the information-theoretical generalization bound by manipulating the noise structure in SGLD. We prove that with constraint to guarantee low empirical risk, the optimal noise covariance is the square root of the expected gradient covariance.
  arXiv  Detail & Related papers  (2021-10-26T15:02:27Z)
• Multiplicative noise and heavy tails in stochastic optimization [62.993432503309485]
  empirical optimization is central to modern machine learning, but its role in its success is still unclear. We show that it commonly arises in parameters of discrete multiplicative noise due to variance. A detailed analysis is conducted in which we describe on key factors, including recent step size, and data, all exhibit similar results on state-of-the-art neural network models.
  arXiv  Detail & Related papers  (2020-06-11T09:58:01Z)
• Generative Modeling with Denoising Auto-Encoders and Langevin Sampling [88.83704353627554]
  We show that both DAE and DSM provide estimates of the score of the smoothed population density. We then apply our results to the homotopy method of arXiv:1907.05600 and provide theoretical justification for its empirical success.
  arXiv  Detail & Related papers  (2020-01-31T23:50:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.