Paper proposes methods to learn with multiple incorrect labels per example.
problem Learning with a single incorrect label per example limits potential.
method Proposes a novel problem setting allowing multiple incorrect labels per example and two learning methods.
result Demonstrates improved learning with multiple incorrect labels compared to single incorrect labels.
An active learner is given a hypothesis class, a large set of unlabeled examples and the ability to interactively query labels to an oracle of a subset of these examples; the goal of the learner is to learn a hypothesis in the class that fits the data well by making as few label queries as possible. This work addresses…
Practically, we are often in the dilemma that the labeled data at hand are inadequate to train a reliable classifier, and more seriously, some of these labeled data may be mistakenly labeled due to the various human factors. Therefore, this paper proposes a novel semi-supervised learning paradigm that can handle both l…
Study shows resampling labels improves classifier performance in noisy data.
problem Balancing sample size vs label reliability in noisy data.
method Comparing different validation strategies and analyzing MNIST database with varying noise levels.
result Classifier performance declines with high incorrect labels, highlighting the importance of resampling.
This paper improves loss functions for deep learning with noisy labels.
problem Training deep neural networks with noisy labels.
method The paper introduces a normalization technique to make any loss function robust to noisy labels and proposes a framework called Active Passive Loss (APL) to combine robust loss functions.
result The proposed APL framework consistently outperforms state-of-the-art methods, especially under high noise rates.
Classifier chains are popular and effective method to tackle a multi-label classification problem. The aim of this paper is to study the asymptotic properties of the chain model in which the conditional probabilities are of the logistic form. In particular we find conditions on the number of labels and the distribution…
CrossFilter tackles noisy labels in audio tagging.
problem Noisy labels in large audio datasets.
method CrossFilter framework using multiple representations and multi-task learning.
result Improves audio tagging performance on FSDKaggle2018 and FSDKaggle2019 datasets.
We study active learning where the labeler can not only return incorrect labels but also abstain from labeling. We consider different noise and abstention conditions of the labeler. We propose an algorithm which utilizes abstention responses, and analyze its statistical consistency and query complexity under fairly nat…
Deep-MIL models fail to respect key MIL assumption, leading to incorrect learning.
problem Deep-MIL models learn anti-correlated instances, violating the standard MIL assumption.
method Proposed algorithmic unit tests to identify violations of MIL assumptions.
result Five prominent deep-MIL models fail algorithmic unit tests, revealing incorrect learning.
Recently deep neural networks have shown their capacity to memorize training data, even with noisy labels, which hurts generalization performance. To mitigate this issue, we provide a simple but effective baseline method that is robust to noisy labels, even with severe noise. Our objective involves a variance regulariz…
Soft labeling impacts OOD detection in neural networks.
problem Impact of soft labeling on OOD detection in deep neural networks.
method Empirical analysis of how soft labeling affects OOD detection performance.
result Soft labeling can either improve or deteriorate OOD detection performance.
Datasets with significant proportions of noisy (incorrect) class labels present challenges for training accurate Deep Neural Networks (DNNs). We propose a new perspective for understanding DNN generalization for such datasets, by investigating the dimensionality of the deep representation subspace of training samples. …
Increasing variance of losses improves learning with noisy labels.
problem Learning with noisy labels and the need to penalize variance of losses.
method Designing regularizers based on the label noise transition matrix to increase variance of losses.
result Increasing variance of losses significantly improves generalization ability.
Recently deep neural networks have been successfully used for various classification tasks, especially for problems with massive perfectly labeled training data. However, it is often costly to have large-scale credible labels in real-world applications. One solution is to make supervised learning robust with imperfectl…
Doubly robust self-training improves semi-supervised learning by balancing labeled and pseudo-labeled data.
problem Improving semi-supervised learning performance with limited labeled data.
method Introduces doubly robust self-training, a method that combines labeled and pseudo-labeled data to balance between labeled-only and pseudo-labeled-only training.
result Demonstrates superior performance of doubly robust self-training on ImageNet and nuScenes datasets.
A reject option improves partial-label learning's accuracy.
problem Ambiguously labeled data in real-world applications.
method Risk-consistent nearest-neighbor algorithm with a reject option.
result Our method provides the best trade-off between non-rejected predictions' number and accuracy.
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.
The paper cleans label noise in supervised classification using Bernoulli sampling.
problem Label noise degrades supervised classifier performance.
method Proposes a label noise cleaning method based on Bernoulli random sampling.
result The method separates clean and noisy observations without prior label information.
We consider the problem of training a model under the presence of label noise. Current approaches identify samples with potentially incorrect labels and reduce their influence on the learning process by either assigning lower weights to them or completely removing them from the training set. In the first case the model…
Adaptive Misinformation defends against model stealing attacks by sending incorrect predictions for OOD queries.
problem Model stealing attacks clone target models using black-box query access and a surrogate dataset.
method Selective sending of incorrect predictions for Out-Of-Distribution (OOD) queries to degrade attacker's clone model accuracy.
result Our defense reduces attacker's clone model accuracy by up to 40% while maintaining benign user accuracy under 0.5%.
New method reduces neural network memorization of noisy labels.
problem Neural networks memorize label noise, leading to poor generalization.
method Proposes an auxiliary network that predicts gradients without labels.
result Reduces memorization of label-noise, improving generalization.
OpinionRank uses graph-based ranking to improve unreliable crowdsourced labels.
problem Improving trustworthiness of crowdsourced labels for machine learning.
method Graph-based spectral ranking to integrate unreliable labels.
result OpinionRank outperforms conventional algorithms in reliability and scalability.
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.
New method improves false-/true-positive-rate estimation in fraud detection with noisy labels.
problem Estimating FPR/TPR in fraud detection with class-conditional label noise.
method Directly cleaning model's validation data to de-correlate cleaning error with model scores.
result Improves accuracy of FPR/TPR estimates, especially in asymmetric label noise scenarios.
Critiques incorrect fixed point assertions in digital topology.
problem Incorrect or incorrectly proven fixed point assertions in digital topology.
method Critical review of existing assertions.
result Identifies and critiques incorrect fixed point assertions.
New taxonomy reveals different detection limits for various types of fraud.
problem Existing fraud detection treats all fraud as the same, ignoring its diverse forms.
method Introduced an observation-mechanism taxonomy with five fraud classes.
result Separate estimation by fraud class outperforms pooled estimation.
Corrects incorrect assertions about fixed points in digital topology.
problem Incorrect or incorrectly proven assertions about fixed points in digital metric spaces.
method Analysis of existing assertions and proofs.
result Identifies and corrects errors in published assertions.
Adversarial examples are delicately perturbed inputs, which aim to mislead machine learning models towards incorrect outputs. While most of the existing work focuses on generating adversarial perturbations in multi-class classification problems, many real-world applications fall into the multi-label setting in which on…
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 …
New method improves LLM judge accuracy by accounting for dependencies in aggregated binary labels.
problem Classical label aggregation methods fail to account for dependencies among LLM judges, leading to miscalibrated predictions.
method Dependence-aware models based on Ising graphical models and latent factors.
result The proposed method outperforms classical methods on real-world datasets, reducing excess risk.
A new SSL method uses instance-dependent thresholds to improve accuracy.
problem Improving semi-supervised learning by better selecting confident unlabeled instances.
method Proposes instance-dependent thresholds that vary based on the ambiguity and error rates of pseudo-labels for each unlabeled instance.
result Demonstrates that instance-dependent thresholds provide a probabilistic guarantee for correct pseudo-labels.
The paper identifies and analyzes subjective class issues in user-generated data.
problem Subjective labels in user-generated data can lead to biased and manipulated results.
method Defined subjective and objective classes, proposed a framework for detecting subjective labels.
result Data mining practitioners can detect and avoid subjective class issues early in their projects.
BCCP uses bandit feedback to provide reliable predictions with limited labeled data.
problem Limited labeled data and bandit feedback challenge online set-valued classification.
method BCCP uses stochastic gradient descent to train model and make set-valued inferences with unbiased estimation of true label.
result BCCP offers coverage guarantees on a class-specific granularity.
Improves fault detection models in noisy data.
problem Poor generalization due to mislabeled samples in fault detection.
method Two-step framework: outlier identification and data modification.
result Significantly improved model generalization under label noise.
Incorrect fixed point assertions in digital topology are discussed.
problem Incorrect or poorly stated fixed point assertions in digital topology.
method Discussion of problematic publications in digital metric spaces.
result Clarification of incorrect fixed point assertions.
Incorrect fixed point assertions in digital topology are discussed.
problem Incorrect, incorrectly proven, or trivial fixed point assertions in digital topology.
method Continues earlier work on identifying and critiquing bad fixed point assertions.
result Clarifies the nature and extent of incorrect fixed point assertions in digital topology.
Weakly supervised data are widespread and have attracted much attention. However, since label quality is often difficult to guarantee, sometimes the use of weakly supervised data will lead to unsatisfactory performance, i.e., performance degradation or poor performance gains. Moreover, it is usually not feasible to man…
Machine learning offers novel ways and means to design personalized learning systems wherein each student's educational experience is customized in real time depending on their background, learning goals, and performance to date. SPARse Factor Analysis (SPARFA) is a novel framework for machine learning-based learning a…
FavMac maximizes value while controlling cost in multi-label prediction.
problem Value-maximizing predictions with strict cost control in multi-label scenarios.
method FavMac pipeline combining any multi-label classifier with online update mechanism.
result FavMac achieves higher value with strict cost control compared to baselines.
C-Mixup improves generalization in regression tasks by adjusting label similarity.
problem Improving generalization in regression tasks with limited data.
method C-Mixup adjusts the probability of mixing examples based on label similarity.
result C-Mixup achieves better generalization and robustness compared to vanilla mixup.
End-to-end deep learning for multi-view clustering improves accuracy across various data types.
problem Limited multi-view clustering methods for general data types and suboptimal two-stage process.
method Permutation-based canonical correlation objective for fused representations; pseudo-labels for clustering; theoretical error bound.
result Proposed model provides meaningful fused representations and effective clustering across multiple views.
Method interprets deep learning models using topological data analysis.
problem Lack of interpretability in deep learning models, especially in high-risk applications.
method Topological and geometric data analysis to infer features and decision-making mechanisms of DL models.
result Extracted subgraphs reveal relevant features for model decisions, demonstrating model's reliance on pertinent data.
Wide networks learn from adversarial perturbations effectively.
problem Understanding why adversarial examples deceive classifiers and transfer between models.
method Assumed wide two-layer networks, proved with theoretical analysis.
result Adversarial perturbations contain class-specific features for networks to generalize.
Paper proposes a method to train robust neural networks without labeled data.
problem Training robust neural networks without class labels.
method Adversarial contrastive learning framework using unlabeled data.
result Robust Contrastive Learning (RoCL) achieves comparable robust accuracy to supervised methods and significantly improved robustness.
We introduce a two-player contest for evaluating the safety and robustness of machine learning systems, with a large prize pool. Unlike most prior work in ML robustness, which studies norm-constrained adversaries, we shift our focus to unconstrained adversaries. Defenders submit machine learning models, and try to achi…
The paper corrects and improves previous assertions in digital topology.
problem Incorrect or poorly proven assertions in digital topology.
method Review and correction of existing assertions.
result Improved and corrected assertions in digital topology.
This paper presents a novel approach for detection of liver abnormalities in an automated manner using ultrasound images. For this purpose, we have implemented a machine learning model that can not only generate labels (normal and abnormal) for a given ultrasound image but it can also detect when its prediction is like…
Study shows AD for neural nets with machine-representable numbers can be incorrect.
problem Correctness of AD for neural nets with machine-representable numbers.
method Analyzed two sets of parameters: incorrect and non-differentiable. Proved bounds and conditions for AD correctness.
result AD can be incorrect for machine-representable numbers, but provides a Clarke subderivative on non-differentiable set.