We extend the blindspot model for self-supervised denoising to handle Poisson-Gaussian noise and introduce an improved training scheme that avoids hyperparameters and adapts the denoiser to the test data. Self-supervised models for denoising learn to denoise from only noisy data and do not require corresponding clean i…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,694 papers · 148 categories
Trend · papers per month
48 results for “Gaussian denoising”
Fluorescence microscopy has enabled a dramatic development in modern biology. Due to its inherently weak signal, fluorescence microscopy is not only much noisier than photography, but also presented with Poisson-Gaussian noise where Poisson noise, or shot noise, is the dominating noise source. To get clean fluorescence…
New blurring diffusion models bridge heat dissipation and denoising.
problem Developing a new generative modeling approach.
method Connecting blurring to Gaussian diffusion with non-isotropic noise.
result Proposed Blurring Diffusion Models offer the best of both Gaussian denoising and inverse heat dissipation.
Gaussian Interpolation Flowsstat.ML
Study on Gaussian interpolation flows for generative modeling.
problem Theoretical properties and regularizing effect of Gaussian denoising in continuous normalizing flows.
method Unified framework of Gaussian interpolation flow, Lipschitz regularity, existence and uniqueness of flow, stability analysis.
result Established theoretical properties of Gaussian interpolation flows, including Lipschitz continuity and existence of flow.
Study improves denoising score matching under relaxed manifold assumptions.
problem Improving denoising score matching under relaxed manifold assumptions.
method Model density with nonparametric Gaussian mixtures, relax manifold assumption, derive non-asymptotic bounds.
result Non-asymptotic bounds on approximation and generalization errors, rates of convergence determined by intrinsic dimension.
Exact posterior score estimation for solving linear inverse problems
problem Solving linear inverse problems
method Derive the exact posterior score and use it as a denoising training objective
result EPS outperforms training-free and training-based baselines on various metrics
Nonparametric empirical Bayes denoising on Riemannian manifolds
problem Denoising measurements on compact Riemannian manifolds
method Using a surrogate oracle denoiser based on the marginal distribution of measurements
result Achieving nearly the Bayes risk in a low-noise regime
Study on autoencoder denoising in high dimensions.
problem Denoising data from Gaussian mixtures.
method Two-layer non-linear autoencoder with skip connection in high-dimensional limit.
result Closed-form expressions for denoising mean-squared test error.
New method DDVI improves posterior inference for deep Gaussian processes.
problem Inference of inducing points in DGPs is challenging and biased.
method DDVI uses denoising diffusion SDE and score matching for posterior approximation.
result Empirically shows DDVI outperforms baseline methods in inducing point inference.
This paper extends neural network approximation results to denoising diffusion models.
problem Improving the efficiency and accuracy of generative models.
method Leveraging connections to stochastic control and neural network approximation.
result Established neural network approximation results for the Föllmer drift are extended to denoising diffusion models.
New linear denoiser outperforms standard Wiener filter in noisy data.
problem Improving denoising performance for unknown covariance data.
method Synthetically constructed noisy samples to train a linear denoiser using least-squares approximation.
result Optimal denoiser found using the Convex Gaussian Min-Max Theorem (CGMT) for proportional regime.
In this paper, we consider Bayesian image denoising based on a Gaussian Markov random field (GMRF) model, for which we propose an new algorithm. Our method can solve Bayesian image denoising problems, including hyperparameter estimation, in -time, where is the number of pixels in a given image. From the persp…
Paper compares optimal denoising methods for generative models, finding different results based on data regularity.
problem Optimizing denoising in score-based generative models for various data types.
method Comparison of full-denoising and half-denoising approaches, analyzing performance in terms of distribution distances.
result Different denoising methods perform better under different data regularity conditions.
A denoising algorithm seeks to remove noise, errors, or perturbations from a signal. Extensive research has been devoted to this arena over the last several decades, and as a result, today's denoisers can effectively remove large amounts of additive white Gaussian noise. A compressed sensing (CS) reconstruction algorit…
DDS samples from noisy data by reversing diffusion, providing theoretical guarantees.
problem Sampling from unnormalized densities.
method Denoising diffusion process, score matching, optimal control, Schrödinger bridges.
result DDS provides theoretical guarantees for sampling.
We study the Nonparametric Maximum Likelihood Estimator (NPMLE) for estimating Gaussian location mixture densities in -dimensions from independent observations. Unlike usual likelihood-based methods for fitting mixtures, NPMLEs are based on convex optimization. We prove finite sample results on the Hellinger accurac…
We prove an exact relationship between the optimal denoising function and the data distribution in the case of additive Gaussian noise, showing that denoising implicitly models the structure of data allowing it to be exploited in the unsupervised learning of representations. This result generalizes a known relationship…
Unified framework for denoising models across various spaces.
problem Improving generative models and approximate posterior simulation.
method Generalizing denoising diffusions to a broader class of spaces using a new extension of score matching.
result Unified models for denoising and posterior simulation.
GT is a new method for denoising and enhancing datasets using Gaussian density estimates.
problem Improving latent structures in datasets.
method GT is an iterative method that generates a new distance function by computing the -Wasserstein distance between Gaussian density estimates.
result GT is stable under perturbations and asymptotically ellipsoidal neighborhoods in the continuous case.
Plug-and-play L-GM-AMP improves CS recovery for any i.i.d. source prior.
problem Efficiently recovering signals from compressed measurements with unknown priors.
method Deep learning with Gaussian-mixture model to approximate source prior, combined with learned denoising.
result L-GM-AMP achieves state-of-the-art performance without prior knowledge of source distribution.
Introduces Star-Shaped DDPMs for non-Gaussian distributions.
problem Difficulties in defining DDPMs for non-Gaussian distributions.
method Star-shaped diffusion process, duality with specific Markovian diffusions, efficient algorithms.
result SS-DDPMs can model distributions like Beta, von Mises-Fisher, Dirichlet, Wishart.
PDDS samples from unnormalized densities using iterative particle scheme.
problem Sampling from unnormalized probability densities.
method Iterative particle scheme with novel score matching loss.
result Asymptotically consistent estimates for multimodal and high-dimensional tasks.
Most existing image denoising approaches assumed the noise to be homogeneous white Gaussian distributed with known intensity. However, in real noisy images, the noise models are usually unknown beforehand and can be much more complex. This paper addresses this problem and proposes a novel blind image denoising algorith…
Diffusion models achieve high-quality samples from complex high-dimensional Gaussian mixtures without scaling with dimension.
problem Achieving accurate sampling from high-dimensional distributions using diffusion models.
method Investigates the effectiveness of diffusion models in sampling from Gaussian Mixture Models (GMMs) without scaling with dimension.
result DDPM requires at most iterations to attain an -accurate distribution in total variation distance, independent of dimension and number of components.
GDiff tackles blind denoising with Gibbs sampling and Monte Carlo inference.
problem Blind denoising of signals with unknown noise parameters.
method Gibbs Diffusion (GDiff) method that alternates sampling steps from a conditional diffusion model and a Monte Carlo sampler.
result GDiff achieves blind denoising of natural images and cosmic microwave background data.
The Gaussian mechanism is an essential building block used in multitude of differentially private data analysis algorithms. In this paper we revisit the Gaussian mechanism and show that the original analysis has several important limitations. Our analysis reveals that the variance formula for the original mechanism is …
New method quantifies uncertainty in denoising models.
problem Uncertainty quantification in denoising models.
method Derives a relation between posterior moments and derivatives, uses it for efficient uncertainty quantification.
result Efficient computation of principal components and full marginal distributions of the posterior.
Automated denoising score matching handles nonlinear diffusion processes.
problem Nonlinear diffusion processes limit generative modeling and property estimation.
method Local-DSM using local increments and Taylor expansions.
result Tractable training and score estimation for nonlinear diffusion processes.
New convergence rates found for PnP methods using MMSE denoisers.
problem Asymptotic convergence of PnP methods with MMSE denoisers.
method Explicitly represented MMSE denoiser as an upper Moreau envelope, derived sublinear convergence rates.
result First sublinear convergence guarantee for PnP proximal gradient descent with MMSE denoiser.
Efficiently trains large GMMs with millions to billions of parameters.
problem Training large Gaussian Mixture Models (GMMs) is computationally expensive.
method Derives a variational approximation integrated with mixtures of factor analyzers (MFAs) to reduce complexity.
result Sublinear scaling in training GMMs, achieving significant speed-ups.
New method uses SURE to denoise signals, outperforming NPMLE.
problem Learning to optimally denoise signals corrupted by Gaussian noise.
method Hyvärinen's score matching (SM) is shown equivalent to SURE minimization.
result SURE achieves nearly parametric rates of convergence in empirical Bayes settings.
Improves generative models by using heavy-tailed noise in score matching.
problem High-dimensional limitations of Gaussian noise in generative models.
method Extended DSM to generalised normal distribution, relaxed key assumptions, developed iterative noise scaling algorithm.
result Heavy-tailed DSM leads to improved generative performance.
This work extends Tweedie's formulae to non-Gaussian processes for better diffusion model generation.
problem Limited exploration of non-Gaussian diffusion models and corresponding Tweedie's formulae.
method Extended Tweedie's formulae to geometric Brownian motion, squared Bessel, and Cox-Ingersoll-Ross processes.
result Demonstrated potential of non-Gaussian models in image and financial time series generation.
New model reduces sampling cost in diffusion models, making them faster and applicable to real-world applications.
problem Challenges in generating high-quality samples, mode coverage, and fast sampling in deep generative models.
method Proposes denoising diffusion GANs that model each denoising step using a multimodal conditional GAN to reduce sampling cost.
result Demonstrates 2000 faster sampling on CIFAR-10 dataset while maintaining competitive sample quality and diversity.
Denoising Diffusions with Optimal Transport: Localization, Curvature, and Multi-Scale Complexitystat.ML
This paper tackles denoising of complex measures using optimal transport and curvature analysis.
problem Denoising of complex, possibly non-log-concave measures.
method Score function and optimal transport theory to revert Langevin diffusion chains.
result The difficulty of denoising depends on the curvature complexity of the initial measure at specific SNR scales.
Transformer with denoising diffusion improves probabilistic density estimation.
problem Estimating non-Gaussian and multimodal probability distributions for regression problems.
method Training a denoising diffusion head on top of a Transformer model.
result The model provides reasonable probability density estimation for high-dimensional inputs.
Paper improves molecular property prediction using denoising autoencoders.
problem Limited data for molecular property prediction from 3D structures.
method Pre-training via denoising for learning molecular force fields.
result Achieves new state-of-the-art performance on QM9 dataset.
DLPM replaces Gaussian noise with α-stable noise in DDPM, improving data distribution coverage and robustness.
problem Handling mode collapse and class imbalance in datasets with heavy-tailed noise.
method Extending DDPM to use α-stable noise, simplifying the process with elementary proof techniques.
result DLPM yields better coverage of data distribution tails, improved robustness to unbalanced datasets, and faster computation times.
The problem of Poisson denoising appears in various imaging applications, such as low-light photography, medical imaging and microscopy. In cases of high SNR, several transformations exist so as to convert the Poisson noise into an additive i.i.d. Gaussian noise, for which many effective algorithms are available. Howev…
DSPM models control noise volatility, improving financial data analysis.
problem Financial returns exhibit volatility clustering, challenging traditional models.
method DSPM uses a tempered-stable subordinator to control noise volatility, preserving kurtosis and autocorrelation.
result DSPM models accurately capture volatility clustering and noise mechanisms.
Recently developed deep-learning-based denoisers often outperform state-of-the-art conventional denoisers such as the BM3D. They are typically trained to minimize the mean squared error (MSE) between the output image of a deep neural network (DNN) and a ground truth image. Thus, it is important for deep-learning-based …
Level-set optimization formulations with data-driven constraints minimize a regularization functional subject to matching observations to a given error level. These formulations are widely used, particularly for matrix completion and sparsity promotion in data interpolation and denoising. The misfit level is typically …
L2R learns to denoise images without needing noise distribution knowledge.
problem Traditional denoising methods require noise distribution knowledge, limiting their applicability.
method L2R uses a learnable monotonic neural network to learn recorruption without distribution knowledge.
result L2R achieves state-of-the-art performance across various noise distributions.
PriorGrad: Improving Conditional Denoising Diffusion Models with Data-Dependent Adaptive Priorstat.ML
PriorGrad improves speech synthesis models by using data-dependent adaptive priors.
problem Inefficiency in denoising diffusion models due to mismatch between prior and data distributions.
method Proposes PriorGrad, an adaptive prior derived from data statistics based on conditional information.
result PriorGrad achieves faster convergence and superior performance in speech synthesis models.
This work extends diffusion models to function space for better generative modeling.
problem Limited applicability of diffusion models to functional data domains.
method Introduces Denoising Diffusion Operators (DDOs) for training diffusion models in function space.
result Demonstrates accurate function-valued generation at fixed cost.
We study convergence of a generative modeling method that first estimates the score function of the distribution using Denoising Auto-Encoders (DAE) or Denoising Score Matching (DSM) and then employs Langevin diffusion for sampling. We show that both DAE and DSM provide estimates of the score of the Gaussian smoothed p…
New analysis improves denoising of modulo signals on graphs.
problem Robustly unwrapping noisy modulo samples of smooth functions.
method Analyzing sphere-relaxation and unconstrained relaxation of a QCQP on a graph.
result Proves denoising of modulo observations w.r.t the norm in Gaussian noise.
Enhances learning of structured distributions using nonlinear denoising score matching.
problem Learning structured distributions from noisy data.
method Latent Nonlinear Denoising Score Matching (LNDSM) integrating nonlinear dynamics with VAE-based latent score matching.
result LNDSM achieves superior sample quality and variability compared to structure-agnostic methods.