Scores by kind of claim
Each kind of claim is scored on its own, out of 100: the share that held up, with the range it likely falls in. Fewer resolved claims give a wider range.
-
Factual claims
Statements about the present or the past, checked against the record: did they hold up?
83 77 88 -
Predictions
Statements about events outside the person's control, checked once they fell due: did they come true?
67 49 83 -
Promises
Commitments to the person's or organisation's own future action, with something to deliver: was it delivered?
Insufficient record: 1 promise resolved, 5 needed for a score.
All types combined: 81 (likely 76 to 86, high confidence), from 87 claims: 79 factual claims, 8 predictions. It mixes kinds of claim in different proportions for different people, so compare people kind by kind.
Rodney Brooks's claims
39 claims
“Each column from bottom to top is a pure feed forward network, with no search, no iteration, no conventional algorithm at all.”
Rodney Brooks, blog author 1 January 2025 Predictions Scorecard, 2025 January 01 (rodneybrooks.com)
In the 2017 'Attention Is All You Need' transformer architecture, each column from bottom to top is a pure feed-forward network with no search, iteration or conventional algorithm.
Mostly true True in substance, wrong in a detail.
What would count as true or false
This is judged against the architecture described in Vaswani et al. 2017. True if, in a single forward pass for one position, the computation runs from the bottom layer to the top through a fixed stack of attention and feed-forward layers, with no recurrence, iterative loop, search or conventional algorithm inside the pass; 'feed-forward' is read in the network sense of an acyclic computation. Mostly true if this holds but the description misstates a minor detail, for example by ignoring that attention mixes information across positions, so the 'column' is not isolated. Mixed if the architecture involves real iteration that substantially contradicts the claim, such as autoregressive decoding loops being treated as part of the column. Mostly false or false if the paper's architecture includes recurrence, search or algorithmic iteration within a layer stack's forward pass.
Evidence
- Attention is All you Need NeurIPS Proceedings (NIPS 2017) · 2017
“Given z, the decoder then generates an output sequence (y1, ..., ym) of symbols one element at a time. At each step the model is auto-regressive [9], consuming the previously generated symbols as additional input when generating the next.”
- Attention is All you Need NeurIPS Proceedings (NIPS 2017) · 2017
“Each position in the encoder can attend to all positions in the previous layer of the encoder.”
- Attention is All you Need NeurIPS Proceedings (NIPS 2017) · 2017
“In addition to attention sub-layers, each of the layers in our encoder and decoder contains a fully connected feed-forward network, which is applied to each position separately and identically.”
- arxiv-1706.03762.md attention-wiki knowledge-base (Hugging Face datasets; publisher not otherwise identified on page)
“An encoder maps an input sequence to continuous representations; a decoder generates the output autoregressively.”
Reasoning
E3 describes the encoder and decoder as stacks of layers, each with attention sub-layers and a position-wise feed-forward network. This matches a fixed bottom-to-top computation with no search or conventional algorithm inside a single pass. E2, however, shows that self-attention lets each position draw on every position in the previous layer, so a 'column' is not isolated. The criteria treat that as a minor misstatement. The autoregressive decoding in E1 and E4 is a loop across output steps, not iteration within one forward pass through the stack, so it does not contradict the claim about each column.
Cite this claim
Rodney Brooks, “In the 2017 'Attention Is All You Need' transformer architecture, each column from bottom to top is a pure feed-forward network with no search, iteration or conventional algorithm.” (said 1 January 2025). Verdict: mostly true. Reliability API, claim c_ff6621bb6cf5, method 0.1.0+c876030c. https://epistacklabs.com/claims/c_ff6621bb6cf5
Claims without a verdict
Is a verdict here wrong, or do you speak for Rodney Brooks? Reply on the claim's own page, with the form at its foot (how replies work). Verdicts are made automatically; how verdicts and scores are made.