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

21426384 · Jun 202019922001200920172026
48 results for noisy

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.

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.

Deep neural networks (DNNs) are powerful tools in computer vision tasks. However, in many realistic scenarios label noise is prevalent in the training images, and overfitting to these noisy labels can significantly harm the generalization performance of DNNs. We propose a novel technique to identify data with noisy lab…

2019-05-29abs ↗pdf ↗

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.

Variational Bayesian neural networks combine the flexibility of deep learning with Bayesian uncertainty estimation. However, inference procedures for flexible variational posteriors are computationally expensive. A recently proposed method, noisy natural gradient, is a surprisingly simple method to fit expressive poste…

2018-11-30abs ↗pdf ↗

A similarity label indicates whether two instances belong to the same class while a class label shows the class of the instance. Without class labels, a multi-class classifier could be learned from similarity-labeled pairwise data by meta classification learning. However, since the similarity label is less informative …

2020-02-16abs ↗pdf ↗

Deep neural networks (DNNs) trained on large-scale datasets have exhibited significant performance in image classification. Many large-scale datasets are collected from websites, however they tend to contain inaccurate labels that are termed as noisy labels. Training on such noisy labeled datasets causes performance de…

2018-03-30abs ↗pdf ↗

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.

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.

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.

Paper proposes an alternative to anchor points for learning with noisy labels.

problem Learning with noisy labels is challenging due to inaccurate labels.
method Estimates transition matrix using clusterability condition and noisy labels.
result Estimation of transition matrix is more accurate and efficient than anchor points.

Bayes classifier cannot be learned from noisy labels without knowing noise distribution.

problem Learning a Bayes classifier from noisy labels when the noise distribution is unknown.
method Demonstrates the identifiability issues and proposes a simple algorithm for learning the Bayes decision rule.
result The Bayes decision rule is generally unidentified and cannot be learned without knowing the noise distribution.

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.

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 ability of learning from noisy labels is very useful in many visual recognition tasks, as a vast amount of data with noisy labels are relatively easy to obtain. Traditionally, the label noises have been treated as statistical outliers, and approaches such as importance re-weighting and bootstrap have been proposed …

2017-03-07abs ↗pdf ↗

We present a principled framework to address resource allocation for realizing boosting algorithms on substrates with communication or computation noise. Boosting classifiers (e.g., AdaBoost) make a final decision via a weighted vote from the outputs of many base classifiers (weak classifiers). Suppose that the base cl…

2019-09-10abs ↗pdf ↗

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.

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.

Study real-world noisy labels from human annotations for better understanding.

problem Understanding and modeling real-world label noise in machine learning.
method Developed two new benchmark datasets (CIFAR-10N, CIFAR-100N) with human-annotated real-world noisy labels.
result Real-world noisy labels exhibit instance-dependent patterns, not class-dependent as previously assumed.

We investigate the problem of estimating a given real symmetric signal matrix C\textbf{C} from a noisy observation matrix M\textbf{M} in the limit of large dimension. We consider the case where the noisy measurement M\textbf{M} comes either from an arbitrary additive or multiplicative rotational invariant perturbati…

2015-02-24abs ↗pdf ↗

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.

We consider the problem of clustering noisy high-dimensional data points into a union of low-dimensional subspaces and a set of outliers. The number of subspaces, their dimensions, and their orientations are unknown. A probabilistic performance analysis of the thresholding-based subspace clustering (TSC) algorithm intr…

2013-05-15abs ↗pdf ↗

Study shows exponential gap in sample complexity between noisy and non-noisy recurrent neural networks.

problem Understanding the impact of noise on the sample complexity of recurrent neural networks.
method Analyzing noisy multi-layered sigmoid recurrent neural networks with independent noise and proving lower bounds.
result Exponential gap in sample complexity between noisy and non-noisy networks, even for small noise values.

Paper tackles noisy bandit feedback for multiclass classification.

problem Learning multiclass classifier with corrupted feedback.
method Proposes an unbiased estimator technique to estimate noise rates and an end-to-end framework.
result Algorithm achieves mistake bounds of O(T)O(\sqrt{T}) in high noise and O(Ticefrac23)O(T^{ icefrac{2}{3}}) in worst case.

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.

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.

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.