- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper argues that building a Global Workspace Theory (GWT) component into a network does not show that the network uses it. It proposes a five-rung causal protocol: presence, dependence, content use, mechanism, and breadth. Its key tool is a transplant whose recipient, donor and hybrid answers are pairwise distinct, which separates ignoring, relaying and computing.
The protocol is applied to AFGW, a 6.9M-parameter model whose modules communicate only through a learned workspace, and confirmed on four models trained under a frozen protocol. Zeroing the broadcast cuts composition accuracy by 41–52 points, and a packet transplant yields the hybrid answer in 61–73% of cases versus 5–13% natively. Restoring the receiver's final-round queries recovers the native output in 2,047/2,048 cases. A post hoc query-only transplant and a separate three-receiver variant support sufficiency and breadth.
Critical strengths
- Rigorous confirmation. Discovery is separated from a hash-committed, frozen protocol with fresh corpora and seeds; denominators are complete and every exception is reported.
- Clean causal design. The three-value transplant separates ignoring, relaying and computing, and the 2×2 query design correctly distinguishes necessity from sufficiency.
- Clear framing, honest scope. The verification gap and Proposition 1 explain why ablation is uninformative, and the claims are carefully limited.
- Useful testbed. AFGW offers exact counterfactual ground truth for testing interpretability methods.
Critical weaknesses
W1. Architectural dependence of the mechanism. The tied-embedding head directly receives final lexical reads, favoring retrieval-based solutions. The direct-state route remains available, but the study does not establish whether the mechanism persists in a trained variant without this explicit lexical-read input.
W2. Limited GWT specificity. Competition and capacity are implemented, but their functional contribution remains untested, as Table 1 acknowledges. Routing weights π are not characterized, and no matched noncompetitive baseline establishes what the results show beyond general modular communication.
W3. Uneven confirmation strength. The query-only test reuses observed panels; the three-receiver variant uses development families and a different decoding schedule. These limitations are disclosed, but sufficiency and breadth have weaker confirmation than the primary restoration result.
W4. Control limitations. The same-facts/order control changes 13–32/128 outputs. Appendix H.4 explains order sensitivity analytically, but robustness to a permutation-invariant reader remains untested. Appendix F.1 also acknowledges that matched-norm noise controls magnitude rather than effects on retrieval scores; Figure 1’s “excludes query damage” overstates this control.
W5. Limited external validity and incremental novelty. The main evidence comes from a 6.9M-parameter synthetic setting with 64–75% composition accuracy. The discovery-stage eight-entity test is useful, but applicability to pretrained models remains untested. Novelty lies primarily in integrating established causal tools into a verification protocol.
Questions for authors
- Section 5.4 describes a single transplanted packet, whereas Appendix G.2 specifies replacements at writes 0, 1, and 2. Please reconcile these descriptions and explain the three-receiver variant’s 512/512 hybrid-output agreement.
- Does the receiver’s pre-read state retain information about alternative local answers that could support computation through route (b)?
- With receiver memory fixed, would queries targeting a third intermediate entity induce the corresponding hybrid answer? This would provide a structured semantic control beyond random noise.
4 comments
Response to Reviewer dgVq (2/2): Q1, W2, W4, W5
This comment (2 of 2) continues our reply with Q1, W2, W4 and W5.
Q1. The submitted test replaced writes 0–2. The breadth test is now a single packet on new families.
What was done. The submitted experiment replaced the source's writes 0–2, as Appendix G.2 stated. Section 5.4 should not have called this a single packet.
What 512/512 meant. It counted agreement with the model's own outputs on the hybrid world, errors included, not correctness. The trajectory transplant replaces the source's packet at every write the receivers consume and leaves their memories untouched. Each receiver then decodes its whole answer from its private cache. The new panel reproduces the complete agreement, 512/512 episodes, while joint correctness is 458/512 and 416/512.
The new test. It uses the write-2 packet alone, donors whose maps differ from the recipient's, so that the donor's answer and the hybrid answer are distinct, and an unseen panel of 512 episodes from four new families. The single packet yields all three receivers' hybrid answers jointly in 448/512 and 412/512 episodes (native joint accuracy 458 and 416, accidental 20 and 12). Writes 0 or 1 alone stay at the accidental rate, and the donor's joint output is copied in 0/512 episodes. Per receiver, restoration recovers every changed output, query-only installation reproduces 96.8–100%, and patching one receiver leaves its siblings bitwise unchanged. The breadth claim is limited to this variant and its decoding schedule (§5.4, Table 2, Appendix I.3).
W2. Broadcast content is used without competition, and learned routing strengthens a single packet. Models trained with uniform routing still recombine through redirected retrieval. Restoration returns all 1,315 changed cases to native, and query-only installation reproduces 1,312. Learned routing adds control for a single packet: it yields 18–82 more hybrid answers per 512, while trajectory results stay similar.
For each of the four original models, the baseline is a model with routing fixed at over the four modules and NULL, trained from the same starting checkpoint with the same data order and budget. Native accuracy differs from learned routing by at most 6/512. On the routing weights: at write 2 the learned router puts 0.956–0.995 of its weight on the source, and scaling that weight scales the transplant effect. Section 7 states that use does not depend on how access is allocated, and Table 6 records that it holds with learned and with uniform routing (Appendices E.6 and I.4).
W4. Each control limitation now has a direct test. Does the result depend on record order? In two models with a permutation-invariant reader, reordering records changes 0/512 outputs. Recombination remains: 392/512 and 426/512 hybrid answers, against 35 and 24 natively, and restoration and installation both hold in 424/424 and 442/442 changed cases (Appendix I.9). Is the query effect more than a perturbation? Matched-norm noise is now described as a magnitude control only, and the protocol figure no longer says it "excludes query damage". Two tests give specificity. Under the trajectory transplant, restoring the round-2 queries instead of the round-3 queries recovers 0–3 changed outputs, against 99.3–100% (Appendix E.3), so the effect is tied to the read site. The third-entity control (Q3) shows that the queries carry which entity to look up.
W5. A pretrained model, higher competence and larger worlds. Pretrained model. As a proof of concept, we ran the content and read tests in Qwen2.5-1.5B-Instruct. The message is a name the model generates and later looks up. Transplanting the name token's activation raises hybrid answers from 12/128 to 71/128, and restoring or installing attention rows, in a range of layers located from native attention, succeeds jointly in 70/72 changed cases, against 2/72 for matched random rows (§5.6, Appendix I.10). Competence. Under the richer recipe the original head answers 2,006/2,048 composition questions, and single-packet restoration at read 3 returns 534/534 changed cases on chains absent from training. The models of W1 compose at 97.83–100% and show the same mechanism (§5.1–5.3, Appendices I.1 and I.2). Larger worlds. Without retraining, the original four checkpoints carry the mechanism to eight-entity worlds: hybrid answers rise from 77 to 513 of 1,024, and both read tests hold in 798/804 changed cases (Appendix E.5).
On novelty, we agree that the tools are established. The contribution is what their combination distinguishes: relay and recombination systems on which accuracy and ablation give the same verdict, separated in 1,024/1,024 cases each (Appendix I.6), and content use on a route that zero-ablation calls dispensable (Appendix I.7).
We hope these results address your soundness concerns and support a stronger assessment.
I thank the authors for their detailed rebuttal and the additional experiments. The revisions address my concerns, and I appreciate the authors’ effort to improve the paper. I maintain my rating of 3 (weak accept).
Follow-up: one architecture learns opposite computations
Thank you for your reply, and for confirming that the new experiments address your concerns. The newest revision adds one finding that bears on the contribution, and it now reports its main results on the high-accuracy models.
New finding: one architecture learns opposite computations, and the protocol identifies which. Two AFGW models share architecture, starting checkpoint and training budget, and differ only in their training data. In one, the receiver's records are resampled at random during training, so only the source can compute the answer. Both answer at least 511/512 held-out composition questions, and both fail when the workspace is zeroed. A standard patch, whose donor answer is also the hybrid answer, moves both to the donor's answer in 512/512 cases. The three-value transplant gives the donor's answer in 511/512 cases in the first model and the hybrid answer in 512/512 in the second. The read tests hold in 512/512 changed outputs in the second model and in 0/511 in the first, so they do not pass where content does not act through retrieval.
A further workspace model, with a single memory reader, answers every held-out question of a two-hop narrative task while its broadcast goes nearly unused: zeroing everything its modules receive leaves 2,017/2,048 answers correct, and a donor's broadcast changes 0/2,048 outputs. The protocol therefore returns all three verdicts on trained workspace models: ignored, relayed and recombined. The division of work is learned, and accuracy, ablation and a standard patch do not reveal it (Figure 1, §5.5, Appendices I.4 and I.5).
The finding rests on high task competence (W5). The original-head models of W1 in our first reply are now the main models of the paper. They answer 2,006/2,048 held-out composition questions. One write-2 packet yields the hybrid answer in 1,990/2,048 cases, against 9 natively, and both read tests hold in 2,013/2,015 changed cases (§5.1–5.3, Appendix I.1). Without retraining, the same models answer 973/1,024 composition questions in eight-entity worlds, and both read tests hold in 1,005 of the 1,008 outputs that one packet changes (Appendix I.8). Breadth is reported with the same measure: both read tests hold in 2,894 of the 2,926 outputs that the single packet changes (§5.4). The frozen confirmation is unchanged. Section 4 states that its four models give the same verdicts, and Appendix E collects it with every further analysis of those models.
W2. Both routing rules support content use, and learned routing concentrates it. In a matched baseline at the same accuracy (2,001/2,048 against 2,006/2,048), all three packets yield the hybrid answer in 2,001/2,048 cases under uniform routing and under learned routing. A single packet yields it in 1,835/2,048 cases under uniform routing and in 1,990/2,048 under learned routing. Under this single-packet transplant, both read tests hold in 1,890/1,914 and 2,013/2,015 changed outputs. Use therefore does not depend on how access is allocated, and learned routing concentrates the content in one packet. We wrote that the commitments table marks the necessity of competition as not established. The table (now Table 6) and Section 7 state this finding directly (Appendices I.4 and E.6).
Some sections, appendices and tables are renumbered, and we have edited our earlier replies to you so that their statements and references match the revision. We hope the new finding supports a stronger assessment of the contribution.
Response to Reviewer dgVq (1/2): W1, Q2, Q3, W3
Thank you for the careful review and for recognizing the frozen confirmation and the causal design. We answer in two comments and keep your labels. This one (1 of 2) covers W1, Q2, Q3 and W3, the points that the new experiments answer most directly. The next covers Q1, W2, W4 and W5.
W1. Retrieval persists without the direct lexical-read input. We trained four matched pairs of models with the original and the no-direct head, on the same richer training pool (24 more families) and budget (12,288 updates). All four no-direct models reach 97.83–100% held-out composition. Transplanting the source's writes 0–2 yields the hybrid answer in 503–509/512 cases per model, and restoring and installing the receiver's queries across reads 1–3 jointly reverse and reproduce 98.8–100% of changed outputs. The read effect now spans rounds 1–3 instead of round 3 alone, and the protocol locates this shift. On composition chains absent from training, restoration returns 546/547 changed outputs to native, against 2/547 for matched noise (§5.3, Appendix I.2).
Q2. Route (b) stays open in the test, and the output still follows the queries. With the transplanted broadcast in place, restoring the native queries returns the native output, and installing only the induced queries reproduces the transplant. Both hold in 1,551/1,555 changed cases, and the direct effect of the broadcast on the hybrid rate, with queries held native, is zero in every model (Appendices E.1 and H.3). On what h3 contains: a ridge probe decodes the native answer from it at 57–71%. For alternative person-to-place assignments, cue plus h3 gives 35.1–36.1%, against 34.7–35.0% for the cue alone (Appendix E.3). A probe cannot show that such information is absent, which is why the answer rests on the interventions.
Q3. Yes: queries induced by a third entity yield the corresponding hybrid answer. With the receiver's memory fixed, a second donor binds the object to a third person (Cara in the paper's example). Across the 272 cases selected in advance by symbolic conditions, installing only the queries that this donor's packet induces yields that person's location in the receiver's unchanged memory, the corresponding hybrid answer, in 200 cases, against 24 natively, and gives the same output as the full third-entity transplant in all 272 (Appendix E.5). The control also holds at high competence. Under the richer recipe of W1, the original-head models give the third person's hybrid answer in 572/586 cases, against 2/586 natively (§5.3, Figure 5c, Appendix I.1).
W3. The four-condition design replicates on unseen panels. We evaluated the four original checkpoints on two new panels, one per corpus, fixed before inference. They share no complete world or entity set with any earlier training, development or confirmation data. The transplant yields 1,365/2,048 hybrid answers, against 227 natively. Restoration returns 2,048/2,048 outputs to native, query-only installation reproduces the transplant in 2,044/2,048, and both hold in 1,530/1,534 changed cases (Appendix E.5). The three-receiver variant is also re-evaluated on four new families with a single packet (Q1, next reply).