Research
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,657 papers · 148 categories

Trend · papers per month

7142027 · Oct 202519922001200920172026
48 results for MMSE denoiser

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.

Paper establishes limits for accurately estimating low-rank matrices from noisy, non-linear data.

problem Estimating low-rank matrices from noisy, non-linear observations.
method Proves strong universality result with equivalent Gaussian model and effective prior parameters.
result Signal-to-noise ratio requirement grows as $N^{ rac 12 (1-1/k_F)}$ for accurate reconstruction.

The paper characterizes functions of shallow ReLU NN denoisers under minimal norm constraints.

problem Understanding the theoretical success of neural network denoisers.
method Characterization of functions realized by shallow ReLU NN denoisers under minimal norm constraints.
result The functions realized by shallow ReLU NN denoisers are contractive toward clean data points and generalize better than the empirical MMSE estimator at low noise levels.

In this paper, we present a deep learning (DL) algorithm for channel estimation in communication systems. We consider the time-frequency response of a fast fading communication channel as a two-dimensional image. The aim is to find the unknown values of the channel response using some known values at the pilot location…

2018-10-13abs ↗pdf ↗

Develops algorithms for Bayesian inference with Plug & Play priors, ensuring convergence and well-posedness.

problem Bayesian imaging inverse problems with implicit priors defined by denoising algorithms.
method Introduces PnP-ULA and PnP-SGD algorithms for Monte Carlo sampling and MAP inference, proving convergence under realistic assumptions.
result Proves convergence of PnP-ULA and PnP-SGD algorithms for Bayesian inference with PnP priors, targeting a well-posed decision-theoretic model.

A-MMSE uses attention to learn efficient OFDM channel estimation.

problem Accurate OFDM channel estimation requires second-order statistics, which are hard to obtain in practice.
method A-MMSE is a model-based DNN framework that learns linear MMSE filters via Attention Transformer, reducing inference complexity.
result A-MMSE outperforms other methods in normalized MSE across various SNR conditions.

Despite the simplicity and intuitive interpretation of Minimum Mean Squared Error (MMSE) estimators, their effectiveness in certain scenarios is questionable. Indeed, minimizing squared errors on average does not provide any form of stability, as the volatility of the estimation error is left unconstrained. When this v…

2019-12-06abs ↗pdf ↗

The study sets lower bounds on MMSE for inferring sensitive features from noisy data.

problem Estimating sensitive features from noisy observations of correlated features.
method Adversarial evaluation framework based on MMSE estimation with theoretical lower bounds.
result Derives closed-form bounds for linear models, showing optimality in noise variance.

We propose a data-driven algorithm for the maximum a posteriori (MAP) estimation of stochastic processes from noisy observations. The primary statistical properties of the sought signal is specified by the penalty function (i.e., negative logarithm of the prior probability density function). Our alternating direction m…

2017-05-16abs ↗pdf ↗

This paper considers regression tasks involving high-dimensional multivariate processes whose structure is dependent on some {known} graph topology. We put forth a new definition of time-vertex wide-sense stationarity, or joint stationarity for short, that goes beyond product graphs. Joint stationarity helps by reducin…

2016-11-01abs ↗pdf ↗

Paper finds formulas for mutual information and MMSE in matrix tensor product problems.

problem High-dimensional inference problems involving matrix tensor products.
method Single-letter formulas for mutual information and MMSE, using new techniques.
result Analytical formulas describe leading order terms in mutual information and MMSE.

Study shows how much information can be learned from sparse signals with limited data.

problem Understanding information limits in learning sparse signals with sublinear data.
method Proved variational formula for mutual information, derived MMSE expressions, analyzed phase transitions.
result Nonincreasing piecewise constant MMSE with all-or-nothing phase transitions for certain conditions.

Study finds exact limits for sparse regression with fewer observations than usual.

problem Understanding sparse linear regression with sublinear sparsity.
method Adaptive interpolation method and modified AMP algorithm.
result Exact asymptotic expressions for mutual information and MMSE in sublinear sparsity.

Recently, a framework for application-oriented optimal experiment design has been introduced. In this context, the distance of the estimated system from the true one is measured in terms of a particular end-performance metric. This treatment leads to superior unknown system estimates to classical experiment designs bas…

2015-07-26abs ↗pdf ↗

AVICA estimates noise levels for better group ICA source recovery.

problem Estimating shared independent sources from multiple noisy views.
method AVICA models each view as a linear mixture of shared sources with additive noise, optimizing noise levels alongside sources.
result AVICA yields better source estimates than other methods, especially in real-world applications like MEG and fMRI.

The Rasch model is widely used for item response analysis in applications ranging from recommender systems to psychology, education, and finance. While a number of estimators have been proposed for the Rasch model over the last decades, the available analytical performance guarantees are mostly asymptotic. This paper p…

2018-06-09abs ↗pdf ↗

Traditional Kalman filter (KF) is derived under the well-known minimum mean square error (MMSE) criterion, which is optimal under Gaussian assumption. However, when the signals are non-Gaussian, especially when the system is disturbed by some heavy-tailed impulsive noises, the performance of KF will deteriorate serious…

2015-09-15abs ↗pdf ↗

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.

DDPD separates generation into planning and denoising for improved efficiency.

problem Efficiently denoise corrupted data during generation.
method Separates generation into a planner and denoiser, selecting denoising positions based on corruption severity.
result DDPD outperforms traditional methods on language and image generation benchmarks.

We consider the problem of estimating a low-rank matrix from a noisy observed matrix. Previous work has shown that the optimal method depends crucially on the choice of loss function. In this paper, we use a family of weighted loss functions, which arise naturally for problems such as submatrix denoising, denoising wit…

2019-02-25abs ↗pdf ↗

Image denoising is an important pre-processing step in medical image analysis. Different algorithms have been proposed in past three decades with varying denoising performances. More recently, having outperformed all conventional methods, deep learning based models have shown a great promise. These methods are however …

2016-08-16abs ↗pdf ↗

Case vs control comparisons have been the classical approach to the study of neurological diseases. However, most patients will not fall cleanly into either group. Instead, clinicians will typically find patients that cannot be classified as having clearly progressed into the disease state. For those subjects, very lit…

2012-07-19abs ↗pdf ↗

This letter presents a novel Block Bayesian Hypothesis Testing Algorithm (Block-BHTA) for reconstructing block sparse signals with unknown block structures. The Block-BHTA comprises the detection and recovery of the supports, and the estimation of the amplitudes of the block sparse signal. The support detection and rec…

2015-08-22abs ↗pdf ↗

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.

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.

New denoisers improve signal recovery from noisy data without knowing noise distribution.

problem Denoising signals when only noise level is known, not distribution.
method Universal denoisers that shrink PYP_Y toward PXP_X with higher-order accuracy.
result Achieves O(σ4)O(σ^4) and O(σ6)O(σ^6) accuracy in matching generalized moments and densities.

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…

2020-02-21abs ↗pdf ↗

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 2000imes imes faster sampling on CIFAR-10 dataset while maintaining competitive sample quality and diversity.

We study the theoretical properties of image denoising via total variation penalized least-squares. We define the total vatiation in terms of the two-dimensional total discrete derivative of the image and show that it gives rise to denoised images that are piecewise constant on rectangular sets. We prove that, if the t…

2019-11-17abs ↗pdf ↗