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.

169,051 papers · 148 categories

Trend · papers per month

2805608401,120 · Jun 202019922001200920182026
48 results for data denoising

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.

Physics-informed denoising improves sensor data accuracy without needing clean data.

problem Noise in real-life sensor data affects system performance and reliability.
method Physics-informed denoising model that uses algebraic relationships between sensor measurements governed by physical laws.
result Achieved state-of-the-art performance in various real-world applications.

New method optimizes matrix denoising for weighted loss functions and heterogeneous signals.

problem Estimating low-rank matrices from noisy observed matrices.
method Developed a family of weighted loss functions and derived optimal spectral denoisers.
result A new denoiser exploiting heterogeneity in signal matrices improves estimation.

Paper analyzes self-supervised image denoising with denatured data.

problem Understanding the performance of self-supervised image denoising with denatured data.
method Theoretical analysis and numerical experiments on a denoising algorithm.
result Theoretical analysis shows the algorithm finds desired solutions to the optimization problem.

New algorithm targets nonsmooth constraints for robust data interpolation and denoising.

problem Robust data interpolation and denoising with large outliers and varying amplitudes.
method Flexible algorithmic framework targeting nonsmooth level-set constraints (L1, Linf, L0 norms).
result Improved robustness to large outliers and significant amplitude variations in seismic data.

A new EBM trained with multi-scale denoising score matching outperforms GANs in high-dimensional data synthesis.

problem Training EBMs in high-dimensional spaces is slow and challenging.
method Multi-scale denoising score matching to train EBMs.
result The proposed EBM achieves comparable performance to GANs in high-dimensional data synthesis.

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.

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.

A new Dantzig Selector with an optimal denoising matrix for reinforcement learning.

problem Improving Dantzig Selector's performance in sparse signal recovery and reinforcement learning.
method Defining an optimal denoising matrix through minimax optimization and proposing an approximate algorithm to estimate it.
result Empirical validation of the proposed ODDS algorithm's superior performance in reinforcement learning.

Unsupervised learning is of growing interest because it unlocks the potential held in vast amounts of unlabelled data to learn useful representations for inference. Autoencoders, a form of generative model, may be trained by learning to reconstruct unlabelled input data from a latent representation space. More robust r…

2017-03-03abs ↗pdf ↗

This study uses deep learning to improve the accuracy of raw data denoising in ProtoDUNE experiments.

problem Improving the accuracy of raw data denoising in ProtoDUNE experiments.
method Investigates two graph neural network architectures to enhance the receptive field of convolutional neural networks for raw data denoising.
result Graph neural network architectures outperform traditional algorithms in denoising raw ProtoDUNE data.

The study examines denoising and noisy-input regression under distribution shift, revealing double descent behavior and insights for data augmentation.

problem Understanding denoising in machine learning, especially under noisy inputs and distribution shift.
method Theoretical analysis of supervised denoising and noisy-input regression, considering low-rank data and proportional regime.
result The test error exhibits double descent under general distribution shift, indicating that overfitting the noise can be benign, tempered, or catastrophic.

A method to estimate high order derivatives of data distributions from samples.

problem Estimating high order derivatives of data distributions efficiently and accurately.
method Generalizing denoising score matching via Tweedie's formula to estimate higher order derivatives.
result Models trained with the proposed method can approximate second order derivatives more efficiently and accurately than via automatic differentiation.

New method improves image denoising with fewer parameters and less data.

problem Image denoising requires large datasets and supervised settings, limiting practical applications.
method Self-supervised framework using Tucker low-rank tensor approximation.
result Improves model generalizability and reduces data acquisition costs.

Self-supervised method predicts clean signal and noise distribution from noisy images.

problem Blind denoising and noise estimation in biomedical images with limited clean data.
method Two neural networks jointly predict clean signal and noise distribution from noisy observations.
result Significantly outperforms state-of-the-art algorithms on six biomedical image datasets.

Heuristic weighting improves denoising score matching without requiring noise distribution assumptions.

problem Improving denoising score matching without assuming noise distribution.
method Demonstrated heteroskedasticity, derived optimal weighting functions, and provided theoretical and empirical comparisons.
result Heuristical weighting function can achieve lower variance than optimal weighting, facilitating more stable and efficient training.

Noise2Inverse removes artifacts in noisy CT images without needing clean data.

problem Removing artifacts in noisy CT images.
method Noise2Inverse uses a deep CNN trained on multiple statistically independent reconstructions of the same noisy data.
result Noise2Inverse improves peak signal-to-noise ratio and structural similarity index compared to existing methods.

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 …

2018-03-04abs ↗pdf ↗

Continuous time framework for discrete data denoising models.

problem Efficient training and sampling for discrete data denoising models.
method Formulated as Continuous Time Markov Chains (CTMCs), efficient training using continuous time ELBO, high-dimensional CTMC simulation, novel theoretical error bound.
result Continuous time treatment enables novel theoretical error bound between generated and true data distributions.

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 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.

ICE algorithm removes noisy channel assumption for universal discrete denoising.

problem Universal discrete denoising under channel uncertainty.
method Iterative channel estimation based on Neural DUDE, alternating channel estimation and neural network parameter estimation.
result ICE-N-DUDE achieves superior performance regardless of channel and clean source uncertainties.

Adaptive denoising models adjust the number of steps based on noise level.

problem Generating data with lower intrinsic dimensions.
method Adaptive diffusion models using Doob's h-transform to terminate at a random time.
result Adaptive models simplify termination to a first-hitting rule, enhancing adaptability.

This paper improves change-point detection for complex data streams using denoising score matching.

problem Timely identification of distributional shifts in high-dimensional, complex data streams.
method Score-based CUSUM change-point detection with denoising score matching.
result Denoising score matching enhances detection power by effectively controlling noise scale.

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.

DDCD uses diffusion models to learn causal structures from noisy data.

problem Scalability and stability issues in high-dimensional causal structure learning.
method Adaptive k-hop acyclicity constraint and denoising score matching objective of diffusion models.
result DDCD achieves competitive performance on synthetic and real-world data.

A new autoencoder framework transforms latent space to improve generative and denoising models.

problem Improving the performance of generative and denoising models in autoencoders.
method Homeomorphic transformation of latent variables to reduce distance and preserve topological properties.
result The transformed latent space leads to better performance in generative and denoising models, as measured by Hausdorff distance and visual characteristics.

Deep neural networks are often used to implement powerful generative models for real-world data. Notable applications include image denoising, as well as other classical inverse problems like compressed sensing and super-resolution. To provide a rigorous but simplified analysis of generative models, in this work, we in…

2018-03-25abs ↗pdf ↗