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

Trend · papers per month

2815618421,122 · Jun 202019922001200920172026
48 results for raw data denoising

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.

This paper tackles noise in raw datasets to improve representation learning efficiency.

problem Noise in real-world datasets degrades representation learning quality.
method Proposes denoising Cosine-Similarity (dCS) loss to learn robust representations.
result Empirical results show the dCS loss outperforms baseline objective functions.

Volatility dynamics of wavelet - filtered stock price time series is studied. Using the universal thresholding method of wavelet filtering and a principle of minimal linear autocorrelation of noise component we find that the quantitative characteristics of volatility dynamics of denoised series are noticeably different…

2006-12-18abs ↗pdf ↗

SidAE combines autoencoders and Siamese networks for self-supervised feature extraction.

problem Efficiently extract meaningful features from unlabeled data.
method Proposes SidAE, a combination of autoencoders and Siamese networks for self-supervised image classification.
result SidAE outperforms self-supervised baselines across multiple datasets and scenarios, especially with limited labeled data.

We propose a simple neural network model to deal with the domain adaptation problem in object recognition. Our model incorporates the Maximum Mean Discrepancy (MMD) measure as a regularization in the supervised learning to reduce the distribution mismatch between the source and target domains in the latent space. From …

2014-09-21abs ↗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.

Framework improves marine mammal monitoring in noisy underwater environments.

problem Underwater bioacoustic monitoring challenges due to overlapping calls and variable noise.
method Multi-step attention-guided framework with segmentation and mid-level fusion.
result Improved signal discrimination, reduced false positives, reliable representations.

Inspired by recent successes of deep learning in computer vision, we propose a novel framework for encoding time series as different types of images, namely, Gramian Angular Summation/Difference Fields (GASF/GADF) and Markov Transition Fields (MTF). This enables the use of techniques from computer vision for time serie…

2015-06-01abs ↗pdf ↗

Reduces data leakage in distributed deep learning models.

problem Prevents reconstruction of sensitive raw data patterns during client communications.
method Reduces distance correlation between raw data and learned representations.
result Resilient to reconstruction attacks while maintaining model accuracy.

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.

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 method explains classifiers trained on raw hierarchical data.

problem Lack of interpretability in classifiers trained on raw structured data.
method Treating classifiers as subset selection problems, generating interpretable explanations efficiently.
result Computational efficiency and higher-quality explanations compared to existing methods.

This study proposes a fully convolutional network (FCN) model for raw waveform-based speech enhancement. The proposed system performs speech enhancement in an end-to-end (i.e., waveform-in and waveform-out) manner, which dif-fers from most existing denoising methods that process the magnitude spectrum (e.g., log power …

2017-03-07abs ↗pdf ↗

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.

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 ↗

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.

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 ↗

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.

Gait is a person's natural walking style and a complex biological process that is unique to each person. Recently, the channel state information (CSI) of WiFi devices have been exploited to capture human gait biometrics for user identification. However, the performance of existing CSI-based gait identification systems …

2019-02-06abs ↗pdf ↗

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.

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.

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 ↗

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.

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.