cs.LGApr 13, 2026

Not All Forgetting Is Equal: Retention Dynamics in Fine-Tuned Image Classifiers

Authors: Miit DagaSwarna Priya Ramu

Abstract

Fine-tuning a pretrained classifier leaves some samples reliably learned and others cycling between correct and incorrect. Curriculum learning, data pruning and dataset cartography assume that pattern is a property of the sample, untested. We record per-sample correctness at every epoch while fine-tuning ResNet-18 and DeiT-Small on an imbalanced retinal OCT dataset and CUB-200-2011, matching samples by image identity and holding the split fixed across seeds. Per-sample retention is reproducible: cross-run Spearman correlation of the fitted decay constant is 0.37 to 0.59 over ten seeds. It is architecture-specific: two runs of one backbone agree more than two backbones on identical data (0.45 and 0.59 within against 0.30 between on OCTDL). Loss after five frozen-backbone epochs predicts a different run's decay constant at 0.29 to 0.43. The Ebbinghaus exponential does not survive: monotone decay, the one shape it can represent, is 0.1% to 0.8% of samples, and on traces that do forget mean R-squared is negative in all four configurations. A power law and a free-asymptote variant fail on the same traces: the defect is monotonicity. Across five sampling arms with matched exposure, prioritisation ratios of 2.7x to 28x, and an online variant, none of 48 comparisons against uniform sampling survives Benjamini-Hochberg correction, though three seeds detect only about four accuracy points. A stable, cheap difficulty score does not buy generalisation through sampling. Patient-grouped splitting, the remedy for a leak reaching 76% to 78% of OCT test images, moves that dataset's headline metrics by less than their run-to-run spread.

Explore similar work

Sep 14, 2026stat.ML

Mini-batch Sampling Strategies for Long-Tailed Image Classification: An Empirical Study on CIFAR-100-LT

Real-world datasets often exhibit long-tailed class distributions, where a few head classes contain a large number of training samples while a large number of tail classes have only a few. The composition of each mini-batch, determined by the sampling strategy, governs which classes contribute to the stochastic gradient estimate, and therefore affects convergence behaviour and generalisation across the whole class spectrum. We provide a systematic theoretical and empirical comparison of four mini-batch sampling strategies for long-tailed image classification: uniform instance sampling, class-balanced sampling, square-root sampling, and progressively balanced sampling. We place all four in a unified bias-variance framework describing their effect on gradient estimation, which exposes the tension between unbiased optimisation of the empirical loss and fair representation of rare classes. We then evaluate them under controlled conditions using ResNet-32 on CIFAR-100-LT at three imbalance ratios (rho = 10, 50, 100), with every strategy sharing the same long-tailed subsets and initialisation within a seed. Progressive sampling improves tail-class accuracy by 25% relative to the uniform baseline at rho = 100 (13.5% versus 10.8%), consistently across all three seeds, while its overall accuracy is not distinguishable from that of uniform sampling given the seed-to-seed variation (40.0% versus 39.7%); the tail-class gain, not the overall gain, is the robust effect. At rho = 100, class-balanced sampling degrades accuracy on every class group, including the tail classes it is designed to help, which we attribute to overfitting caused by extreme oversampling of scarce data; at rho = 50 this failure is confined to head and medium classes. These results indicate that when rebalancing is applied during training matters as much as how much rebalancing is applied.
Siyu Yuan
Jun 23, 2026cs.LG

The Gentle Collapse: Distributional Metrics for Continual Learning

Accuracy degradation is the standard metric for Catastrophic Forgetting (CF), however, it records only whether forgetting occurred or not. It saturates at the extremes and collapses discretely at task boundaries, hiding the internal structure of what is being forgotten. We introduce six softmax-derived metrics spanning true-label rank (TLR), predictive confidence, and distributional divergence that characterize forgetting continuously, each normalized to [0, 1] with no modification to training. On CIFAR-100, these metrics carry information where accuracy does not: at 0% accuracy, the Confusion Margin spans an IQR of [0.32, 0.50] across classes that accuracy treats identically. We demonstrate that this richer signal is actionable in mitigating catastrophic forgetting. Per-sample metric scores used as loss weights reduce forgetting by 1.3 percentage points over uniform experience replay (ER) on CIFAR-100. Furthermore, the slope of a metric over a small window provides a stable sampling criterion: at a small-window size (e.g. 3 epochs), accuracy-trend degrades to 34.79% (std. = 2.32) while log-TLR achieves 41.07% (std. = 0.57). This gap is structural since reliable small-window trend estimation requires a continuous signal. On TinyImageNet, log-TLR trend sampling reduces forgetting by 7.7 percentage points over the ER baseline.
Ahmed Anwar, Andreas Wagner, Federico Raue +2
Aug 13, 2026cs.AI

Uniform Herding: Exemplar Replay with Representation Refresh

As the feature representation changes, replay must preserve the earlier classes. However, only a bounded active exemplar set can be replayed. We propose Uniform Herding, which allocates the current active set across observed classes and uses a bounded candidate pool to refresh their chosen exemplars in the current representation. On CIFAR-100 with ten class-incremental tasks, a ResNet-18 backbone, active budget M=2,000M=2{,}000, retrieval budget b=64b=64, and three seeds, Uniform Herding obtains 44.00±0.51%44.00\pm0.51\% final average accuracy and 17.22±0.43%17.22\pm0.43\% forgetting, compared with 42.33±1.20%42.33\pm1.20\% and 24.87±1.11%24.87\pm1.11\% for iCaRL. Within the Uniform Herding protocol, final accuracy decreased when NME or herding was replaced with the tested alternatives, while forgetting increased when distillation was removed. Changing the retrieval budget has a smaller effect across the tested range than changing the active budget. The comparison with iCaRL is end-to-end. It does not isolate the effect of refresh from the other protocol differences. These results are limited to the tested protocol.
Krishna Subedi