cs.LGSep 4, 2026

Phase Transition Frequency as a Training Time Predictor of Test Accuracy in ResNets

Authors: Arunan J

Organizations: Independent Researcher, Chennai, Tamil Nadu, 600080, India.

Abstract

The number of discrete class-separability jumps observed during ResNet finetuning is examined empirically as a predictor of final test accuracy. Across 75 experiments spanning four benchmarks (CIFAR-10, CIFAR-100, TinyImageNet, and CIFAR-10-C) and three architectures (ResNet-18, ResNet-50, and ResNet-101), with five to ten seeds per configuration, a strong within-dataset negative correlation is obtained on standard i.i.d. classification benchmarks: r=−0.84r = -0.84 on CIFAR-10 (p<10−8p < 10^{-8}, n=30n = 30) and r=−0.87r = -0.87 on CIFAR-100 (p<10−5p < 10^{-5}, n=15n = 15). Under distributional stress, the relationship attenuates: TinyImageNet yields r=−0.45r = -0.45, and the CIFAR-10-C corruption benchmark yields r=−0.19r = -0.19. Two additional analyses discipline the empirical claim. A partial correlation controlling for architecture depth, treated as a linear covariate, shows that on CIFAR-100 the transition count retains statistically significant predictive power (rpartial=−0.69r_{\mathrm{partial}} = -0.69, p=0.007p = 0.007); the corresponding result under the stricter categorical conditioning is not established at n=15n = 15. A comparison against six alternative training-curve signals shows that transition count achieved the strongest correlation among the evaluated signals on CIFAR-100 and one of the strongest on CIFAR-10, but is dominated by other signals on the two stressed benchmarks. The comparison is restricted to training-curve-level signals; comparisons against effective rank, Hessian sharpness, Fisher information, margin, and neural-collapse measures, which are the strongest competitors in the current literature, are not part of the present study and remain open. The observation is presented as an in-distribution training-quality probe among a family of candidate probes, and an inexpensive detection procedure suitable for logging alongside a standard training loop is provided.

Explore similar work

Apr 13, 2026

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

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.
Aug 10, 2026

TLDChoiceNet: Quantitatively Choosing a Transfer Learning Dataset

Transfer learning is particularly useful in settings with limited training data, and within image classification it is common to transfer learn upon massive datasets like ImageNet , CIFAR-100, or COCO . Qualitatively, it seems a transfer learning dataset should have both more classes and more examples per class than the fine tuning dataset; however, a quantitative method to choose the best transfer learning dataset does not currently exist. In this paper, we design TLDChoiceNet, a model to choose the best transfer learning dataset given a fine tuning dataset by predicting the test-set accuracy after fine-tuning. A simple version 1 achieves 0.154 MSE on the test dataset, while a version 2 leveraging an ImageNet pre-trained ResNet50 v2 embedding with per-class information attains a 5X lower MSE of 0.031. We further design two metrics that enable an unsupervised method of choosing an optimal transfer learning dataset: distribution distance (DD), which linearly regresses against fine-tune accuracy with an R2 of 0.89, and average class correlation (ACC), which improves the R2 to 0.97. Our results underscore that a dataset's low-level statistics can explain the transfer learning effect, and that using a pre-trained ImageNet can embed different classes further apart in latent feature space.
Oct 16, 2026

The Sign Code: The Hidden Binary Nature of Deep Networks

Every neuron in a trained network outputs a number that can be separated into its sign (positive or negative) and its magnitude (absolute size). We call the set of all neuron signs the sign code. This raises a key question: does classification depend more on the sign code or on the magnitudes? For overparameterized vision classifiers with sign-preserving activations, the answer is overwhelmingly the sign code. A kk-nearest neighbor classifier operating only on this binary sign code achieves accuracy comparable to the full model across different architectures, activation functions, and datasets. Moreover, replacing all magnitudes in every layer with random noise while keeping the original signs barely changes residual network performance. In contrast, flipping just 20% of the signs reduces accuracy to chance. Models generalize well when same-class inputs share similar sign codes. When this overlap is disrupted by a regularizer, training accuracy remains high, but test performance collapses. A margin decomposition helps explain these results: the sign-only contribution to each logit grows as d\sqrt{d} in network width, dominating the magnitude residual. The natural unit of analysis for these networks may not be through their continuous weight space but instead through their discrete sign codes.