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

Trend · papers per month

3.4%6.9%10.3%13.7% · May 201919922001200920182026
48 results for noisy input

Paper proposes BCNMCC for system identification with noisy input.

problem System identification with noisy input and impulsive output noise.
method Introduces BCV to NMCC algorithm to compensate for input noise bias.
result BCNMCC outperforms other algorithms in noisy input conditions.

PSDR improves robustness against noisy labels by penalizing KL divergence between similar inputs.

problem Robust training of DNNs in datasets with noisy labels.
method Introduces PSDR, a manifold regularizer that penalizes KL divergence between similar inputs.
result Significantly improves robustness against noisy labels on benchmark datasets.

Paper shows continuous speech recognition with EEG features, no speech input.

problem Continuous speech recognition with limited vocabulary and noisy/no speech input.
method Connectionist temporal classification (CTC) model, EEG features, new deep learning architecture.
result Continuous speech recognition achieved on limited vocabulary with noisy/no speech input.

Bayesian optimisation tackles uncertain inputs in noisy function evaluations.

problem Optimizing functions with uncertain query locations and noisy outcomes.
method Proposes a UCB algorithm for BO with uncertain inputs, using Gaussian process models.
result Theoretical and experimental results show the proposed algorithm outperforms conventional methods.

Study shows noisy historical data can still predict future text classification well.

problem Challenges in text classification with noisy, historical data.
method Examined how performance metrics on noisy data reflect future model performance.
result Noisy training data can be used to build effective prediction models for cleaner inputs.

Student-teacher learning improves generalization with noisy inputs.

problem Transfer knowledge from clean inputs to noisy inputs.
method Analyzes student-teacher learning using deep linear networks and experiments with nonlinear networks.
result Three factors are vital for success: zero training loss, teacher knowledge, and feature decomposition.

Learning theory for linear systems with compositional inputs.

problem Training linear system operators with unknown variables constrained to non-negativity and unity.
method Bayesian inversion method for inferring unknown variable from noisy linear system output.
result Quantified uncertainty in trained operator and convergence rates for various cases.

Gradient descent learns ReLU networks with Gaussian inputs and noisy outputs.

problem Learning one-hidden-layer ReLU networks with Gaussian inputs and noisy outputs.
method Gradient descent with tensor initialization for empirical risk minimization.
result Gradient descent converges to ground-truth parameters at a linear rate up to statistical error.

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.

Deep networks can interpolate noisy data without losing generalization.

problem Characterizing the relationship between interpolation and generalization in overparameterized deep networks.
method Analyzing the loss landscape of neural network functions over volumes around training data points, varying model parameters and training epochs.
result Loss sharpness in the input space follows a double descent, with large models predicting noisy targets over larger volumes around training data points.

PGMs and GNNs differ in capturing network data; PGMs outperform GNNs in noisy and heterophily scenarios.

problem Comparing PGMs and GNNs in network data.
method Link prediction task with synthetic and real networks; three experiments on input features, noise, and heterophily.
result PGMs outperform GNNs in noisy and heterophily scenarios.

A hybrid neural network improves robustness in estimating vehicle parameters from noisy data.

problem Estimating parameters of a mechanical vehicle model from noisy acceleration data.
method Introduced a convolutional neural network with two objective functions: naive and hybrid.
result The hybrid objective function outperforms the naive one in robustness on noisy input data.

The paper proposes a method to detect and filter noisy or mislabeled data using pointwise mutual information.

problem Detecting and filtering noisy or mislabeled data in deep learning models.
method A mutual information-based framework quantifying statistical dependencies between inputs and labels.
result The method effectively filters low-quality samples, improving classification accuracy by up to 15%.

We study the Gaussian Process regression model in the context of training data with noise in both input and output. The presence of two sources of noise makes the task of learning accurate predictive models extremely challenging. However, in some instances additional constraints may be available that can reduce the unc…

2015-06-30abs ↗pdf ↗

Critical initialisation strategies are identified for noisy ReLU networks.

problem Understanding signal propagation in noisy rectifier neural networks.
method Developed a new framework for signal propagation in stochastic regularized neural networks, incorporating various noise distributions.
result Critical initialisation strategies for multiplicative noise (e.g. dropout) are identified, but not for additive noise.

Exact bounds derived for neural network outputs with noisy inputs.

problem Bounding the output distribution of neural networks with random inputs.
method Applying ReLU NNs to derive bounds for general NNs, then using these to find exact error guarantees.
result Exact upper and lower bounds for the output distribution of neural networks with random inputs.

PML-GAN tackles noisy multi-label annotations using adversarial learning.

problem Learning multi-label models from noisy, overcomplete annotations.
method PML-GAN uses a disambiguation network and a generative adversarial network to map noisy labels to clean labels and data samples.
result PML-GAN achieves state-of-the-art performance on partial multi-label learning datasets.

The paper develops GP classifiers for noisy inputs in multi-class classification.

problem Input noise in real-world data affects supervised learning performance.
method Developed multi-class Gaussian Process classifiers using variational inference.
result The proposed methods outperform noise-ignoring GP classifiers in predictive distribution.

In this note, we introduce a new algorithm to deal with finite dimensional clustering with errors in variables. The design of this algorithm is based on recent theoretical advances (see Loustau (2013a,b)) in statistical learning with errors in variables. As the previous mentioned papers, the algorithm mixes different t…

2013-08-15abs ↗pdf ↗

This paper examines error bounds for deep learning classifiers with noisy labels.

problem Understanding the performance of classifiers trained on noisy data.
method Derives error bounds for excess risk, decomposing it into statistical and approximation errors. Uses independent block construction for statistical dependencies and vector-valued setting for approximation error.
result Established theoretical results for error bounds in deep learning with noisy labels, mitigating the impact of high-dimensional input spaces.

A new clustering method using deep autoencoder networks and spectral clustering.

problem Improving clustering accuracy in noisy data.
method Dual autoencoder network for robust latent representations, mutual information estimation for discriminative features, deep spectral clustering.
result Significantly outperforms state-of-the-art clustering approaches on benchmark datasets.

This paper considers the problem of subspace clustering under noise. Specifically, we study the behavior of Sparse Subspace Clustering (SSC) when either adversarial or random noise is added to the unlabelled input data points, which are assumed to be in a union of low-dimensional subspaces. We show that a modified vers…

2013-09-05abs ↗pdf ↗

Curriculum learning helps neural networks learn parities more efficiently.

problem Improving learning efficiency for neural networks on parity targets.
method Using a curriculum learning approach with a mixture of sparse and dense inputs.
result A 2-layer ReLU neural network can learn parities more efficiently than a fully connected network.

RFMs transition from linear to nonlinear under specific input-label correlation.

problem Understanding the transition from linear to nonlinear behavior in RFMs.
method Analyzing RFMs under spiked covariance designs, characterizing the interaction between anisotropy and input-label correlation.
result The RFM generalization error is governed by the strength of input-label correlation, leading to a clear nonlinear advantage above a specific boundary.

Algorithm identifies bilinear dynamical systems from noisy data.

problem Learning a realization of a partially observed bilinear dynamical system.
method Regression of outputs to highly correlated covariates for Markov-like parameters.
result High probability error bounds on identification algorithm under uniform stability assumption.

Improves magnetic field mapping using an array of magnetometers with noisy input.

problem Improving magnetic field maps in indoor environments with noisy magnetometer data.
method Uses Gaussian process regression with an array of magnetometers, incorporating known array positions and relative magnetometer locations.
result The method produces higher quality magnetic field maps compared to using a single magnetometer.

Deep neural networks (DNNs) are powerful nonlinear architectures that are known to be robust to random perturbations of the input. However, these models are vulnerable to adversarial perturbations--small input changes crafted explicitly to fool the model. In this paper, we ask whether a DNN can distinguish adversarial …

2017-03-01abs ↗pdf ↗