- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper considers the speed at which a looped transformer correctly predicts a token. For example, it looks at where is the transformer operator, and sees how many tokens it correctly predicts. For their experiments, they used a "running parity" example alongside some (mathematical) groups to have analytical answers for the sequences they model. What they found is that training speed does have a dependence on the loop count, while there seems to be a sweet point (Figure 2) where loop count/frontier speed is maximized alongside "more loops" giving the correct answer.
Critical strengths
The question of how much each loop contributes to the final answer is interesting, and relevant: while looped transformer saves on weights, early stopping of loops will trivially save on inference costs. If a small amount of loops are enough to get 90% of the solution, then that's a huge win. Furthermore, the experimental design of using the running parity seems like a great idea: allows one to have infinite datasets generation, and is simple enough to expect 100% accuracy.
Critical weaknesses
-
There's too much text devoted to running additional experiments, and definitely not enough on the analysis of why. As discussed in the paper, the problems analyzed are generally smaller and simpler than LLM, thus analytical insights should be the goal IMO so that we can transfer it to bigger problems. The additional experiments, like section 4 and 5, seems quite obvious and doesn't provide new insights: it's known that changing intermediate tokens in causal attention will change downstream results.
-
Writing: the subsections are not labeled (e.g. "Changing the training loop count." is not bold). Figure 6 caption can use better formatting with the \ge, \le and spacing etc. "primary cohort" "confirmation cohort" vs "training set" "validation/testing set". The data for the groups problem isn't written down in the paper i think. Overall, needs a large degree of polishing.
Questions for authors
-
I'm confused about the the value of : it's supposed to be "fixed loop multiplier", which indicates to me it should be an integer, but it's clear from later reading that is a fraction for some experiments. Can you explain what this is concretely? I understand: using Figure 1 notation, we just loop , but why is (and correspondingly ) the correct indicators to look at in the figures.
-
Figure 2 looks like the training is not complete? For d=1, the frontier never reaches 32 suggesting that learning is incomplete. I do wonder if it's because you're using such a large transformer for a such a small problem.
-
Figure 3: It took me awhile to figure out that the second row correspond to different seeds and the results: it really does feel like more seeds need to be run or results cleaned up. At the same time, why is "full by 4n" and "invalid by 4n" no the exact inverse of each other? Similar to question 1, why 4n? Concrete number and examples here would be appreciated.