Paper tackles instance-dependent label noise by approximating it with part-dependent noise.
problem Learning with instance-dependent label noise is challenging.
method Approximate instance-dependent label noise with part-dependent noise. Use transition matrices for parts to model noise.
result Method outperforms state-of-the-art approaches for instance-dependent label noise.
A method uses confidence scores to handle noisy labels for each instance.
problem Learning with noisy labels where each instance's label can randomly change.
method Introduces confidence-scored instance-dependent noise (CSIDN) to estimate transition distributions for each instance.
result Demonstrates the utility and effectiveness of CSIDN through experiments with synthetic and real-world noise.
A method to approximate instance-dependent label noise using instance-confidence embedding.
problem Real-world label noise that depends on individual instances.
method Variational approximation with instance embedding to capture instance-specific label corruption.
result ICE method effectively approximates instance-dependent noise and detects ambiguous instances.
BeGIN benchmarks GNNs for instance-dependent label noise in graphs.
problem Instance-dependent label noise in graph data.
method BeGIN introduces a benchmark with various noise types and evaluates noise-handling strategies across GNN architectures.
result Challenges of instance-dependent noise, especially LLM-based corruption, and the importance of node-specific parameterization.
Paper proposes a universal probabilistic model for handling instance-dependent label noise.
problem Instance-dependent label noise in data quality challenges DNN training robustness.
method Categorizes instances into confusing and unconfusing, proposes a probabilistic model.
result Significant improvements in robustness over state-of-the-art methods on various datasets.
A new method handles label noise by leveraging causal information.
problem Label noise degrades deep learning performance.
method Proposes a novel generative approach using a structural causal model.
result Improves classifier performance on label-noise datasets.
CORES2 removes noisy labels by sieving out corrupted examples.
problem Instance-dependent label noise degrades DNN performance.
method CORES2 (COnfidence REgularized Sample Sieve) progressively sieves out corrupted examples.
result CORES2 provides theoretical guarantees for filtering out corrupted examples.
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.
This paper identifies and estimates the label noise transition matrix without ground truth labels.
problem Learning with noisy labels and identifying the noise transition matrix.
method Building on Kruskal's identifiability results, the paper characterizes the identifiability of the label noise transition matrix for the generic case at the instance level.
result The necessity of multiple noisy labels in identifying the noise transition matrix for the generic case at the instance level.
New method for certified unlearning reduces noise injection.
problem Achieving formal unlearning guarantees with adaptive noise calibration.
method Adaptive per-instance noise calibration based on individual data point sensitivities.
result Derivation of high-probability per-instance sensitivity bounds for ridge regression.
Method reweights instances and classes to improve robustness in noisy data.
problem Improving deep learning performance in the presence of label noise.
method Formulates constrained optimization problems to assign importance weights to instances and class labels.
result Significant performance gains observed in benchmark datasets with label noise.
New research shows that binary classification can be done with noisy data, but only if there are clean samples available.
problem Learning binary classification with instance and label dependent label noise.
method Theoretical analysis and empirical risk minimization.
result Empirical risk minimization achieves the optimal excess risk bound without additional assumptions.
It is widely known in the machine learning community that class noise can be (and often is) detrimental to inducing a model of the data. Many current approaches use a single, often biased, measurement to determine if an instance is noisy. A biased measure may work well on certain data sets, but it can also be less effe…
The presence of noisy instances in mobile phone data is a fundamental issue for classifying user phone call behavior (i.e., accept, reject, missed and outgoing), with many potential negative consequences. The classification accuracy may decrease and the complexity of the classifiers may increase due to the number of re…
Batch Normalization (BN)(Ioffe and Szegedy 2015) normalizes the features of an input image via statistics of a batch of images and hence BN will bring the noise to the gradient of the training loss. Previous works indicate that the noise is important for the optimization and generalization of deep neural networks, but …
Vote-boosting is a sequential ensemble learning method in which the individual classifiers are built on different weighted versions of the training data. To build a new classifier, the weight of each training instance is determined in terms of the degree of disagreement among the current ensemble predictions for that i…
MARVEL curbs memorization of noisy labels in deep nets.
problem Noisy labels degrade deep net performance.
method MARVEL tracks classification margins to identify and abandon noisy instances.
result MARVEL outperforms baselines on noisy datasets.
New LP method recovers MAP solution from noisy stable instances.
problem MAP inference on noisy stable instances.
method Designing an algorithm to find nearby perturbation stable instances and using LP relaxation.
result LP approximately recovers the MAP solution from noisy stable instances.
Study improves model robustness in noisy datasets.
problem Instance-specific label noise in robust classification tasks.
method Coordinated Sparse Recovery (CSR) method introduces a collaboration matrix and confidence weights to reduce generalization error.
result CSR and CSR+ significantly reduce generalization error compared to existing methods.
In this paper, we consider a novel machine learning problem, that is, learning a classifier from noisy label distributions. In this problem, each instance with a feature vector belongs to at least one group. Then, instead of the true label of each instance, we observe the label distribution of the instances associated …
Inserting label noise can improve model accuracy and fairness.
problem Improving model accuracy and fairness with noisy labels.
method Increasing label noise rates to balance and detect noisy instances.
result Inserting label noise can lead to more accurate and fair models.
Instance- and Label-dependent label Noise (ILN) widely exists in real-world datasets but has been rarely studied. In this paper, we focus on Bounded Instance- and Label-dependent label Noise (BILN), a particular case of ILN where the label noise rates -- the probabilities that the true labels of examples flip into the …
NoiseRank reduces label noise without supervision, improving classification accuracy.
problem Label noise in datasets from noisy channels.
method NoiseRank uses Markov Random Fields to estimate and rank instances based on their noise probability.
result NoiseRank improves classification accuracy on noisy datasets.
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.
In Machine Learning, ensemble methods have been receiving a great deal of attention. Techniques such as Bagging and Boosting have been successfully applied to a variety of problems. Nevertheless, such techniques are still susceptible to the effects of noise and outliers in the training data. We propose a new method for…
In this paper, we consider batch supervised learning where an adversary is allowed to corrupt instances with arbitrarily large noise. The adversary is allowed to corrupt any l features in each instance and the adversary can change their values in any way. This noise is introduced on test instances and the algorithm r…
Diffusion-GAN uses diffusion to improve GAN training stability and realism.
problem Stability and realism issues in training GANs.
method Diffusion-GAN employs a forward diffusion chain to generate Gaussian-mixture distributed instance noise, with adaptive diffusion process and timestep-dependent discriminator.
result Diffusion-GAN produces more realistic images with higher stability and data efficiency.
The objective function of a matrix factorization model usually aims to minimize the average of a regression error contributed by each element. However, given the existence of stochastic noises, the implicit deviations of sample data from their true values are almost surely diverse, which makes each data point not equal…
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.
Paper tackles noisy similarity labels for multi-class classification.
problem Learning multi-class classifiers from noisy similarity-labeled data.
method Proposes a method using a noise transition matrix to learn from noisy data.
result Demonstrates superior performance compared to state-of-the-art methods.
New method uses SLL to create masks for PX in noisy optimization problems.
problem Effective optimization in noisy problems with hidden variable dependencies.
method Statistical Linkage Learning (SLL) for decomposition and mask construction.
result Proposed method maintains effectiveness in noisy conditions and outperforms state-of-the-art.
Proposes MGPLL for PL learning with non-random noise.
problem Partial label learning with non-random label noise.
method Bi-directional mapping framework, conditional noise label generation, multi-class predictor, adversarial learning.
result Demonstrates state-of-the-art performance in partial label learning.
Not all instances in a data set are equally beneficial for inducing a model of the data. Some instances (such as outliers or noise) can be detrimental. However, at least initially, the instances in a data set are generally considered equally in machine learning algorithms. Many current approaches for handling noisy and…
Study bounds noise level in linear regression with dependent data.
problem Analyzing noise level in linear regression with dependent data.
method Derive upper bounds for random design linear regression with β-mixing data, without realizability assumptions. result Correctly recovers the noise level of the problem, exhibiting graceful degradation with misspecification.
Federated learning performs distributed model training using local data hosted by agents. It shares only model parameter updates for iterative aggregation at the server. Although it is privacy-preserving by design, federated learning is vulnerable to noise corruption of local agents, as demonstrated in the previous stu…
Study efficient learning of halfspaces with constant noise tolerance.
problem Learning halfspaces in the presence of both instance and label corruption.
method Develops an algorithm to minimize reweighted hinge loss for robustness.
result Achieves constant noise tolerance for halfspace learning.
Supervised deep-embedding methods project inputs of a domain to a representational space in which same-class instances lie near one another and different-class instances lie far apart. We propose a probabilistic method that treats embeddings as random variables. Extending a state-of-the-art deterministic method, Protot…
Noise-ignorant empirical risk minimization achieves state-of-the-art performance on noisy data.
problem Learning with noisy labels in multi-class classification problems.
method Introducing relative signal strength (RSS) to quantify transferability and applying Noise Ignorant Empirical Risk Minimization (NI-ERM).
result NI-ERM achieves state-of-the-art performance on CIFAR-N data challenge.
Paper improves differential privacy SGD by considering data heterogeneity.
problem Improving differential privacy in machine learning with varying data contributions.
method Introducing influence function to quantify data contributions, designing PIDP-SGD algorithm.
result PIDP-SGD significantly improves machine learning model performance.
Study on noise models for noisy labels in NLP.
problem Quality of noise models from noisy labels.
method Theoretical analysis and synthetic dataset creation.
result Expected error of noise models derived.
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%.
RECLAIM discovers causal graphs in cyclic, noisy systems.
problem Discovering causal relationships in cyclic, noisy systems.
method RECLAIM uses EM with residual normalizing flows to handle cycles and noise.
result RECLAIM effectively discovers causal graphs in both synthetic and real-world datasets.
A key requirement for supervised machine learning is labeled training data, which is created by annotating unlabeled data with the appropriate class. Because this process can in many cases not be done by machines, labeling needs to be performed by human domain experts. This process tends to be expensive both in time an…
Existing relation classification methods that rely on distant supervision assume that a bag of sentences mentioning an entity pair are all describing a relation for the entity pair. Such methods, performing classification at the bag level, cannot identify the mapping between a relation and a sentence, and largely suffe…
This paper proposes an active metric learning method for clustering with pairwise constraints.
problem Clustering with pairwise constraints and improving clustering performance.
method Active metric learning method that queries informative instance pairs and updates the learned metric sequentially.
result The proposed method enhances clustering performance and provides a tighter error bound.
Paper improves image classification accuracy with a new Noise Modeling Network.
problem Improving performance of multi-label image classifiers with noisy or missing labels.
method Integrates a Noise Modeling Network (NMN) with a CNN to jointly learn noise distribution and CNN parameters.
result Consistently improves classification performance on MSR-COCO and MSR-VTT datasets.
Collecting large-scale data with clean labels for supervised training of neural networks is practically challenging. Although noisy labels are usually cheap to acquire, existing methods suffer a lot from label noise. This paper targets at the challenge of robust training at high label noise regimes. The key insight to …
Removing or filtering outliers and mislabeled instances prior to training a learning algorithm has been shown to increase classification accuracy. A popular approach for handling outliers and mislabeled instances is to remove any instance that is misclassified by a learning algorithm. However, an examination of which l…