Beyond Task Success: A Theory of Representation Reuse
Not on the map. Why?
Abstract (arXiv)
A learned representation is useful beyond its source task only if later tasks can make use of what the encoder has already learned. Source-task performance, however, gives no guarantee that the representation itself will remain useful once the original head is removed. We study representation reuse with respect to a specified family of future tasks. For such a family, we define the task-relevant state as the coarsest deterministic state sufficient for all of its tasks. A larger task family can require a finer state, and losing a required distinction makes at least one future task unrecoverable on a target support containing that conflict. Exact reuse also depends on how the retained information is presented to the downstream rule. We separate this into structural accessibility, which concerns whether the required distinctions remain recoverable, and coordinate consistency, which concerns whether those distinctions can be interpreted by the same downstream rule across samples. Both failure modes appear separately in the experiments. Reuse improves as task-relevant distinctions become more accessible. Reversible sample-dependent coordinate changes can sharply reduce reuse even when the representation remains recoverable, and inverting the applicable coordinate change restores performance. The same accessibility-reuse ordering appears in prospectively specified CIFAR-100 experiments with both ResNet-18 and DenseNet-121. Finally, preserving a candidate state that contains the distinctions needed by the anticipated task family improves reuse on compatible held-out tasks, with the clearest benefit when target supervision is limited. Representation reuse is therefore relative to the tasks that follow source learning: a useful representation must retain the distinctions those tasks need and make them available in a form that a shared downstream rule can use.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 24 references that are in the map. First posted on arXiv 13 Oct 2026.
Builds on
19 of 24 references.
References · 19
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 2016Understanding intermediate layers using linear classifier probescited by 1,353
- 2020What Makes for Good Views for Contrastive Learning?cited by 846
- 2018Disentangling by Factorisingcited by 616
- 2018Do Better ImageNet Models Transfer Better?cited by 565
- 2019Variational Autoencoders and Nonlinear ICA: A Unifying Frameworkcited by 503
- 2020What is being transferred in transfer learning?cited by 368
- 2017Emergence of Invariance and Disentanglement in Deep Representationscited by 215
- 2015The Benefit of Multitask Representation Learningcited by 195
- 2020LEEP: A New Measure to Evaluate Transferability of Learned Representationscited by 188
7 more
- 2020On Linear Identifiability of Learned Representationscited by 105
- 2022Rethinking Minimal Sufficient Representation in Contrastive Learningcited by 69
- 2024Cross-Entropy Is All You Need To Invert the Data Generating Processcited by 31
- 2023Structuring Representation Geometry with Rotationally Equivariant Contrastive Learningcited by 25
- 2024Features are fate: a theory of transfer learning in high-dimensional regressioncited by 13
- 2026Statistical and structural identifiability in representation learningcited by 6
- 2025Transfer Learning in Infinite Width Feature Learning Networkscited by 3
Built on by
Not cited yet.