Paper deep dive
Cheap Probes Predict Expensive Training in 3D-CT Vision--Language Models
Renjie Liang
Intelligence
Status: succeeded | Model: Gemma-4-26B-A4B | Prompt: intel-v1 | Confidence: 90%
Last extracted: 8/2/2026, 1:32:45 PM
Summary
This paper proposes a method to predict the performance of 3D CT vision-language models (VLMs) using cheap, lightweight probes on frozen image encoder embeddings, rather than performing expensive full fine-tuning for every encoder-compression combination. The authors construct a benchmark with clinical attributes and validation gates, demonstrating that probe scores (AUROC) correlate strongly (r=0.95) with downstream report-generation metrics, allowing for rapid screening of model components.
Entities (11)
Relation Signals (7)
Cheap Probes ā predicts ā Expensive Training Performance
confidence 95% Ā· The cheap probe orders the candidates in close agreement with expensive fine-tuning, at about rā0.95
CT-RATE ā usedfor ā Benchmark Construction
confidence 95% Ā· Cells are built on CT-RATE non-contrast chest CT [9].
CoLiPri ā istype ā Grid Encoder
confidence 92% Ā· Grid encoders produce a dense token grid: CoLiPri [14] and CT-CLIP [8] are contrastive
BTB3D ā istype ā Reconstruction Tokenizer
confidence 92% Ā· BTB3D [10] is a reconstruction tokenizer with low-dimensional (18-d) codebook tokens.
ABMIL ā achieveshighaccuracy ā Disease Probe AUROC
confidence 90% Ā· attention pooling (ABMIL-multi 0.749)... roughly tied at the top
TransMIL ā failstopredict ā Downstream Quality
confidence 90% Ā· TransMIL collapses to 0.656... it is the only head whose probeādownstream correlation inverts.
Scale-Sanity ā ensures ā Class Balance
confidence 85% Ā· We apply each proposed clinical threshold to the ground truth and inspect the class balance, and reject any threshold that produces a near-degenerate split
Cypher Suggestions (0)
No Cypher suggestions yet.
Abstract
Abstract:Picking the frozen image encoder for a 3D~CT vision--language model (VLM), together with the token-compression scheme on top of it, is a search over many candidates. There are several encoders, several ways to compress their tokens, and several token budgets, and the combinations grow fast. Comparing them the usual way means fine-tuning a large language model (LLM) on each combination, and running the whole sweep this way needs far more compute than most groups can spend. We ask whether a cheap probe on the encoder's cached embeddings can stand in for that comparison. We build an image-grounded probing benchmark over (encoder $\times$ compression) cells, with clinical attribute families and two validation gates, scale-sanity and probe-separability, that keep each attribute well-scaled and decodable. These gates are the main methodological contribution. On this benchmark we compare a range of read-out heads, and in a preliminary study we pair each probe with its matched downstream task. The early signal is encouraging: the cheap probe orders the candidates in close agreement with expensive fine-tuning, at about $r\approx0.95$ on the cells measured so far. We read this as an ordinal claim, a ranking predictor rather than an exact estimate, and we are explicit about where it stays preliminary. If it holds up, encoder and compression choices can be screened in minutes with frozen-token probes, with full training spent only on the finalists.
Tags
Links
- Source: https://arxiv.org/abs/2607.22771v1
- Canonical: https://arxiv.org/abs/2607.22771v1
Trouble viewing inline? Open PDF directly ā
Full Text
26,286 characters extracted from source content.
Expand or collapse full text
Cheap Probes Predict Expensive Training in 3D-CT VisionāLanguage Models Renjie Liang University of Florida, Gainesville, FL, USA Abstract Picking the frozen image encoder for a 3D CT visionālanguage model (VLM), together with the token-compression scheme on top of it, is a search over many candidates. There are several encoders, several ways to compress their tokens, and several token budgets, and the combinations grow fast. Comparing them the usual way means fine-tuning a large language model (LLM) on each combination, and running the whole sweep this way needs far more compute than most groups can spend. We ask whether a cheap probe on the encoderās cached embeddings can stand in for that comparison. We build an image-grounded probing benchmark over (encoder Ć compression) cells, with clinical attribute families and two validation gates, scale-sanity and probe-separability, that keep each attribute well-scaled and decodable. These gates are the main methodological contribution. On this benchmark we compare a range of read-out heads, and in a preliminary study we pair each probe with its matched downstream task. The early signal is encouraging: the cheap probe orders the candidates in close agreement with expensive fine-tuning, at about rā0.95rā 0.95 on the cells measured so far. We read this as an ordinal claim, a ranking predictor rather than an exact estimate, and we are explicit about where it stays preliminary. If it holds up, encoder and compression choices can be screened in minutes with frozen-token probes, with full training spent only on the finalists. 1 Introduction Modern 3D CT visionālanguage models follow a standard recipe. A frozen 3D image encoder turns a volume into a grid of visual tokens, an optional compression module shortens that grid, a projector maps the tokens into an LLMās embedding space, and the LLM is fine-tuned to generate reports or answer questions. Two early choices dominate final quality: which encoder, and which compression. Both are usually settled by brute force, fine-tuning the LLM on every candidate and comparing downstream metrics, at days of GPU time per configuration. A probe is a lightweight read-out, a closed-form ridge regressor or a small attention head, trained on the frozen embeddings to predict a clinical attribute. It costs orders of magnitude less than fine-tuning an 8B-parameter LLM. If probe quality tracked downstream quality, one could screen encoders and compression schemes with probes and pay for full training only on the survivors. This paper makes that claim concrete and gives preliminary evidence for it, in three parts: 1. How the benchmark is built (Section 3): a grid of (encoder Ć compression) cells, 15 image-grounded regression attributes plus 18 disease findings, two question types, two validation gates (scale-sanity and probe-separability), explicit input normalization, and a six-dimension probe-audit rubric. 2. Many probing models (Section 4): ten read-out heads compared on the same frozen tokens. Most heads are strong; one over-parameterized head is pathological. 3. Cheap predicts expensive (Section 5): under this probing setup, disease-probe AUROC predicts report-generation clinical micro-F1 at r=0.95r=0.95 / Ļ=0.89Ļ=0.89 over six matched cells, robustly across read-out choice. The claim is ordinal, and we disclose where within-encoder rankings disagree. This is a stake-a-claim marker: concise, honest, preliminary. We want to show that frozen-token probing is a usable stand-in for 3D-CT encoder and compression selection, and to give the community a read-out comparison and an audit rubric that keep such claims falsifiable. 2 Related Work 3D CT visionālanguage models. CT-CLIP and CT-CHAT [9, 7] pair a contrastive 3D encoder with an LLM for report generation; CT-Agent [12] adds anatomy-aware retrieval; BTB3D [10] replaces contrastive tokens with a reconstruction-based tokenizer. These systems differ chiefly in their encoder and in how its many tokens are compressed before the LLM, yet the choice is validated only by expensive end-to-end training. We ask whether it can instead be predicted by probing. Probing frozen representations. Linear and attention probes are a standard tool for asking what a representation encodes [1, 4], with control tasks and selectivity introduced to guard against the probe doing the work [16]. Most studies stop at āthe information is present.ā We push further to ask whether probe scores are predictive of downstream quality, and make that question falsifiable with an audit rubric, negative controls, and noise floors. Cheap proxies for model selection. Transferability-estimation scores (LEEP [17], LogME [21], H-score [3], NCE [18]) rank pre-trained models from frozen features, but target single-number classification transfer. Our proxy is domain-specific: a predictor for 3D CT encoder and compression selection whose predictand is free-text report generation. The closest medical probing benchmark [2] is 2D chest X-ray, and studies neither 3D CT, token compression, nor the link from probe to generative downstream quality. 3D CT VQA. Report-derived CT VQA (e.g. M3D-VQA [5]) has an LLM generate questions and answers from diagnostic reports. Our VQA gold answers come straight from the image (masks and Hounsfield units), carry no report or LLM noise, and are exactly reproducible, so the probe target and the VQA target share one identical label. We use it as an image-grounded probe target [15], not a standalone leaderboard. It speaks to the fieldās gap of scoring where and how much, not only what [11]. 3 Part 1: Benchmark construction The benchmark probes what a token compressor preserves. It has four parts: a grid of (encoder Ć compression) cells, a set of image-grounded clinical attributes organized into families, two question types per attribute, and its methodology contribution, two validation gates that every attribute must pass before it becomes a question. The frozen tokens of each cell also feed the expensive path (projector ++ LLM fine-tune, ā¼1 1 GPU-day/cell), against which predictive validity is later measured. Cells are built on CT-RATE non-contrast chest CT [9]. Cells: encoder Ć compression. A cell is one (encoder, compression) configuration; the encoder is frozen throughout. Grid encoders produce a dense token grid: CoLiPri [14] and CT-CLIP [8] are contrastive (768768- and 512512-dim tokens); BTB3D [10] is a reconstruction tokenizer with low-dimensional (1818-d) codebook tokens. Organ encoders (VISD-Boost [6], fVLM [13]) emit a handful of organ-level tokens. On top of each grid encoder we apply one of three compressions: none (native tokens), uniform_pool (average-pool to a fixed budget of 216216 tokens, preserving per-token dimension), and adp (a learned pack-then-linear bottleneck). The pool column fixes the token budget across grid encoders so within-column comparisons isolate the encoder from token count. Attribute families: 15 regression attributes ++ 18 disease findings. Every attribute is image-grounded. It is measured straight from the CT image (segmentation masks or Hounsfield units), never from a report, so labels carry no report or LLM noise and are exactly reproducible. Fifteen continuous attributes span four families: size (5: cardiothoracic ratio, aorta-to-heart and IVC-to-aorta ratios, aortic diameter in m, heart width in m); density (4: aortic-wall calcification, vertebral bone density, mean lung density, lung high-attenuation fraction); radiomics (3: lung and vertebral first-order kurtosis, emphysema index lung_Perc15); and location (3: leftāright lung log-ratio, cardiac lateral position, IVC axial level). A fifth family is the 18 CT-RATE disease findings (prevalence 88ā45%45\%), extracted with RadBERT [20]. Segmentation-derived attributes use TotalSegmentator masks [19]; density and radiomics use per-organ HU statistics, which stay stable on non-contrast CT-RATE. Two question types. Each regression attribute is emitted in two forms as metadata, and the final per-attribute form is chosen by clinical meaning and budget. Catalog is a letter-MCQ. It is either a 3-class tertile bucketing (cut-points fixed on the train split, so there is no validation leakage, and saved to tertile_cutpoints.json, chance =0.333=0.333), or, for the three attributes that pass the scale gate below, a clinical-threshold split (chance =0.5=0.5). Option order is randomized per record (seeded by question id) to defeat positional shortcuts. Value is open numeric generation (āanswer with a number onlyā), emitted only for interpretable units (m, HU, or a unitless number) and scored by MAE and within-tolerance accuracy. Disease findings are presence Yes/No questions. The two validation gates (methodology contribution). An image-grounded attribute is useful only if its labels are well-scaled and its buckets are decodable. Two gates enforce both before any question ships, and they are the core of the construction methodology. Gate 1: scale sanity (anti-degenerate). We apply each proposed clinical threshold to the ground truth and inspect the class balance, and reject any threshold that produces a near-degenerate split (say, 99%-one-class). Only 3 of the candidate clinical catalogs survive: aortic dilation (aorta_diameter_m, real <40<40 m), emphysema (lung_Perc15, real <ā950<-950 HU), and aortic calcification (hu_aorta_calc, zero-inflated, so present/absent). Osteoporosis (vert_median) and cardiomegaly (sz_heart_lung) fail: their ground truth is a whole-vertebra median or a log-ratio, not calibrated to the clinical units, so they fall back to data-driven tertiles rather than ship an ill-scaled question. Gate 2: probe-separability. A strong CoLiPri linear probe must separate each attributeās tertile buckets above chance (0.3330.333). If a strong probe cannot separate an attribute at that granularity, the attribute is ill-posed, and we drop or coarsen it. Figure 1 shows the result. 13 of 15 attributes are well-posed (separability 0.580.58ā0.870.87). The two location targets lung_LR_logratio and heart_x are marginal (ā0.45ā 0.45); we flag them and keep them as honest āspatial-position canaries,ā the axis a merge-based compressor is expected to preserve least, rather than quietly drop them. Figure 1: Separability gate. Tertile 3-class separability of a strong CoLiPri linear probe on each of the 15 regression attributes (avgpack tokens). Thirteen attributes clear the well-posed line; the two marginal location targets (orange) sit near chance and are kept, flagged, as spatial-position canaries. A bucketing a strong probe cannot separate is dropped or coarsened. Downstream pairing. Each family is paired with the same capability of a downstream task trained with the full LLM (two-stage: projector warm-up, then LoRA). Disease ā report generation, scored by clinical micro-F1 (RadBERT-extracted findings, generated vs. reference). Regression attributes ā VQA, where probe and VQA share the identical image-derived tertile/threshold label, so the two scores are directly comparable. Predictive validity is then the cross-cell rank correlation between the cheap probe score and the expensive downstream score, computed one capability at a time. Input normalization. Encoders differ by an order of magnitude in embedding scale (per-channel std ā0.04ā 0.04 for CT-CLIP vs. ā0.94ā 0.94 for BTB3D). A light read-out with weight decay then quietly penalizes low-variance encoders unless the input is normalized to the encoderās scale. We treat normalization as an explicit variable: ZCA-whitening (fit once on training features) for the low-dimensional variants, and per-token LayerNorm for the high-dimensional learned-projector variant, with raw features as an ablation. Normalization sharpens the cross-encoder ranking rather than distorting it. On CT-CLIP a mean read-out decodes 0.600.60 AUROC raw and 0.720.72 under ZCA, which cleanly separates it from BTB3D. Probe-audit rubric. A predictive-validity claim is only as trustworthy as the probes behind it, so we audit every probe along six dimensions [16, 1]: (1) label validity (trustworthy, leakage-free target); (2) input validity (same volumes and preprocessing across cells); (3) read-out strength (a studied variable, since a head that is too strong measures the information ceiling, not what the LLM can use); (4) metric & null (appropriate metric, explicit chance level, negative controls); (5) construct validity (does the probeās capability match the paired downstream metric); (6) robustness (sensitivity to read-out, compression, seeds). The two gates above fill in the label-validity and construct-validity dimensions, and the rubric doubles as a reusable protocol for probing studies. Appendix A shows representative label-validation visualizations from the construction pipeline. From construction to validation. Parts 4 and 5 are a preliminary validation of this probing methodology. Their correlations were computed on an earlier label revision of the same probing pipeline, not on the exact gated 15-attribute / 18-finding benchmark above. We therefore read them as evidence for the methodology, that cheap frozen-token probes predict expensive fine-tuning under this setup, not as measurements on the rigorous benchmark itself. 4 Part 2: Comparing ten read-out heads Figure 2: Ten read-out heads on identical frozen tokens. Mean disease-probe AUROC per head, averaged over the six grid cells (btb3d/colipri/ct_clip Ć adp/pool) for which every head is instantiated. Heads form a broad strong plateau (0.720.72ā0.750.75); only the over-parameterized TransMIL collapses toward chance and, as Section 5 shows, inverts the probeā correlation. A probeās read-out head is a design choice, not a given, so we compare ten heads on the same cached embeddings: attention pooling (ABMIL, ABMIL-multi), simple pools (mean-linear, top-k-linear at two k), flatten variants (flatten-linear, top-k-flatten), a global-local head (GLocal), and TransMIL. Figure 2 ranks them by mean disease-probe AUROC over the six grid cells where all heads are present. Two findings stand out. First, read-out choice matters little among sensible heads. Nine of the ten heads sit in a narrow 0.720.72ā0.750.75 band, with attention pooling (ABMIL-multi 0.7490.749) and a plain mean-linear pool (0.7380.738) roughly tied at the top, so almost any competent head recovers the encoder-side information. Second, one head is pathological. TransMIL collapses to 0.6560.656, and (Section 5) it is the only head whose probeā correlation inverts. That is itself diagnostic. An over-parameterized read-out measures the representationās information ceiling rather than the usable information the LLM can exploit, the exact failure the rubricās āread-out strengthā dimension warns about. In practice, then, screen with a strong but modest head, attention pooling or a mean/top-k linear pool, and distrust any head whose in-sample strength does not carry over into predictive validity. 5 Part 3: Cheap probes predict expensive training Figure 3: The money figure. Cheap disease-probe AUROC (ABMIL, frozen tokens, minutes) vs. report-generation clinical micro-F1 after full LLM training (ā¼1 1 GPU-day), over the six matched cells. Pearson r=0.95r=0.95, Spearman Ļ=0.89Ļ=0.89. Marker color is the encoder; text labels give the compression. The central result. We pair the disease probe (ABMIL AUROC) with report-generation clinical micro-F1 over six matched cells (CoLiPri / CT-CLIP / BTB3D under adp, pool, or none). Figure 3 plots the two. The relationship is strong and monotone, at Pearson r=0.95r=0.95, Spearman Ļ=0.89Ļ=0.89. A minute-long probe on cached embeddings orders the cells almost exactly as a GPU-day-per-cell report-generation training run would, and it even tracks the magnitude of the downstream metric. Used as a selection rule, the top-probe cell recovers essentially the best encoder at two-to-three orders of magnitude less compute. Probes train in seconds to minutes; fine-tuning one cell costs about a GPU-day. An ordinal claim. Predictive validity here is ordinal. The probeās job is to predict the downstream ranking of cells, not to reproduce the F1 scale. Spearman Ļ=0.89Ļ=0.89 is the number that matters: a practitioner who trains only the probe-preferred cells will, with high probability, be training the cells that full fine-tuning would also prefer. Robust to read-out choice. The correlation does not depend on ABMIL. Table 1 reports the same probeā correlation under each read-out. Every strong head agrees (Ļ=0.66Ļ=0.66ā0.890.89, r=0.91r=0.91ā0.950.95), and only the pathological TransMIL inverts (Ļ=ā0.30Ļ=-0.30), the same head that collapsed in Figure 2. So predictive validity is a property of the frozen tokens, recovered by any competent head, and not a lucky read-out. Table 1: Predictive validity is not an artifact of one read-out. Cross-cell correlation between disease-probe AUROC and report-generation clinical micro-F1 (six matched cells), under each read-out head. Every strong head agrees; only the over-parameterized TransMIL inverts. Read-out Ļ r Read-out Ļ r ABMIL 0.89 0.95 top-k-flatten-k128 0.77 0.93 mean-linear 0.89 0.95 top-k-flatten 0.77 0.91 top-k-linear-k128 0.89 0.95 flatten-linear 0.66 0.94 top-k-linear 0.89 0.94 GLocal 0.60 0.74 ABMIL-multi 0.77 0.94 TransMIL ā0.30-0.30 ā0.03-0.03 Where the ranking mismatches (honest disclosure). Ordinal prediction is near-perfect across encoders but imperfect within an encoderās compression variants, and we disclose it. For the strong heads, the within-encoder ranking of compression variants matches downstream for CT-CLIP and BTB3D (adp >> pool/none in both probe and F1) but flips for CoLiPri, where the probe ranks pool >> adp while report-gen ranks adp >> pool. This is a tie, not a real inversion. The two CoLiPri variants are statistically indistinguishable in both probe AUROC (0.8530.853 vs. 0.8460.846) and F1 (0.4890.489 vs. 0.5010.501), so the cross-encoder signal, the one you would act on, is unaffected. The probe reliably picks the right encoder, but you should not trust it to break near-ties between an encoderās own near-duplicate compression variants. Negative control. Probing for shuffled disease labels collapses to chance (AUROC 0.510.51), which confirms the real signal is not a read-out artifact. With the read-out-robustness check and the ordinal framing, the predictive-validity claim survives the obvious attempts to break it. 6 Conclusion We staked out a probing methodology for 3D-CT encoder and compression selection and gave preliminary evidence for its central promise. We built an image-grounded benchmark over (encoder Ć compression) cells, compared ten read-out heads on identical frozen tokens, and paired each probe with the matched downstream task. Two things came out of it: (i) read-out choice matters little among sensible heads, though one over-parameterized head is pathological, and (i) the cheap disease-probe AUROC predicts report-generation clinical micro-F1 at Pearson r=0.95r=0.95, Spearman Ļ=0.89Ļ=0.89, robustly across read-outs. Read ordinally, with the probe ranking predicting the downstream ranking, this says encoder and compression choices can be screened with minute-long frozen-token probes instead of a full fine-tuning sweep, and full training paid only for the survivors. Limitations and ongoing work. This is a preliminary marker. The correlation rests on six matched cells from a single dataset (CT-RATE, single-institution, non-contrast chest CT, model-extracted labels), and it was computed on an earlier label revision of this pipeline, not on the exact 15-attribute / 18-finding gated benchmark of Section 3, so we state it at the methodology level. Within-encoder near-ties are not reliably ordered, and the per-family regression-attribute pairing against the image-grounded VQA is not yet reported here. We are re-running the correlation on the gated benchmark, enlarging the cell grid, adding n=3n=3 seed error bars, replicating across a second LLM backbone, and validating the cut-points with clinician review. External validity to other sites, contrast protocols, and body regions is still to be shown. References [1] G. Alain and Y. Bengio (2017) Understanding intermediate layers using linear classifier probes. In ICLR Workshop, Cited by: §2, §3. [2] Anonymous (2025) Feature quality and adaptability of medical foundation models: a comparative evaluation for radiographic classification and segmentation. arXiv preprint arXiv:2511.09742. Note: 2D chest X-ray; linear probing of 8 foundation encoders External Links: 2511.09742 Cited by: §2. [3] Y. Bao, Y. Li, S. Huang, L. Zhang, L. Zheng, A. Zamir, and L. Guibas (2019) An information-theoretic approach to transferability in task transfer learning. In IEEE International Conference on Image Processing (ICIP), Cited by: §2. [4] Y. Belinkov (2022) Probing classifiers: promises, shortcomings, and advances. Computational Linguistics 48 (1), p. 207ā219. Cited by: §2. [5] B. et al. (2024) M3D: advancing 3d medical image analysis with multi-modal llms. arXiv preprint arXiv:2404.00578. Note: -; generalist 3D MLLM; spatial pooling perceiver; M3D-Data/Bench External Links: 2404.00578 Cited by: §2. [6] C. et al. (2025) Boosting vision semantic density with anatomy normality modeling. arXiv preprint arXiv:2508.03742. Note: -; anatomy normality modeling for RG External Links: 2508.03742 Cited by: §3. [7] H. et al. (2024) A foundation model utilizing chest ct volumes and radiology reports. arXiv preprint arXiv:2403.17834. Note: -; CT-CLIP encoder + LLaMA chat; RG + VQA External Links: 2403.17834 Cited by: §2. [8] H. et al. (2024) CT-clip: contrastive language-image pretraining for 3d chest ct. arXiv preprint arXiv:2403.17834. Note: -; contrastive 3D CT-text; released CT-RATE; our encoder External Links: 2403.17834 Cited by: §3. [9] H. et al. (2024) CT-rate (chest ct + reports). arXiv preprint arXiv:2403.17834. Note: -; first large paired 3D CT-report (25692 studies) External Links: 2403.17834 Cited by: §2, §3. [10] H. et al. (2025) Better tokens for better 3d: advancing vl modeling in 3d medical imaging. arXiv preprint arXiv:2510.20639. Note: NeurIPS; learned freq-aware 3D tokenizer; +40% clinical F1; our base lineage External Links: 2510.20639 Cited by: §2, §3. [11] K. et al. (2025) MedRegion-ct: region-focused multimodal llm for 3d ct rg. arXiv preprint arXiv:2506.23102. Note: MICCAI; R2 token pooling + mask-driven extractor + patient attributes External Links: 2506.23102 Cited by: §2. [12] M. et al. (2025) CT-agent: a multimodal-llm agent for 3d ct (qa + report gen). arXiv preprint arXiv:2505.16229. Note: -; agentic planning + memory retrieval; QA+RG; region-LoRA(verify) External Links: 2505.16229 Cited by: §2. [13] S. et al. (2025) Large-scale and fine-grained vision-language pre-training for enhanced ct. arXiv preprint arXiv:2501.14548. Note: -; anatomy-level alignment; 69086 patients; our encoder External Links: 2501.14548 Cited by: §3. [14] W. et al. (2025) Comprehensive language-image pre-training for 3d medical image. arXiv preprint arXiv:2510.15042. Note: -; comprehensive LI pretraining; our encoder (3 variants) External Links: 2510.15042 Cited by: §3. [15] Z. et al. (2024) RadGenome-chest ct: a grounded vision-language dataset. arXiv preprint arXiv:2404.16754. Note: Sci Data; region-grounded reports + masks (665K) on CT-RATE External Links: 2404.16754 Cited by: §2. [16] J. Hewitt and P. Liang (2019) Designing and interpreting probes with control tasks. In EMNLP, Cited by: §2, §3. [17] C. V. Nguyen, T. Hassner, M. Seeger, and C. Archambeau (2020) LEEP: a new measure to evaluate transferability of learned representations. In International Conference on Machine Learning (ICML), Cited by: §2. [18] A. T. Tran, C. V. Nguyen, and T. Hassner (2019) Transferability and hardness of supervised classification tasks. In IEEE/CVF International Conference on Computer Vision (ICCV), Cited by: §2. [19] J. Wasserthal, H. Breit, M. T. Meyer, et al. (2023) TotalSegmentator: robust segmentation of 104 anatomical structures in CT images. Radiology: Artificial Intelligence 5 (5). Cited by: §3. [20] A. Yan, J. McAuley, X. Lu, J. Du, E. Y. Chang, A. Gentili, and C. Hsu (2022) RadBERT: adapting transformer-based language models to radiology. In Radiology: Artificial Intelligence, Vol. 4. Cited by: §3. [21] K. You, Y. Liu, J. Wang, and M. Long (2021) LogME: practical assessment of pre-trained models for transfer learning. In International Conference on Machine Learning (ICML), Cited by: §2. Appendix A Benchmark construction and label validation (gallery) The image-grounded labels are validated at construction time, before any probe or question is generated. Figures 5ā7 show representative checks from the shared label-construction pipeline: per-record measurement overlays, target quality-control, the scale-sanity guard distributions, and the confound audit. They illustrate the validation methodology. Some panels include organs beyond the chest attribute list, since the same pipeline runs across body regions. Each figure states what it validates. Figure 4: Measurement overlay for the aorta_diameter_m size attribute: the measured axial slice (left) and the whole-aorta segmentation (right) confirm the diameter is read from the correct structure. Figure 5: Quality-control for the vert_median bone-density attribute: the target vertebrae (red) against neighbours (yellow), with the per-case median HU, confirm the correct level is measured. Figure 6: Scale-sanity gate (Gate 1): per-attribute measurement distributions with the guard cut (red). A cut must sit between a failure spike and the real distribution, so no threshold carves a degenerate, near-one-class split. Figure 7: Confound audit: each candidate HU target is regressed against nuisance factors so confounded targets are disclosed or dropped. Left, an absolute-HU target that is largely a contrast effect; middle, a clean target; right, a target driven by real biology (age). This fills in the rubricās confound-control dimension.