Transformer-based tabular foundation models (TFMs) achieve state-of-the-art performance on small to medium-sized tabular prediction tasks while processing diverse inputs through a shared stack of layers.
Recent layerwise analyses identify strong predictive performance in early TFM representations and substantial overlap in computation across layers.
However, early predictive accessibility alone does not establish whether later layers are dispensable for every input, and aggregate accuracy can obscure which inputs benefit from additional computation.
We study all 24 in-context-learning layers of TabPFN-3 across 272 classification datasets
combining representation geometry, prediction trajectories, truncation, and structural interventions, while also examining related representation dynamics in four additional TFMs.
We uncover a pronounced expansion-compression trajectory, with stronger late dimensional contraction associated with larger increases in class-prototype separation.
A targeted analysis of early-stabilizing samples
shows that substantial representational changes persist after predicted classes stabilize, while locally ambiguous queries obtain larger accuracy gains from shallow to late layers than well-separated queries.
Repeating a single pretrained block or perturbing layer order
reduces predictive performance on average, constraining simple post-hoc substitutions in the frozen model.
These findings distinguish predictive accessibility, class stability, and the benefits of continuing computation, supporting an input-dependent assessment of depthwise redundancy in TFMs.