The paper investigates how two signals—input‑conditional uncertainty and prediction‑label loss—detect different types of data corruption in federated learning. Experiments on ResNet‑20 with CIFAR‑10 and SVHN show that prediction‑label loss excels at spotting persistent random label flips, while expected‑entropy uncertainty better identifies additive image noise. The authors argue that effective federated data‑quality assessment must match the chosen signal to the specific corruption type rather than rely solely on uncertainty measures.
arXiv:2608. 13601v1 Announce Type: new Abstract: Active learning can reduce labeling cost by selecting informative examples, but the most uncertain examples may also be the hardest to label correctly.
arXiv:2606. 14965v1 Announce Type: new Abstract: Synthetic instance-dependent label noise (IDN) benchmarks are widely used to evaluate noisy-label learning methods, yet existing approaches typically generate noise through imperfect annotators or classifier raters, leaving the source of ambiguity implicit.
arXiv:2608. 06511v1 Announce Type: new Abstract: Adaptive data-cleaning methods replace manual filtering thresholds with data-driven partitions.
arXiv:2606. 11319v1 Announce Type: new Abstract: Learning from imperfect data is a central theme in machine learning, connecting practical questions of robustness to fundamental questions of learnability.
arXiv:2408. 01139v4 Announce Type: replace Abstract: Perturbation robustness evaluates the vulnerabilities of models, arising from a variety of perturbations, such as data corruptions and adversarial attacks.
arXiv:2609.16380v1 Announce Type: new Abstract: Class-balanced learning and label noise create a coupled failure mode: frequency correction prevents majority classes from dominating the decision rule...
arXiv:2508. 00042v2 Announce Type: replace-cross Abstract: Machine learning models deployed in non-stationary environments degrade silently, since as the input distribution drifts their accuracy decays without an error signal and without labels to reveal it.
arXiv:2606. 16524v1 Announce Type: new Abstract: Engineered robust losses such as Huber, Student-$t$, and generalised cross-entropy make supervised models tolerant of contamination but cannot answer which observations are corrupted.
arXiv:2607. 12438v1 Announce Type: new Abstract: Deep networks trained with label noise often learn clean structure before memorizing corrupted labels.
The paper introduces a training‑free, human‑in‑the‑loop anomaly detection framework that allows a domain expert to correct a PatchCore detector by editing its memory bank, without retraining or using gradients. Using only ten golden samples, operator corrections close a median 66% of the performance gap to a fully trained bank, improving 12 of 15 MVTec AD categories while harming none. The approach is evaluated with a rigorous held‑out protocol and shows that passive and active querying yield statistically indistinguishable gains, with a defect‑memory extension failing decisively.
arXiv:2609.16788v1 Announce Type: new Abstract: Noise2Noise (N2N) trains denoisers on pairs of independently corrupted observations, eliminating clean references. We stress-test two natural conjectur...
SAGG: Sample-Adaptive Gradient Gating for Robust Multimodal Learning under Heterogeneous Corruption proposes a new method for handling sample-heterogeneous corruption in multimodal training. The authors prove that batch-level, sample-agnostic linear estimators with a shared modulation parameter inevitably incur bias, and that a sample-level all-or-nothing gating strategy is the only unbiased approach within a natural estimator class. SAGG implements a binary retain-or-discard decision per sample using an online feature-norm quality test and a truncation mechanism for variance control, and demonstrates convergence to clean-loss stationary points while achieving superior performance over ten existing methods on Kinetics-Sounds and UCF-101 under various corruption scenarios.