SCIT: Testing Causal Cache Carriers in Latent Chain-of-Thought Models
Organizations: The Hong Kong University of Science and Technology (Guangzhou) Guangzhou, China
Abstract
Latent chain-of-thought models move intermediate reasoning from emitted text into continuous states, improving compactness but hiding the causal object. We introduce SCIT, the Suffix Cache Interchange Test, a causal protocol that constructs exact source-recipient counterfactuals, patches declared cache segments, and identifies which transformer object carries the counterfactual computation. SCIT combines sufficiency tests with K/V component splits, hidden-state controls, semantic source controls, decoded validation, and matched corruption. On CODI-GPT2 and a Sim-CoT-style GPT-2 reproduction, counterfactual arithmetic transfers primarily through value-cache suffix trajectories rather than hidden states, keys, reusable answer slots, or single-token triggers. Complete sufficiency-and-necessity evidence for the late-value-suffix mechanism holds for the main CODI-GPT2 checkpoint; the Sim-CoT-style checkpoint shows the same sufficiency and decoded-control pattern but insufficient matched-corruption evidence for a necessity call. Beyond these local arithmetic cells, SCIT reveals carrier-regime shifts: arithmetic-like GPT-2/1B cells preserve latent-tail value/KV transfer, whereas competent 8B and repaired non-arithmetic cells route through prompt-prefix or full-cache K/V; boundary cells receive no mechanism call. SCIT therefore contributes a cache-level diagnostic, a checkpoint-specific GPT-2 arithmetic mechanism, and a competence-gated carrier map rather than a universal latent-tail claim.
Figures & tables
| Claim | Verdict | Key evidence and risk closed | Where |
|---|---|---|---|
| Local arithmetic carrier | LATENT-TAIL | GPT-2 arithmetic passes competence; value suffixes transfer (all/late V – , layer 8–9 V – ), while key/ and semantic controls are weak. CODI corruption closes necessity (TW ); Sim-CoT is sufficiency-only/directional. | Tables 19 , 20 , 21 , 54 |
| Arithmetic scale check | LATENT-TAIL | 1B arithmetic-like cells preserve the active latent carrier (active vs inactive ; corruption active TW vs inactive ). The same arithmetic-style diagnostic shifts at 8B. | Fig. 3 ; App. Tables 14 , 44 |
| 8B field-routed cells | PREFIX SHIFT | Competent 8B arithmetic/entity/relation/expression cells route through prompt-prefix/full K/V: direct-pre sufficiency is already – , latent , active-corruption dLP – . In arithmetic/expression/list/relation follow-ups, post-prefix zero and field ablations collapse readout from visible fields while latent-suffix ablation does not. | Fig. 3 ; Table 2 ; App. Tables 9 , 10 , 11 , 15 , 27 |
| Boundary discipline | NO CALL | Qwen3-4B stays near chance ( – ); graph/finite-state/OOD/support-limited cells fail competence, support, or decoded-readout gates. No carrier is interpreted below gate. | Tables 14 , 27 , 31 |
| Training-path sensitivity | PATH-SENSITIVE | T16 and new CODI seed audits pass clean gates but enter different basins; new CODI seeds show only – late-8–9 value sufficiency and – corruption drops. | Tables 42 , 43 |
| Metric robustness | AUDITED | Competence sweep is stable; 16 carrier-threshold settings and 12/12 large- calls are unchanged; exact/near ties are rare ( ). | Table 16 |
| 8B cell | Lat. | Pref. | Best visible field(s) |
|---|---|---|---|
| 2-hop arithmetic | .00 | 1.00 | facts / initial clause: 1.00 |
| Entity lookup | .00 | 1.00 | lookup entry / facts: 1.00 |
| Relation chain | .00 | 1.00 | query: 1.00; tables: .00 |
| Expression tree | .00 | .99 | facts: .98; bindings: .63 |
| List filter/sum | .00 | 1.00 | rules/facts: 1.00; threshold: .44 |
Appendix figures & tables58 assets
Supplementary material from the paper’s appendix.
Appendix
| Appendix block | Tables / figures | Purpose |
|---|---|---|
| Method/setup | Main-text Figure 1 ; Appendix Figure 4 ; Tables 4 – 7 | Defines the intervention grid, prompt templates, scoring/battery, and sample sizes moved out of the main text. |
| Carrier-regime audit | Tables 8 – 18 | Gives the carrier-status index, 8B time scan, no-latent truncation and post-prefix readout probes, no-call rows, concern-to-evidence map, ledger, field routing, threshold/tie audit, and method-positioning map. |
| Core arithmetic | Tables 19 – 21 ; Figure 5 | Supplies the GPT-2 localization, semantic-source controls, matched corruption, and candidate-set stress check behind the local mechanism claim. |
| Scope/boundaries | Tables 22 – 31 | Separates task-breadth calibration, repaired cells, support boundaries, and base-model sanity checks. |
| Trajectory/auxiliary checks | Tables 32 – 43 | Collects trajectory-length, head, geometry, noise, gradient, ablation, horizon, and seed/path diagnostics. |
| Carrier-scale/component details | Tables 44 – 58 | Expands segment splits, GPT-2 block scans, OOD/1B checks, vector/cache controls, cross-template controls, decoded validation, and Sim-CoT corruption. |
| Name | Cache segment | Component operation | Current state | Interpretation |
|---|---|---|---|---|
| Hidden-only | Recipient cache unchanged | No K/V replacement | Replace with | Tests whether the current hidden vector alone carries the counterfactual. |
| Cache-only | Selected segment from source | Replace K and V jointly unless restricted below | Keep | Tests whether the cache trajectory is sufficient without copying the source hidden state. |
| Cache+h | Selected segment from source | Replace K and V jointly unless restricted below | Replace with | Strong closed-loop interchange; interpreted only with hidden-only and cache-only controls. |
| Key-only | Selected segment from source | Replace K; keep recipient V | As specified by cache-only/cache+h | Surgical routing test; an artificial state used to test key-only sufficiency. |
| Value-only | Selected segment from source | Replace V; keep recipient K | As specified by cache-only/cache+h | Surgical content test; success means source value content is usable under recipient keys. |
| Full-cache | Prompt prefix plus latent tail | Replace all available K/V cache entries | As specified by cache-only/cache+h | Upper-bound interchange check and comparison point for segment-local claims. |
| Family | Prompt template |
|---|---|
| balls | Question: Alice has {A} red balls and {B} blue balls. She gives away {C} red balls. How many balls does she have now? Answer: |
| books | Question: Alice has {A} science books and {B} history books. She lends out {C} science books. How many books does she have now? Answer: |
| coins | Question: Alice has {A} silver coins and {B} gold coins. She gives away {C} silver coins. How many coins does she have now? Answer: |
| Family | Cells | Intervention/readout | Evidence role |
|---|---|---|---|
| Core localization | CODI-GPT2 and Sim-CoT-GPT2 on balls/books/coins | Latent-tail cache+h over layer groups; cache-only, hidden-only, key-only, value-only splits | Identifies the arithmetic carrier as a value-cache trajectory rather than the current hidden vector or key routing. |
| Semantic controls | Exact, same-answer, partial-variable, cross-template, random, greedy, sampled, enlarged-candidate checks | Same patched state scored by target win, margin, and parsed free generation | Tests whether transfer is full-context counterfactual behavior rather than answer-slot reuse or a closed-set artifact. |
| Necessity | Matched random corruption plus zero/mean ablations | Recipient-answer preservation and log-probability drop after damaging the same region | Separates sufficiency from requirement and checks whether the localized region is globally fragile. |
| Carrier-regime calibration | 1B/8B arithmetic, three-hop, entity, relation, expression/list, state, graph, rule cells | Latent tail, prompt prefix, whole cache, component, decoding, support, and OOD gates | Maps whether the carrier persists, shifts, or becomes uninterpretable; these cells are not treated as broad benchmark wins. |
| 8B hardening | Field-level 8B arithmetic, entity, relation, expression/list probes with source controls | Field K/V patches over lookup, query, fact, rule, operand, threshold spans | Decomposes prefix or full-cache positives into visible-field carrier evidence rather than leaving 8B as an opaque stress test. |
| Reporting audits | Threshold sweeps, tie audit, head controls, seed/path probes | Fixed decision grid, tie counts, ranked versus random head patches, checkpoint scans | Checks that carrier calls do not depend on arbitrary thresholds, tie order, or a single training path. |
| Diagnostic | Main cells | / seeds | Randomization and readout |
|---|---|---|---|
| GPT-2 localization | CODI-GPT2 and Sim-CoT-GPT2, balls/books/coins | CODI balls: 240 examples per cell; other rows: two 60-example seeds | Held-out source–recipient pairs; target win over recipient, donor, oracle, and random labels; steps 5/6 reported. |
| Semantic controls | Same models/templates | Same as localization | Same-answer, same-intermediate, partial-variable, cross-template, and random sources; fifth label added when needed. |
| Matched corruption | CODI-GPT2 main; Sim-CoT-GPT2 replication | 360 examples aggregated over balls/books/coins per table | Same-template and same-range random cache sources; recipient-answer preservation and log-probability drop. |
| Decoded validation | Greedy and sampled free generation | Greedy: 60 examples per template; sampling: five samples per example | Parsed free-generation answer compared with counterfactual, recipient, and out-of-set labels. |
| Carrier-regime calibration | 1B/8B arithmetic, entity, relation, expression/list, state cells | Usually held-out pairs per carrier-map task; field rows caption exact | Competence-gated latent-tail, prompt-prefix, and whole-cache segment splits with source controls where available. |
| Call type | Cells | Interpretation |
|---|---|---|
| Latent-tail positive | GPT-2 arithmetic; clean three-hop; 1B arithmetic-like | Arithmetic carrier persists, but layer locus need not be scale-invariant. |
| Carrier shift | 8B arithmetic, entity, relation; repaired expression/list; repaired relation-chain; state controls | Competent cells route through prompt-prefix or full-cache K/V; no-latent and post-prefix ablations show the prompt-prefix state is sufficient before rollout and visible fields remain readout-active afterward. |
| No-call boundary | Qwen3-4B, graph path, finite-state, ultra-OOD expression, list controls, fixed-rule holdouts | Competence, support, or source-control gates block mechanism interpretation. |
| Reporting audit | Threshold sweep, tie audit, head Pareto, seed/path probes | Checks that calls are not artifacts of cutoffs, tie order, or one training path. |
| 8B follow-up cell | Latent-tail TW | Prompt-prefix TW | Prompt | Top-8 attn. Lat./Pref. | Interpretation | |
|---|---|---|---|---|---|---|
| Two-hop arithmetic | 48 | 0.000–0.000 | 1.000–1.000 | 26.2–26.2 | .013 / .960 | Prefix from step 1. |
| Entity lookup | 48 | 0.000–0.000 | 1.000–1.000 | 31.8–31.8 | .001 / .876 | Prefix lookup binding. |
| Expression tree | 48 | 0.000–0.000 | 1.000–1.000 | 35.6–35.6 | .004 / .987 | Prefix operand/fact binding. |
| Relation chain | 48 | 0.000–0.000 | 1.000–1.000 | 41.9–41.9 | .031 / .962 | Prefix query binding. |
| 8B truncation cell | Direct pre-recipient TW | Direct pre-oracle TW | Latent-tail TW | Full-cache TW | Interpretation | |
|---|---|---|---|---|---|---|
| Two-hop arithmetic | 32 | 1.000 | 1.000 | 0.000 | 1.000 | Prefix state is sufficient before rollout. |
| Expression tree | 32 | 1.000 | 0.969 | 0.000 | 0.969 | One oracle miss; same qualitative prefix regime. |
| List filter/sum | 32 | 1.000 | 1.000 | 0.000 | 1.000 | Prefix state dominates latent tail. |
| Relation chain | 32 | 1.000 | 1.000 | 0.000 | 1.000 | Query/source binding is pre-rollout sufficient. |
| 8B readout cell | Latent-suffix zero TW | Prompt-prefix zero TW | Best field zero TW | Unaffected field | Interpretation | |
|---|---|---|---|---|---|---|
| Two-hop arithmetic | 24/12 | 1.000 | .417 / .417 | initial/facts: .417–.500 | query: 1.000 | Numeric facts remain required at readout. |
| Expression tree | 24/12 | 1.000 | .458 / .458 | rules: .250; inputs: .417 | query: 1.000 | Rules and bindings, not latent suffix, support answer readout. |
| List filter/sum | 24/12 | 1.000 | .125 / .125 | values: .583; facts: .750 | query/rules: .917–1.000 | Value bindings dominate the visible-field dependency. |
| Relation chain | 24/12 | 1.000 | .250 / .250 | room/query: .167–.250 | person table: 1.000 | Readout depends on the queried relation fields. |
| Boundary cell | Gate failure | Interpretation |
|---|---|---|
| Qwen3-4B probes | Closed-set competence near chance | No interpolation claim between 1B and 8B. |
| Graph path | Weak decoded competence | Path-following training support is insufficient. |
| Broader finite-state | Short/long sequence gates fail | State tracking does not generalize from narrow supports. |
| Expression ultra-OOD | Free-generation and source-control gates fail | Repaired carrier is support-limited. |
| List hard cells | Source controls remain high | Prompt-prefix copying cannot be separated cleanly. |
| Fixed-rule holdouts | Leave-one/class holdouts fail | Matched-support fitting, not robust rule execution. |
| Weakness | Where to look | What the evidence supports |
|---|---|---|
| The main task is too narrow | Tables 22 , 23 , 25 , 27 | The paper is a causal diagnostic, not a broad reasoning benchmark; added cells test depth, branching, list aggregation, relation binding, and state tracking under competence gates. |
| Scale generalization is unresolved | Tables 47 , 44 , 15 , 9 , 10 , 11 , 27 | 1B arithmetic-like cells preserve value/KV transfer, but 8B and repaired task cells shift to prompt-prefix/full-cache carriers that appear already before latent rollout and remain sensitive to visible fields at readout. |
| Carrier calls depend on competence gates, thresholds, or tie order | Table 16 | The large- 1B/8B carrier split is unchanged under competence gates and stricter sufficiency/competitor thresholds; exact target-score ties are rare in the cache-interchange state-score rows. |
| The late-layer split could be arbitrary | Tables 45 , 25 | GPT-2 has a stable middle-to-late restricted block, but architecture-relative localization shifts at 1B. |
| Closed candidate sets inflate random baselines | Figure 5 ; Tables 47 , 56 | Enlarged candidate sets and sampled decoding preserve the main exact-context separation; wide-OOD random wins are treated as high-baseline cases and interpreted through continuous margins. |
| The effect may be only hidden-state replacement | Tables 48 , 49 , 50 , 51 | Hidden-only and key-only patches are weak; value/cache replacement carries the arithmetic transfer, with checkpoint-dependent readout support. |
| Cell | Breadth | Gate | Active carrier | Oracle suff. TW | Matched corruption | Decoded CF | Call |
|---|---|---|---|---|---|---|---|
| 1B arithmetic-like | two-hop, three-hop, conditional | FG 1.00 ( ) | latent-tail KV | 1.00 vs 0.00 ( ) | corrupt 0.00 vs 1.00; dLP 12.79 ( ) | 1.00 vs 0.00 ( ) | latent-tail repl. |
| 1B entity lookup | single visible binding | FG pass 1.00 ( ) | prompt-prefix KV | 1.00 vs 0.00 ( ) | corrupt 0.00 vs 1.00; dLP 21.87 ( ) | 0.88 vs 0.00 ( ) | carrier shift |
| 1B relation chain | 12-room relation repair | FG 1.00 ( ) | prompt-prefix KV | 1.00 vs 0.00 ( ) | corrupt 0.00 vs 1.00; dLP 20.69 ( ) | 1.00 vs 0.00 ( ) | carrier shift |
| 8B arithmetic-like | two-hop, three-hop, conditional | FG 0.99 ( ) | prompt-prefix KV | 1.00 vs 0.00 ( ) | corrupt 0.00 vs 0.99; dLP 13.64 ( ) | 1.00 vs 0.00 ( ) | scale shift |
| 8B entity lookup | single visible binding | FG 1.00 ( ) | prompt-prefix KV | 1.00 vs 0.00 ( ) | corrupt 0.00 vs 1.00; dLP 16.25 ( ) | 1.00 vs 0.00 ( ) | carrier shift |
| 8B repair/binding | expression, list, relation | FG 1.00 ( ) | prompt-prefix KV | 1.00 vs 0.00 ( ) | corrupt 0.00 vs 1.00; dLP 21.07 ( ) | 1.00 vs 0.00 ( ) | shift |
| 8B cell | Split | Pref. | Lat. | Src. ctrl | Best visible field TW | Call | |
|---|---|---|---|---|---|---|---|
| 2-hop arithmetic | in-domain | 40 | 1.000 | 0.000 | 1.000 | initial_clause:1.00; facts_only:1.00; initial_red:1.00 | visible source-binding |
| 3-hop arithmetic | in-domain | 40 | 1.000 | 0.000 | 1.000 | initial_clause:1.00; facts_only:1.00; initial_red:1.00 | visible source-binding |
| entity lookup | in-domain | 40 | 1.000 | 0.000 | 1.000 | lookup_table:1.00; matching_lookup_entry:1.00; facts_only:1.00 | visible source-binding |
| relation chain | in-domain | 152 | 1.000 | 0.000 | 1.000 | query:1.00; person_table:0.00; room_table:0.00 | visible source-binding |
| expression tree | far-OOD | 81 | 0.988 | 0.000 | 0.988 | facts_only:0.98; input_bindings:0.63; left_inputs:0.59 | visible source-binding |
| expression tree | ultra-OOD | 81 | 0.185 | 0.136 | 0.200 | facts_only:0.22; input_bindings:0.20; left_inputs:0.20 | boundary/no call |
| Audit | Rows / sweep | Outcome |
|---|---|---|
| Carrier threshold grid | Sufficiency floor crossed with competitor ceiling on large- 1B/8B carrier cells | Every grid point gives the same calls: latent-tail cells and prompt-prefix cells; no row becomes mixed or inconclusive. |
| Competence gate grid | Competence floor on the same large- 1B/8B carrier cells, using unpatched clean closed-set competence | Every grid point keeps all cells and the same latent-tail / prompt-prefix calls; raw competence is – . |
| Low-competence boundary check | Qwen3-4B sanity probes under the same closed-set competence rule | Four sanity probes remain below even a gate ( – ), with best oracle target win only – ; no mechanism call is unlocked by relaxing the default gate. |
| Default carrier threshold | Sufficiency , competitor | The default is a reporting rule tied to a chance-level competitor ceiling; it is not needed to separate the endpoint large- split rows. |
| Target-win tie audit | state-score cache-interchange rows in the retained JSONL outputs | Exact top-score ties occur in rows ( ); top-two score gaps within occur in rows ( ). |
| Diagnostic | Typical question | SCIT use | Why it matters here |
|---|---|---|---|
| Activation patching / causal tracing | Which hidden site changes an output? | Interchange source cache suffixes under exact counterfactual semantics | Keeps the high-level variable fixed by the task rather than inferred after observing a patching effect. |
| Residual hidden-state replacement | Is a single current vector sufficient? | Hidden-only and cache-only baselines | Separates vector-state accounts from accumulated cache-trajectory accounts. |
| Key/value component split | Is transfer routing-side or content-side? | Patch keys, values, K/V together, and matched corruptions | Shows whether the source effect follows attention routing or value content. |
| Linear probes / readout directions | Is a variable readable from a state? | Value probes and probe-direction interventions | Tests content without treating decodability as causal modularity. |
| Free-generation validation | Does a closed-set win survive decoding? | Greedy and sampled patched decoding on headline controls | Guards against teacher-forced candidate-set artifacts. |
| Matched random corruption | Is the localized region needed? | Replace recipient regions with in-distribution random-source regions | Adds a necessity check that is closer to the patch distribution than zero ablation. |
| Issue | Diagnostic | Takeaway |
|---|---|---|
| Carrier | Layer-group value-cache interchange on matched counterfactual pairs | In GPT-2-scale checkpoints, value patches in a middle-to-late window transfer the counterfactual answer; nonlate values and keys are weak. |
| Hidden state | Hidden-state-only, cache-only, and key/value separation | The current hidden vector alone is weak; the effect follows the value cache, with checkpoint-dependent readout support from the source hidden state. |
| Semantic slot | Same-answer, partial-variable, and exact-context source controls | Exact counterfactual trajectories dominate semantic controls, arguing against an answer-only or modular intermediate-slot account. |
| Necessity | Matched random corruption of recipient cache entries | Corrupting the same GPT-2 value region selectively damages recipient-answer preservation; the Sim-CoT replication is directional but weaker. |
| Boundary behavior | Greedy/sampled decoding, 1B/8B calibration cells, and targeted task repairs | Arithmetic cells preserve the decoded exact-context pattern, while expression/list, relation-chain, and 8B cells show that the carrier segment can shift or fail OOD. |
| Model / Template | All | Late | Late 8–9 | Late 10–11 | Nonlate |
|---|---|---|---|---|---|
| CODI-GPT2 / balls | 1.000/0.996 | 1.000/0.996 | 0.992/0.883 | 0.546/0.029 | 0.492/0.008 |
| CODI-GPT2 / books | 1.000/1.000 | 1.000/1.000 | 0.992/0.875 | 0.567/0.017 | 0.475/0.008 |
| CODI-GPT2 / coins | 1.000/1.000 | 1.000/1.000 | 1.000/0.908 | 0.492/0.017 | 0.400/0.000 |
| Sim-CoT-GPT2 / balls | 0.983/1.000 | 0.942/1.000 | 0.750/0.992 | 0.033/0.133 | 0.033/0.175 |
| Sim-CoT-GPT2 / books | 0.992/1.000 | 0.950/1.000 | 0.833/0.958 | 0.075/0.192 | 0.108/0.208 |
| Sim-CoT-GPT2 / coins | 0.975/1.000 | 0.942/1.000 | 0.792/0.992 | 0.017/0.133 | 0.067/0.183 |
| Model / Template | Oracle | Same CF Ans. | Same Partial | Same Int. / Wrong Var. |
|---|---|---|---|---|
| CODI-GPT2 / balls | 1.000/0.988 | 0.404/0.400 | 0.346/0.325 | 0.192/0.175 |
| CODI-GPT2 / books | 0.992/0.992 | 0.437/0.429 | 0.367/0.367 | 0.117/0.100 |
| CODI-GPT2 / coins | 1.000/1.000 | 0.450/0.450 | 0.308/0.308 | 0.125/0.142 |
| Sim-CoT-GPT2 / balls | 0.925/1.000 | 0.235/0.353 | 0.242/0.375 | 0.175/0.225 |
| Sim-CoT-GPT2 / books | 0.892/1.000 | 0.325/0.483 | 0.292/0.433 | 0.150/0.217 |
| Sim-CoT-GPT2 / coins | 0.908/1.000 | 0.237/0.356 | 0.217/0.367 | 0.133/0.192 |
| Region | Comp. | Target Win | Rec. Drop |
|---|---|---|---|
| Late | Value | 0.767/0.211 | 2.431/13.655 |
| Nonlate | Value | 1.000/1.000 | 0.006/0.013 |
| Late 8–9 | Value | 0.906/0.319 | 0.874/9.837 |
| Late 10–11 | Value | 1.000/0.986 | 0.008/0.186 |
| Late | Key | 1.000/1.000 | 0.002/0.004 |
| Nonlate | Key | 1.000/1.000 | 0.000/0.000 |
| Axis | Covered in this diagnostic | Not established |
|---|---|---|
| Task family | Main diagnostic: one two-hop arithmetic program expressed as balls, books, and coins templates; SCIT-Bench v2 adds clean three-hop arithmetic, conditional arithmetic, entity lookup, graph path, relation chain, finite-state tracking, fixed-rule state updates, expression trees, and list filter/sum as calibration diagnostics; competence-gated repairs expose expression/list, relation-chain, and state-update carrier shifts, plus fixed-rule sequence-holdout failure | Open-domain task families and robust long-horizon state tracking |
| Counterfactual semantics | Exact recipient, oracle, partial-variable, same-answer, and random sources | Naturally occurring benchmark items without constructed source controls |
| Numerical robustness | Wider OOD numeric values with post-transfer and held-fixed counts in 100–500 and transfer counts in 10–99 | Long arithmetic, negatives, carry/borrow-heavy calculations, or symbolic algebra |
| Model scale | Two GPT-2-scale checkpoints plus public/matched LLaMA3-1B calibration diagnostics and matched 1B/8B carrier-split probes, including relation-chain and expression/list repair | A stable latent-tail carrier across large latent-CoT model families |
| Behavioral readout | Teacher-forced target win, greedy and limited temperature-sampling diagnostics, and prompt-only base-model sanity checks | Open-ended downstream deployment behavior or long-horizon reasoning |
| Requirement | Needed for a strong generalization claim | Current status in this paper |
|---|---|---|
| Task structure | A balanced set of exact-counterfactual families: deeper linear arithmetic, branching arithmetic, list aggregation, symbolic binding, path/state tracking, and mixed composition | Positive latent-tail evidence is strongest for arithmetic-like cells; repaired expression/list and relation-chain cells are competent at 8B or 1B/8B but shift to prompt-prefix K/V; minimal and fixed-rule state-update cells also shift to prompt-prefix or remain finite-support bound |
| Model scale | The same diagnostic battery across small, 1B, mid-scale, and 8B-or-larger checkpoints, preferably with at least two architecture families | GPT-2 and 1B arithmetic-like cells support latent-tail value/KV transfer; matched 8B, expression/list repair, and relation-chain probes support full-cache/prompt-prefix transfer but not latent-tail transfer |
| Competence gate | Free-generation and teacher-forced competence before interpreting any causal intervention | Applied throughout the calibration cells; failed or weak cells are treated as competence-limited rather than mechanism failures |
| Carrier contract | For each competent cell, report hidden-only, cache-only, cache-plus-hidden, latent-tail, prompt-prefix, full-cache, key/value/KV, semantic controls, corruption, and free-generation transfer | Implemented for the main arithmetic cells and the current 1B/8B carrier-split probes; repaired expression/list and relation-chain cells have source controls, matched span corruption, prompt-segment or prompt-field split, and patched free generation; minimal and fixed-rule state-update cells have objective, horizon, segment, and sequence-holdout checks |
| Success criterion | Either stable latent-tail value/KV transfer across the grid, or a reproducible map of when the carrier shifts across task and scale | Current evidence supports a limited carrier-regime map, not a universal late-value mechanism |
| Checkpoint / renderings | Recip./oracle FG | Recip./oracle TW | Oracle latent/prompt/full K/V TW | Decision |
|---|---|---|---|---|
| Single-template: original, unseen compact | ( each) | prompt-prefix call retained | ||
| Single-template: unseen brief | – | fails competence; scan withheld | ||
| Multi-template: original, compact, unseen brief | per form | per form | ( each) | prompt-prefix call retained |
| Model | Task cell | Oracle TW | Best group | Margin | Free G/S | Corr. TW |
|---|---|---|---|---|---|---|
| CODI-GPT2 | balls/books/coins | 1.000 | q3 09–11 | 0.380–0.463 | 1.000 / 0.978–1.000 | 0.183 |
| Sim-CoT-GPT2 | balls/books/coins | 0.975–1.000 | q3 09–11 | 0.250–0.363 | 1.000 / 1.000 | 0.283–0.367 |
| Sim-CoT-LLaMA3-1B | balls/books/coins | 1.000 | q2 08–11 | 0.412–0.450 | 1.000 / 1.000 | 0.117–0.183 |
| CODI-GPT2 | three-hop | 0.863 | q2 06–08 | 0.350 | 0.467 / 0.511 | 0.167 |
| Sim-CoT-GPT2 | three-hop | 0.713 | q2 06–08 | 0.375 | 0.600 / 0.600 | 0.367 |
| Sim-CoT-LLaMA3-1B | three-hop | 1.000 | q3 12–15 | 0.000 | 1.000 / 1.000 | 0.000 |
| Task cell | Recip. G/S | Oracle G/S | TF Oracle | Margin | Interpretation |
|---|---|---|---|---|---|
| balls/books/coins | 1.000 / 1.000 | 1.000 / 1.000 | 1.000 | 0.000 | Arithmetic transfer remains saturated, but semantic controls also saturate after augmentation. |
| three-hop | 1.000 / 0.989 | 1.000 / 1.000 | 0.988 | -0.012 | Deeper arithmetic remains transferable; semantic separation is not clean. |
| conditional | 1.000 / 1.000 | 0.333 / 0.333 | 0.863 | -0.025 | Competence is repaired, but free-generation transfer is weak and controls have high baselines. |
| entity lookup | 1.000 / 1.000 | 0.000 / 0.000 | 0.000 | -1.000 | Competence without cache transfer; a clear boundary for the current mechanism claim. |
| graph path | 0.167 / 0.133 | 0.200 / 0.089 | 0.138 | -0.138 | Mostly competence-limited, so not interpretable as a mechanism failure. |
| Task | Scale / repair | Gate | Carrier readout |
|---|---|---|---|
| Expression/list | 1B targeted repair | Weak in-domain and fails OOD gate | Targeted repair improves teacher-forced scores but does not yield an interpretable mechanism cell. |
| Expression/list | 8B targeted repair | Passes in-domain; OOD fails or remains control-limited | Prompt-prefix/full-cache K/V; latent-tail transfer absent. |
| Relation chain | 1B repaired | Passes held-out free generation; 12-room carrier refresh | Prompt-prefix/query/full-cache K/V; latent-suffix transfer absent. |
| Relation chain | 8B repaired | Passes held-out free generation; 12-room carrier refresh | Same prompt-prefix/query/full-cache field-binding regime at larger scale. |
| Relation chain OOD | 1B repaired | Fails OOD vocab/template gate | Limits repaired-task generalization. |
| Graph path | 1B repaired | Fails short/long hop gates | Path-following competence boundary. |
| Cell | Gate / stability outcome | Source-control outcome | Interpretation |
|---|---|---|---|
| SCIT-Aug 1B/8B baseline | Fails greedy recipient gate | Oracle does not cleanly separate from controls | No zero-shot task-breadth evidence for expression trees or list aggregation. |
| 1B targeted repair | Weak in-domain; fails OOD gate | Oracle is weak or tied with controls | Not a positive mechanism cell; competence repair is insufficient at this scale. |
| 8B expression-tree repair | In-support and far-OOD sampled gates pass after wide-support repair; ultra-OOD fails | Oracle improves over controls in support, but random prompt-prefix sources remain competitive | Support-distance success with a prompt-prefix carrier, not robust OOD generalization. |
| 8B list-filter/sum repair | In-support and far-OOD gates pass; ultra-OOD is partial | Oracle separates in support, while far/ultra-OOD are limited by strong random-source prompt-prefix patches | Same boundary: repair gives wider support competence but not a broad task-generalization claim. |
| Prompt-only baseline | Expression tree | List filter/sum | Paper use |
|---|---|---|---|
| 1B base, answer-only | Fails in-domain and OOD | Fails in-domain and OOD | Numeric answer-only readout is a strict deployment setting, not a strong natural baseline. |
| 8B base, answer-only | Fails in-domain and OOD | Partial but not clean | Same readout caveat; this does not by itself prove the task family is difficult. |
| 1B base, CoT prompt | Strong in-domain and OOD with a longer output cap | Weak to partial | Expression-tree is feasible with a scratchpad, so the repair result should not be framed as natural task difficulty. |
| 8B base, CoT prompt | Strong in-domain, OOD, and far-OOD with a longer output cap | Partial to strong, including far-OOD | Ordinary scratchpad readout can solve these task families; expression/list is best used to test carrier shifts under latent-CODI repair. |
| Cell | Active prompt fields | Inactive fields | Interpretation |
|---|---|---|---|
| Expression tree, train/far support | Fact spans and changed input bindings, especially the left-branch inputs | Rule-only, query, answer-prefix, and latent-suffix spans | Transfer is tied to visible source operands rather than to a latent-tail trajectory. |
| Expression tree, ultra-OOD | The same fact/input ordering weakens with the failed deployment gate | Latent suffix remains ineffective | The field split mirrors the ultra-OOD competence boundary rather than rescuing it. |
| List filter/sum, train/far/ultra | Fact/rule spans, with threshold/filter fields as partial carriers | Raw value bindings, answer-prefix, query, and latent-suffix spans | Transfer follows the visible filtering rule that determines which items enter the aggregation. |
| Probe | Held-out structure | Deployment result | Interpretation |
|---|---|---|---|
| Matched 8B two-step repair | No same-horizon sequence holdout | Passes the matched two-step gate; fails shorter/longer horizon checks | A useful competent calibration cell, but its carrier is visible start/query and prompt-prefix cache rather than latent-tail rule execution. |
| Replicated sequence holdout | Three separate splits, each removing multiple bigrams | Seen supports pass; held-out supports fail | The matched success is not stable once small same-horizon regions are removed. |
| Leave-one bigram grid | Train on eight of nine two-symbol sequences | All seen splits pass; every held-out split fails the free-generation gate | Rules out the objection that the earlier held-out splits removed too much support. Partial cells remain below the deployment gate. |
| Net-displacement class holdout | Remove same-net or reverse bigram classes together | Seen supports pass; held-out classes collapse | The partial leave-one signals are best explained by local interpolation from nearby seen bigrams, not by algorithmic state updating. |
| Probe | What it tests | Observed pattern | Interpretation |
|---|---|---|---|
| Block-wise value probes | Whether value blocks contain readable arithmetic variables | Input/context variables are strongly decodable; intermediate and outcome variables are only partial | The trajectory contains task information, but not a modular symbolic trace. |
| Probe-direction intervention | Whether a decoded variable direction is a causal control direction | Probe margins can be moved strongly, but the intended counterfactual answer does not overtake the recipient answer | Decodability is not enough for causal modularity. |
| Semantic source controls | Whether matching an answer or partial variable is sufficient for transfer | Exact counterfactual context dominates same-answer and partial-variable controls | The causal carrier is context-bound rather than a reusable answer or intermediate slot. |
| Cross-template sources | Whether exact context transfer is tied to surface wording | Exact arithmetic contexts transfer across balls/books/coins wording | The trajectory is not merely lexical-template binding. |
| Suffix-window, head, and geometry scans | Whether transfer is a last-token, single-head, or purely lexical trigger | Multi-token suffixes are needed; ranked multi-head patches beat random; exact cross-template pairs align more than off-diagonal pairs | The causal effect is accumulated, sparse-distributed, and partly representation-aligned over the value trajectory. |
| Model | ||||
|---|---|---|---|---|
| CODI | 0.000 | 0.203 | 0.203 | 0.984–1.000 |
| Sim-CoT | 0.026 | 0.516 | 0.995 | 1.000 |
| Patch | All /48 | Equal /21 | Unequal /27 |
|---|---|---|---|
| Full latent K/V+ | 47 | 21 | 26 |
| latent K/V+ | 47 | 21 | 26 |
| latent K/V+ | 44 | 20 | 24 |
| Full latent V+ | 47 | 21 | 26 |
| Full latent K+ | 18 | 8 | 10 |
| Full latent K/V only | 27 | 10 | 17 |
| Patch | 1h | 3h | 5h | 8h |
|---|---|---|---|---|
| Ranked, cache+h | 0.009 | 0.255 | 0.833 | 0.982 |
| Random, cache+h | 0.000 | 0.003 | 0.005 | 0.023 |
| Ranked, cache-only | 0.023 | 0.287 | 0.824 | 0.968 |
| Random, cache-only | 0.002 | 0.005 | 0.011 | 0.020 |
| Cell | Active carrier | Top-1 | Top-4 | Top-8 | Top-16 | Random-64 |
|---|---|---|---|---|---|---|
| 1B arithmetic | Latent-tail value | 0.000 | 0.727 | 1.000 | 1.000 | 0.445 |
| 1B entity | Prompt-prefix K/V | 0.023 | 0.781 | 1.000 | 1.000 | 0.531 |
| 8B arithmetic | Prompt-prefix K/V | 0.996 | 1.000 | 1.000 | 1.000 | 0.254 |
| 8B entity | Prompt-prefix K/V | 0.000 | 0.504 | 0.996 | 1.000 | 0.117 |
| 8B expression | Prompt-prefix K/V | 0.453 | 0.793 | 0.883 | 0.965 | 0.160 |
| 8B list | Prompt-prefix K/V | 0.027 | 0.527 | 0.734 | 0.996 | 0.141 |
| Cell | SCIT carrier | KV stable rank, Lat./Pref. | KV norm, Lat./Pref. | Top-8 attn., Lat./Pref. | Time scan |
|---|---|---|---|---|---|
| 1B arithmetic | Latent-tail value/KV | 12.1 / 11.8 | 128 / 131 | .111 / .781 | Latent c-only 4/6; latent +h 6/6. Prefix c-only 0/6. |
| 8B arithmetic | Prompt-prefix K/V | 36.9 / 12.4 | 5.9 / 320 | .011 / .973 | Prefix c-only/+h 6/6; latent 0/6. |
| 8B expression | Prompt-prefix K/V | 33.9 / 15.3 | 12.9 / 418 | .006 / .978 | Prefix c-only/+h 6/6; latent 0/6. |
| 8B list | Prompt-prefix K/V | 40.7 / 30.7 | 39.2 / 374 | .013 / .949 | Prefix c-only/+h 6/6; latent 0/6. |
| 8B relation | Prompt-prefix K/V | 20.9 / 35.3 | 141 / 304 | .033 / .959 | Prefix c-only/+h 6/6; latent 0/6. |
| Block | CKA | Pair | Offdiag | Gap |
|---|---|---|---|---|
| Nonlate | .999 | .996 | .720 | .277 |
| Late 8–9 | .999 | .995 | .563 | .432 |
| Late 10–11 | .999 | .996 | .432 | .564 |
| Model | All | Late | 8–9 | 10–11 | Nonlate |
|---|---|---|---|---|---|
| CODI | 1.000 | 0.996 | 0.917 | 0.017 | 0.000 |
| Sim-CoT | 1.000 | 1.000 | 0.984 | 0.142 | 0.134 |
| Task | L9H1 | L8H1 | L8H8 |
|---|---|---|---|
| Balls | 1.225 | 1.060 | 0.865 |
| Books | 1.428 | 1.167 | 0.914 |
| Coins | 1.305 | 1.102 | 0.915 |
| Span | Ablation | Rec. win | Rec. drop |
|---|---|---|---|
| Latent value | zero | 0.425 | 11.43 |
| Latent K/V | zero | 0.388 | 12.49 |
| Latent key | zero | 0.900 | 1.02 |
| Prompt K/V | zero | 0.254 | 13.81 |
| Whole K/V | mean | 0.279 | 30.17 |
| Probe | Positive signal | Latent-tail result | Interpretation |
|---|---|---|---|
| Quick GPT-2 re-training dynamics | Oracle/full-cache target win rises from 0.58 at checkpoint 100 to 0.81 at checkpoint 440; prompt-prefix tracks the same curve | Latent-tail-only stays weak, roughly 0.14–0.23 target win with near-zero margin | This quick path does not show a clean ontogeny in which prompt binding compresses into a latent-tail carrier. |
| Stronger true-final recipe | Whole-cache and oracle transfer are high; a new-seed replicate preserves the effect | Latent-tail-plus-hidden recovers most oracle transfer, and suffix windows rise smoothly from near zero to high transfer | The arithmetic latent-tail regime is recoverable under stronger training, but it is not automatic. |
| Adjacent recipes | Higher learning rate and wider numeric support keep whole-cache transfer high | Latent-tail suffix patches remain weak while prompt-prefix/full-cache transfer dominates | Carrier choice is training-recipe sensitive even within GPT-2 arithmetic. |
| Stronger true-final | Whole-cache replacement remains strong | Sliding suffix patches from to stay near chance, while prompt-prefix transfer is high | Longer latent rollout alone does not imply latent-tail accumulation. |
| Stronger true-final | Oracle and whole-cache transfer are near saturated; a larger replicate preserves the effect | Latent-tail-plus-hidden is near saturated, and suffix windows rise gradually from one-token failure to full-suffix recovery | Longer horizons can recover a trajectory regime, but only for some recipes; horizon scaling is not monotonic. |
| Range-augmented support-wide | Recipient and oracle free-generation pass on the expanded numeric support across a larger evaluation replicate | Latent-tail-plus-hidden and full-cache transfer are saturated, while prompt-prefix remains weak; prompt-field splits localize the transfer to latent-suffix value/KV, not visible facts | Numeric support expansion can repair the old wide-range boundary inside support and restore the arithmetic latent-tail carrier. |
| Seed | Clean recipient TW | Late 8–9 suff. | Late 10–11 suff. | All-value suff. | Late 8–9 corrupt TW | Drop |
|---|---|---|---|---|---|---|
| s204a | .951 [.927,.971] | .138 [.104,.172] | .328 [.281,.375] | .464 [.414,.510] | .904 [.875,.932] | .047 |
| s204b | .938 [.911,.961] | .049 [.029,.070] | .143 [.109,.177] | .214 [.172,.253] | .849 [.812,.883] | .089 |
| s204c | .987 [.974,.997] | .135 [.102,.169] | .516 [.464,.562] | .479 [.427,.526] | .961 [.940,.979] | .026 |
| Checkpoint | Task cell | Latent-tail KV | Prompt-prefix KV | Full KV | Call |
|---|---|---|---|---|---|
| 1B + SCIT aug. | balls/books/coins | 1.000 | 0.000 | 1.000 | latent tail |
| 1B + SCIT aug. | three-hop | 1.000 | 0.000 | 1.000 | latent tail |
| 1B + SCIT aug. | conditional | 1.000 | 0.000 | 1.000 | latent tail |
| 1B + SCIT aug. | entity lookup | 0.000 | 1.000 | 1.000 | prompt prefix |
| 1B relation repair | relation chain | 0.000 | 1.000 | 1.000 | prompt prefix |
| 1B finite-state tiny | one-symbol/one-step | 0.000 | 1.000 | 1.000 | prompt prefix |
| Model | All | Late | Nonlate | 6–8 | 9–11 | 6–7 | 8–9 | 10–11 | 6–9 |
|---|---|---|---|---|---|---|---|---|---|
| CODI-GPT2 | 1.000 | 0.994 | 0.000 | 0.211 | 0.639 | 0.000 | 0.900 | 0.011 | 0.967 |
| Sim-CoT-GPT2 | 1.000 | 1.000 | 0.161 | 0.717 | 0.956 | 0.133 | 0.983 | 0.117 | 0.989 |
| Model / Range | All | Late | Late 8–9 | Late 10–11 | Nonlate |
|---|---|---|---|---|---|
| CODI-GPT2 / wide OOD | 0.794/0.797 | 0.797/0.761 | 0.719/0.594 | 0.453/0.133 | 0.386/0.081 |
| Sim-CoT-GPT2 / wide OOD | 0.572/0.692 | 0.506/0.686 | 0.453/0.583 | 0.183/0.217 | 0.203/0.217 |
| A. 1B vector-versus-cache diagnostic, step 6 target win | |||||
|---|---|---|---|---|---|
| Model | Task scope | Hidden only | Latent cache | Cache+h | Last cache+h |
| Sim-CoT-LLaMA3-1B | balls/books/coins | 0.000 | 1.000 | 1.000 | 0.000 |
| Sim-CoT-LLaMA3-1B | + three-hop | 0.000 | 1.000 | 1.000 | 0.000 |
| CODI-LLaMA3-1B | balls/books/coins | 0.000 | 0.933 | 0.933 | 0.008 |
| CODI-LLaMA3-1B | + three-hop | 0.000 | 0.950 | 0.950 | 0.006 |
| B. 1B wide numeric OOD, all-layer value cache+h, step 6 target win | |||||
| Intervention | Target Win | Target Delta |
|---|---|---|
| Late value cache-only | 0.469/0.998 | 12.755/15.618 |
| Late value cache+h | 1.000/0.998 | 15.642/15.618 |
| Late 8–9 cache-only | 0.152/0.887 | 9.554/14.946 |
| Late 8–9 cache+h | 0.994/0.887 | 15.616/14.951 |
| Nonlate cache-only | 0.002/0.006 | 0.774/1.391 |
| Nonlate cache+h | 0.465/0.006 | 12.482/1.402 |
| Intervention | Target Win | CF Gap Delta |
|---|---|---|
| Hidden state only | 0.246/0.000 | 12.116/0.003 |
| Latent cache only | 0.704/1.000 | 19.470/31.898 |
| Latent cache + h | 1.000/1.000 | 31.893/31.893 |
| Last latent cache + h | 0.267/0.196 | 12.254/11.521 |
| Full cache only | 0.758/1.000 | 20.564/32.523 |
| Full cache + h | 1.000/1.000 | 32.522/32.522 |
| Intervention | Target Win | CF Gap Delta |
|---|---|---|
| Hidden state only | 0.017/0.033 | 4.869/6.270 |
| Latent cache only | 0.361/0.928 | 12.806/21.897 |
| Latent cache + h | 0.944/1.000 | 21.961/28.198 |
| Last latent cache + h | 0.672/0.589 | 16.751/15.700 |
| Full cache only | 0.983/0.961 | 24.197/23.052 |
| Full cache + h | 1.000/1.000 | 29.022/29.022 |
| Intervention | TW s5 | TW s6 | s5 | s6 |
|---|---|---|---|---|
| Key suffix cache-only | 0.000 | 0.000 | 0.380 | 0.786 |
| Value suffix cache-only | 0.750 | 1.000 | 14.704 | 16.408 |
| KV suffix cache-only | 0.583 | 1.000 | 14.164 | 16.414 |
| Key suffix cache+h | 0.175 | 0.000 | 9.966 | 0.777 |
| Value suffix cache+h | 1.000 | 1.000 | 16.411 | 16.409 |
| KV suffix cache+h | 1.000 | 1.000 | 16.414 | 16.414 |
| Recipient | Source | Target Win | Target Delta |
|---|---|---|---|
| balls | In-template oracle | 1.000/1.000 | 16.227/16.206 |
| balls | Same-template partial-variable | 0.308/0.258 | 2.751/3.295 |
| balls | Cross-template books | 1.000/0.992 | 16.226/16.202 |
| balls | Cross-template coins | 1.000/0.992 | 16.226/16.203 |
| balls | Cross-template partial books | 0.333/0.300 | 2.720/3.219 |
| balls | Cross-template partial coins | 0.300/0.267 | 3.103/3.481 |
| Recip. | Oracle | Exact | Same Part. | Part. |
|---|---|---|---|---|
| balls | 0.983/1.000 | 0.992/1.000 | 0.233/0.317 | 0.208/0.308 |
| books | 0.967/1.000 | 0.958/1.000 | 0.217/0.317 | 0.200/0.317 |
| coins | 0.933/0.983 | 0.933/0.983 | 0.183/0.283 | 0.208/0.308 |
| Recipient | Source | N | Free CF | Free Recip. | Teacher Target |
|---|---|---|---|---|---|
| balls | Oracle | 60 | 0.967 | 0.017 | 0.983 |
| balls | Exact x-template avg | 120 | 0.975 | 0.008 | 0.992 |
| balls | Same partial vars | 60 | 0.000 | 0.100 | 0.367 |
| balls | Partial x-template avg | 120 | 0.000 | 0.058 | 0.292 |
| balls | Random source | 60 | 0.050 | 0.017 | 0.583 |
| books | Oracle | 60 | 0.983 | 0.000 | 1.000 |
| Recip. | Oracle | Exact | Same Part. | Part. | Rand. |
|---|---|---|---|---|---|
| balls | 1.000 | 1.000 | 0.000 | 0.000 | 0.033 |
| books | 0.983 | 0.983 | 0.000 | 0.008 | 0.050 |
| coins | 1.000 | 1.000 | 0.000 | 0.000 | 0.067 |
| Model | Source group | Samples | Free CF | Free Recip. | Out-of-set | Entropy |
|---|---|---|---|---|---|---|
| CODI-GPT2 | Oracle | 300 | 0.967 | 0.020 | 0.013 | 3.844 |
| CODI-GPT2 | Exact x-template | 600 | 0.970 | 0.022 | 0.008 | 3.849 |
| CODI-GPT2 | Same partial vars | 300 | 0.000 | 0.050 | 0.867 | 3.671 |
| CODI-GPT2 | Partial x-template | 600 | 0.000 | 0.057 | 0.848 | 3.782 |
| CODI-GPT2 | Random source | 300 | 0.017 | 0.023 | 0.843 | 3.677 |
| Sim-CoT-GPT2 | Oracle | 300 | 0.993 | 0.000 | 0.007 | 3.793 |
| Model | Patch | Oracle | Exact Avg. | Same Part. | Part. Avg. | Random |
|---|---|---|---|---|---|---|
| CODI-GPT2 | cache only | 0.978 | 0.978 | 0.006 | 0.006 | 0.033 |
| CODI-GPT2 | cache+h | 0.978 | 0.978 | 0.006 | 0.006 | 0.033 |
| Sim-CoT-GPT2 | cache only | 0.636 | 0.632 | 0.031 | 0.025 | 0.031 |
| Sim-CoT-GPT2 | cache+h | 0.992 | 0.992 | 0.000 | 0.003 | 0.028 |
| Region | Comp. | Target Win | Rec. Drop |
|---|---|---|---|
| Late | Value | 0.975/0.606 | 0.351/3.912 |
| Nonlate | Value | 1.000/1.000 | 0.001/0.004 |
| Late 8–9 | Value | 0.986/0.753 | 0.226/2.353 |
| Late 10–11 | Value | 1.000/1.000 | 0.000/0.004 |
| Late | Key | 1.000/1.000 | -0.000/0.001 |
| Nonlate | Key | 1.000/1.000 | 0.000/0.000 |
Transformer Interpretability
Transformer interpretability studies how attention, feed-forward layers, and hidden representations support model predictions and behavior.
See all 339 papers