Trust the Unreliability: Inward Backward Dynamic Unreliability Driven Coreset Selection for Medical Image Classification

• URL: http://arxiv.org/abs/2603.17603v1
• Date: Wed, 18 Mar 2026 11:16:56 GMT
• Title: Trust the Unreliability: Inward Backward Dynamic Unreliability Driven Coreset Selection for Medical Image Classification
• Abstract summary: Coreset selection helps reduce computational costs, but its effectiveness in medical data remains limited due to inherent complexity.<n>We propose the Dynamic Unreliability-Driven Coreset Selection(DUCS) strategy.
• Score: 10.037055301139443
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficiently managing and utilizing large-scale medical imaging datasets with limited resources presents significant challenges. While coreset selection helps reduce computational costs, its effectiveness in medical data remains limited due to inherent complexity, such as large intra-class variation and high inter-class similarity. To address this, we revisit the training process and observe that neural networks consistently produce stable confidence predictions and better remember samples near class centers in training. However, concentrating on these samples may complicate the modeling of decision boundaries. Hence, we argue that the more unreliable samples are, in fact, the more informative in helping build the decision boundary. Based on this, we propose the Dynamic Unreliability-Driven Coreset Selection(DUCS) strategy. Specifically, we introduce an inward-backward unreliability assessment perspective: 1) Inward Self-Awareness: The model introspects its behavior by analyzing the evolution of confidence during training, thereby quantifying uncertainty of each sample. 2) Backward Memory Tracking: The model reflects on its training tracking by tracking the frequency of forgetting samples, thus evaluating its retention ability for each sample. Next, we select unreliable samples that exhibit substantial confidence fluctuations and are repeatedly forgotten during training. This selection process ensures that the chosen samples are near the decision boundary, thereby aiding the model in refining the boundary. Extensive experiments on public medical datasets demonstrate our superior performance compared to state-of-the-art(SOTA) methods, particularly at high compression rates.

Related papers

• Uncertainty-Aware Exploratory Direct Preference Optimization for Multimodal Large Language Models [53.15468578562038]
  We propose an Uncertainty-aware Exploratory Direct Preference Optimization (UE-DPO) method for Multimodal Large Language Models (MLLMs)<n>We first quantify the uncertainty from the model's failure to ground token predictions in the given image.<n>We then encourage more learning pressure on visually deficient tokens in preferred samples, and alleviate the over-penalization of beneficial knowledge in dispreferred samples.
  arXiv  Detail & Related papers  (2026-05-06T13:08:12Z)
• Modest-Align: Data-Efficient Alignment for Vision-Language Models [67.48633659305592]
  Cross-modal alignment models often suffer from overconfidence and degraded performance when operating in resource-constrained settings.<n>We propose Modest-Align, a lightweight alignment framework designed for robustness and efficiency.<n>Our method offers a practical and scalable solution for cross-modal alignment in real-world, low-resource scenarios.
  arXiv  Detail & Related papers  (2025-10-24T16:11:10Z)
• Data Unlearning Beyond Uniform Forgetting via Diffusion Time and Frequency Selection [5.350009804371616]
  Data unlearning aims to remove the influence of specific training samples from a trained model without requiring full retraining.<n>We argue that forgetting occurs disproportionately across time and frequency, depending on the model and scenarios.<n>By selectively focusing on specific time-frequency ranges during training, we achieve samples with higher aesthetic quality and lower noise.
  arXiv  Detail & Related papers  (2025-10-20T02:00:12Z)
• Pseudo-D: Informing Multi-View Uncertainty Estimation with Calibrated Neural Training Dynamics [3.8836478189829164]
  One-hot labels erase inter-rater variability and force models to make overconfident predictions.<n>We introduce a novel framework that brings uncertainty back into the label space.
  arXiv  Detail & Related papers  (2025-09-15T11:30:12Z)
• CALICO: Confident Active Learning with Integrated Calibration [11.978551396144532]
  We propose an AL framework that self-calibrates the confidence used for sample selection during the training process. We show improved classification performance compared to a softmax-based classifier with fewer labeled samples.
  arXiv  Detail & Related papers  (2024-07-02T15:05:19Z)
• Noisy Correspondence Learning with Self-Reinforcing Errors Mitigation [63.180725016463974]
  Cross-modal retrieval relies on well-matched large-scale datasets that are laborious in practice. We introduce a novel noisy correspondence learning framework, namely textbfSelf-textbfReinforcing textbfErrors textbfMitigation (SREM)
  arXiv  Detail & Related papers  (2023-12-27T09:03:43Z)
• Tackling the Incomplete Annotation Issue in Universal Lesion Detection Task By Exploratory Training [10.627977735890191]
  Universal lesion detection has great value for clinical practice as it aims to detect lesions in multiple organs on medical images. Deep learning methods have shown promising results, but demanding large volumes of annotated data for training. We introduce a teacher-student detection model as basis, where the teacher's predictions are combined with incomplete annotations to train the student.
  arXiv  Detail & Related papers  (2023-09-23T08:44:07Z)
• Paced-Curriculum Distillation with Prediction and Label Uncertainty for Image Segmentation [25.20877071896899]
  In curriculum learning, the idea is to train on easier samples first and gradually increase the difficulty. In self-paced learning, a pacing function defines the speed to adapt the training progress. We develop a novel paced-curriculum distillation (PCD) for medical image segmentation.
  arXiv  Detail & Related papers  (2023-02-02T12:24:14Z)
• Towards Robust Visual Question Answering: Making the Most of Biased Samples via Contrastive Learning [54.61762276179205]
  We propose a novel contrastive learning approach, MMBS, for building robust VQA models by Making the Most of Biased Samples. Specifically, we construct positive samples for contrastive learning by eliminating the information related to spurious correlation from the original training samples. We validate our contributions by achieving competitive performance on the OOD dataset VQA-CP v2 while preserving robust performance on the ID dataset VQA v2.
  arXiv  Detail & Related papers  (2022-10-10T11:05:21Z)
• Active Learning for Deep Visual Tracking [51.5063680734122]
  Convolutional neural networks (CNNs) have been successfully applied to the single target tracking task in recent years. In this paper, we propose an active learning method for deep visual tracking, which selects and annotates the unlabeled samples to train the deep CNNs model. Under the guidance of active learning, the tracker based on the trained deep CNNs model can achieve competitive tracking performance while reducing the labeling cost.
  arXiv  Detail & Related papers  (2021-10-17T11:47:56Z)
• Contextual Dropout: An Efficient Sample-Dependent Dropout Module [60.63525456640462]
  Dropout has been demonstrated as a simple and effective module to regularize the training process of deep neural networks. We propose contextual dropout with an efficient structural design as a simple and scalable sample-dependent dropout module. Our experimental results show that the proposed method outperforms baseline methods in terms of both accuracy and quality of uncertainty estimation.
  arXiv  Detail & Related papers  (2021-03-06T19:30:32Z)
• Automatic Recall Machines: Internal Replay, Continual Learning and the Brain [104.38824285741248]
  Replay in neural networks involves training on sequential data with memorized samples, which counteracts forgetting of previous behavior caused by non-stationarity. We present a method where these auxiliary samples are generated on the fly, given only the model that is being trained for the assessed objective. Instead the implicit memory of learned samples within the assessed model itself is exploited.
  arXiv  Detail & Related papers  (2020-06-22T15:07:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.