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

Trend · papers per month

10.7%21.3%32.0%42.7% · Jun 202019922001200920172026
48 results for noise-corrupted data

Paper proposes a self-supervised method to denoise autoregressive signals with heavy-tailed noise.

problem Denoising autoregressive signals corrupted by heavy-tailed noise.
method Self-supervised learning approach without requiring full noise distribution knowledge.
result Strong denoising performance compared to baseline methods, especially for impulsive noise.

New algorithm recovers graph structure from noisy data.

problem Noise corrupts structure in Gaussian graphical models, making identification impossible.
method Developed an algorithm to recover graph structure up to an unavoidable ambiguity.
result Algorithm recovers graph structure up to an identified ambiguity, revealing local clustering and connectivity.

Identifying meaningful signal buried in noise is a problem of interest arising in diverse scenarios of data-driven modeling. We present here a theoretical framework for exploiting intrinsic geometry in data that resists noise corruption, and might be identifiable under severe obfuscation. Our approach is based on uncov…

2018-01-25abs ↗pdf ↗

We propose a Bayesian nonparametric method for low-pass filtering that can naturally handle unevenly-sampled and noise-corrupted observations. The proposed model is constructed as a latent-factor model for time series, where the latent factors are Gaussian processes with non-overlapping spectra. With this construction,…

2019-02-09abs ↗pdf ↗

TrustNet robustly learns noise patterns from trusted data to improve weakly-supervised classification.

problem Robustness to label noise in weakly-supervised learning.
method TrustNet learns noise patterns from trusted data, then trains a robust classifier using these patterns.
result TrustNet outperforms state-of-the-art methods in robustness to various noise patterns.

This paper focuses on the problem of determining as large a region as possible where a function exceeds a given threshold with high probability. We assume that we only have access to a noise-corrupted version of the function and that function evaluations are costly. To select the next query point, we propose maximizing…

2018-11-25abs ↗pdf ↗

We study the performance of stochastically trained deep neural networks (DNNs) whose synaptic weights are implemented using emerging memristive devices that exhibit limited dynamic range, resolution, and variability in their programming characteristics. We show that a key device parameter to optimize the learning effic…

2017-11-09abs ↗pdf ↗

The performance of sparse signal recovery from noise corrupted, underdetermined measurements can be improved if both sparsity and correlation structure of signals are exploited. One typical correlation structure is the intra-block correlation in block sparse signals. To exploit this structure, a framework, called block…

2012-11-21abs ↗pdf ↗

A diffusion model estimates data manifold dimension by tracking likelihood increases.

problem Estimating the intrinsic dimension of data manifolds.
method Trained diffusion model approximates score function, revealing manifold directionality.
result Diffusion model provides an approximation of the tangent space's dimension.

Bayesian Gaussian process models handle uncertain data locations in PDE approximations.

problem Handling uncertainties in data locations for PDE approximations.
method Bayesian inference of uncertain inputs integrated into Gaussian process predictions.
result Substantial reduction in predictive uncertainties achieved through Bayesian inference.

Efficiently quantifies uncertainty in DeepONets for function spaces.

problem Uncertainty quantification in deep operator networks.
method Randomized prior ensembles for frequentist inference.
result Improved robustness and accuracy, reliable uncertainty estimates, out-of-distribution detection, and model bias quantification.

Paper tackles anomaly detection in SAR images without labeled data.

problem Anomaly detection in SAR images with speckle noise and spatial correlation issues.
method Self-supervised deep learning approach: despeckling, adversarial autoencoder, change detection.
result Method outperforms conventional algorithms in detecting anomalies in SAR images.

Paper proves noise-tolerant SSC using greedy methods under coherence conditions.

problem Proving noise-tolerant SSC using greedy methods under coherence conditions.
method Derives coherence-based sufficient conditions for correct neighbor identification using MP/OMP in the presence of bounded noise.
result MP/OMP succeed in identifying correct neighbors under certain noise levels, leading to higher clustering accuracy.

This paper proposes a novel type of random forests called a denoising random forests that are robust against noises contained in test samples. Such noise-corrupted samples cause serious damage to the estimation performances of random forests, since unexpected child nodes are often selected and the leaf nodes that the i…

2017-10-30abs ↗pdf ↗

Unified framework improves neural network robustness against label noise and adversarial attacks.

problem High sensitivity of neural networks to data contamination, including label noises and adversarial perturbations.
method Unified minimum-divergence estimation problem, rSDNet framework.
result Improves robustness to label corruption and adversarial attacks while maintaining competitive accuracy on clean data.

CANDI solves the gap between continuous and discrete diffusion models for text generation.

problem Underperformance of continuous diffusion models in discrete data domains.
method Introduces token identifiability and a hybrid framework (CANDI) to decouple discrete and continuous corruption.
result CANDI successfully avoids temporal dissonance, enabling continuous diffusion benefits for discrete spaces.

Unified framework for analyzing batch updating methods with noisy gradients.

problem Analyzing convergence of batch updating methods with noisy gradients and approximations.
method Unified framework using convergence of stochastic processes.
result Establishes a general theorem for most known convergence results.

Neural Empirical Bayes estimates source distributions from noisy simulations.

problem Estimating source distributions from noisy, simulated data.
method Uses neural density estimators to estimate a prior or source distribution over uncorrupted samples, then performs posterior inference.
result Recovering ground truth source distributions up to symmetries.

This work enhances collaborative inference privacy by minimizing conditional entropy and boosting robustness against model inversion attacks.

problem Privacy leakage in collaborative inference systems via model inversion attacks.
method Theoretical proof and derivation of a differentiable measure for bounding conditional entropy, followed by a CEM algorithm to maximize it.
result Theoretical proof and experimental validation show that CEM consistently boosts inversion robustness without compromising feature utility or efficiency.

Partial soft-matching distance improves neural representation comparison by allowing some neurons to remain unmatched.

problem Neural representations are noisy and contain outliers, making traditional matching methods unreliable.
method Extends soft-matching distance to a partial optimal transport setting, allowing some neurons to remain unmatched.
result Partial soft-matching provides robust correspondences that are more reliable under noise and outliers.

Deep neural networks map brain lesions to deficits for better brain function understanding.

problem Mapping the functional brain organization from pathological lesions.
method Deep generative neural network architectures, specifically variational convolutional volumetric auto-encoders.
result Our model outperforms established methods in lesion-deficit inference across various scenarios.

Estimating the state of a dynamical system from a series of noise-corrupted observations is fundamental in many areas of science and engineering. The most well-known method, the Kalman smoother (and the related Kalman filter), relies on assumptions of linearity and Gaussianity that are rarely met in practice. In this p…

2017-02-17abs ↗pdf ↗

Deep networks generalize well even when they fit training data perfectly, thanks to overparametrization.

problem Understanding generalization in overparametrized deep networks.
method Random features regression, asymptotic analysis, ensemble averaging.
result Bias remains constant beyond the interpolation threshold, while variance components decay with overparametrization.

In rank aggregation (RA), a collection of preferences from different users are summarized into a total order under the assumption of homogeneity of users. Model misspecification in RA arises since the homogeneity assumption fails to be satisfied in the complex real-world situation. Existing robust RAs usually resort to…

2019-05-29abs ↗pdf ↗

We provide high-probability sample complexity guarantees for exact structure recovery and accurate predictive learning using noise-corrupted samples from an acyclic (tree-shaped) graphical model. The hidden variables follow a tree-structured Ising model distribution, whereas the observable variables are generated by a …

2018-12-11abs ↗pdf ↗

Paper introduces robust kernel ridge regression using Cauchy loss for handling various noise types.

problem Developing robust regression methods for noisy data.
method Introduces kernel Cauchy ridge regressor (KCRR) using Cauchy loss function.
result Establishes almost minimax-optimal convergence rate for KCRR in terms of L2L_2-risk.

The paper explains two distinct peaks in generalization error for neural networks and simpler models, each governed by different factors.

problem Understanding the peaks in generalization error for neural networks and simpler models.
method Analysis of random feature models and comparison with numerical experiments involving deep neural networks.
result The peaks at N=PN=P and N=DN=D are distinct and governed by different factors (noise sensitivity vs. initialization noise).

Big data sets must be carefully partitioned into statistically similar data subsets that can be used as representative samples for big data analysis tasks. In this paper, we propose the random sample partition (RSP) data model to represent a big data set as a set of non-overlapping data subsets, called RSP data blocks,…

2017-12-12abs ↗pdf ↗

Prevents sensitive data generation in diffusion models using labeled and unlabeled data.

problem Generating sensitive data in diffusion models using unlabeled data.
method Positive-Unlabeled Diffusion Models, approximating ELBO with labeled and unlabeled data.
result Prevents the generation of sensitive data without compromising image quality.

Study reveals Data Shapley's inconsistent performance in data selection tasks.

problem Inconsistency of Data Shapley's performance in data selection across different settings.
method Hypothesis testing framework and identification of utility functions.
result Data Shapley's performance is no better than random selection without specific constraints.

PRRO generates synthetic tabular data that improves SL performance and class distribution.

problem Low SL utility of synthetic data due to class imbalance and overlooked data relationships.
method Data pruning and column reordering to optimize SL utility.
result Synthetic data generated with PRRO enhances predictive performance and class distribution.

Defines data science as a natural ecosystem with challenges and missions.

problem Challenges and missions in data science due to 5D complexities and data life cycle phases.
method Systemic and data-centric view of data science as a fusion of data universe and its challenges, formalizing a general-purpose architecture.
result Essential data science as a natural ecosystem integrating specific disciplines and high-impact applications.