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

3597171,0761,434 · Jun 202019922001200920172026
48 results for noisy models

ExpertNet uses noisy labels to improve deep learning robustness.

problem Improving deep learning robustness against noisy labels.
method ExpertNet framework combining Amateur and Expert models, iteratively learning from noisy labels and images.
result ExpertNet achieves robust classification with as little as 20-50% training data, outperforming state-of-the-art models.

Study how noisy labels affect semi-supervised learning.

problem Effect of noisy labels on semi-supervised learning performance.
method Proposed an algorithm derived from a continuous relaxation of the Maximum A Posteriori (MAP) estimator for a Degree Corrected Stochastic Block Model (DC-SBM).
result Our approach achieves promising performance even with very noisy labeled data.

The paper tackles learning true rankings from noisy, incomplete data.

problem Learning true rankings from incomplete and noisy data.
method Introduces a selective Mallows model for noisy rankings and derives upper and lower bounds on sample complexity.
result Strong asymptotically tight bounds on sample complexity for learning complete rankings and top-k rankings.

Proposes a new model for noisy labels considering multiple labelers and adversarial attacks.

problem Real-world noisy label models with multiple labelers and adversarial attacks.
method Labeler-dependent noise model with adversarial attack vectors.
result State-of-the-art approaches for learning from noisy labels are defeated by adversarial label attacks.

A fast method approximates likelihood scores for noisy linear inverse problems.

problem Solving noisy linear inverse problems efficiently.
method Proposes a simple closed-form approximation to the likelihood score for diffusion and flow-based models.
result Significantly faster than baseline methods while maintaining competitive or better reconstruction performances.

Class2Simi reduces noise in noisy label learning by transforming noisy class labels into noisy similarity labels.

problem Learning with noisy labels in supervised and unsupervised settings.
method Transforming noisy class labels into noisy similarity labels, training DNNs from noisy data pairs.
result The noise rate reduction is theoretically guaranteed, making it easier to handle noisy similarity labels.

DynaCor detects noisy labels by learning from corrupted training signals.

problem Label noise in real-world datasets hinders model generalization.
method DynaCor introduces label corruption to indirectly simulate noisy labels and learns to distinguish clean from noisy instances.
result DynaCor outperforms state-of-the-art competitors in noisy label detection.

Estimates linear model from noisy covariates and instruments using spectral regularization.

problem Estimating a linear model from many noisy covariates and instruments.
method Two-stage least squares with spectral regularization of canonical correlations.
result Upper and lower bounds on estimation error, proving optimality of the method with noisy data.

Paper improves 0\ell^{0}-SSC for noisy data by proving SDP and proposing Noisy-DR-0\ell^{0}-SSC.

problem Noisy data and less restrictive subspace affinity in sparse subspace clustering.
method Proposes Noisy-DR-0\ell^{0}-SSC, which projects data onto a lower dimensional space and then applies noisy 0\ell^{0}-SSC.
result Theoretical guarantee on the correctness of noisy 0\ell^{0}-SSC in terms of SDP on noisy data.

The paper analyzes generalization of noisy iterative algorithms using communication theory.

problem Generalization of models trained by noisy iterative algorithms under different distributions.
method Connecting noisy iterative algorithms to additive noise channels in communication theory.
result Distribution-dependent generalization bounds for noisy iterative algorithms.

Framework prevents deep learning models from memorizing noisy labels.

problem Deep learning models memorize noisy labels during early learning phase.
method Develops a technique that exploits early learning phase via regularization.
result Framework achieves robustness to noisy annotations on benchmarks and real-world datasets.

A corrected EI acquisition function handles noisy observations in Bayesian optimization.

problem Noisy observations in Bayesian optimization.
method Proposes a modified expected improvement (EI) acquisition function that incorporates covariance information from the Gaussian Process model.
result Achieves a sublinear convergence rate on cumulative regret bound under heteroscedastic observation noise.

Leveraging weak or noisy supervision for building effective machine learning models has long been an important research problem. Its importance has further increased recently due to the growing need for large-scale datasets to train deep learning models. Weak or noisy supervision could originate from multiple sources i…

2019-11-10abs ↗pdf ↗

Deep learning models can overfit noisy data without losing generalization.

problem Understanding the generalization of deep learning models in noisy data.
method Empirical investigation of epoch-wise double descent in fully connected neural networks trained on CIFAR-10 with 30% label noise.
result The model achieves strong re-generalization on test data after overfitting noisy training data, corresponding to a 'benign overfitting' state.

New metric compares noisy neural trajectories using optimal transport.

problem Existing metrics fail to capture differences in noisy, dynamic neural responses.
method Proposed an optimal transport distance metric for Gaussian processes.
result Metric effectively compares neural dynamics in different systems.

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.

Large-scale datasets may contain significant proportions of noisy (incorrect) class labels, and it is well-known that modern deep neural networks (DNNs) poorly generalize from such noisy training datasets. To mitigate the issue, we propose a novel inference method, termed Robust Generative classifier (RoG), applicable …

2019-01-31abs ↗pdf ↗

Deep learning scheme identifies and reconstructs chaotic and stochastic systems from noisy data.

problem Challenging identification of governing equations from noisy and partial observations.
method Jointly learns inference model and governing laws using variational deep learning.
result Framework generalizes state-of-the-art methods and accounts for stochastic variabilities.

Most existing image denoising approaches assumed the noise to be homogeneous white Gaussian distributed with known intensity. However, in real noisy images, the noise models are usually unknown beforehand and can be much more complex. This paper addresses this problem and proposes a novel blind image denoising algorith…

2016-01-13abs ↗pdf ↗

Despite the success of deep neural networks (DNNs) in image classification tasks, the human-level performance relies on massive training data with high-quality manual annotations, which are expensive and time-consuming to collect. There exist many inexpensive data sources on the web, but they tend to contain inaccurate…

2018-12-13abs ↗pdf ↗

Neural networks can interpolate noisy data and still generalize well.

problem Generalization of neural networks trained on noisy data.
method Two-layer neural networks trained to interpolation by gradient descent on corrupted labels.
result Neural networks can achieve zero training error and optimal test error.

Study on privacy leakage in noisy gradient descent algorithms.

problem Information leakage of iterative randomized learning algorithms about training data.
method Analyzes the dynamics of Rényi differential privacy loss in noisy gradient descent algorithms.
result Privacy loss converges exponentially fast for smooth and strongly convex loss functions.

New method improves deep learning models in noisy label classification.

problem Improving deep learning models in noisy label classification.
method Analyzes loss and uncertainty changes during training, designs a new robust training method.
result Significantly outperforms other state-of-the-art methods in various deep learning models.

This work explores how neural network architecture affects robustness to noisy labels.

problem The impact of neural network architecture on robustness to noisy labels.
method Formal framework connecting robustness to architecture alignments, measured by predictive power in representations.
result Network robustness to noisy labels improves when its architecture is more aligned with the target function.

The paper analyzes how deep neural networks handle noisy labels and finds disparate impacts.

problem Disparate impacts of noisy labels on instances with different representation frequencies.
method Quantifying harms, analyzing solutions, and comparing their impacts on different frequency instances.
result Existing solutions lead to disparate treatments, benefiting higher-frequency instances more.

Paper proposes a novel model to improve n-ary cross-sentence relation extraction by addressing noisy data and non-consecutive sentences.

problem Noisy labeled data and non-consecutive sentences in n-ary cross-sentence relation extraction.
method Two-level agent reinforcement learning model and hybrid attention mechanism/PCNN approach.
result The model reduces the impact of noisy data and achieves better performance.

Paper tackles noisy labels for non-decomposable performance measures.

problem Learning from noisy labels for non-decomposable performance measures.
method Designs algorithms for multiclass non-decomposable performance measures using Frank-Wolfe and Bisection methods, corrected for class-conditional noise.
result Noise-corrected algorithms are Bayes consistent, converging to optimal performance.