- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper aims to show that looped transformers on a specific algebraic task learn one of two algorithms, named "scan" and "compressed front". Training on this task has for only effect to modify the probability of the algorithm being used, instead of increasing the performance of either.
Critical strengths
Studying what algorithms transformers learn through training is a very relevant topic, which is of interest to many in the community.
Critical weaknesses
The main weaknesses of this paper are how hard it is to follow. The motivation for the paper is not discussed. Many terms, including the main objects of study, are not defined. Many claims are not proven.
Many terms are either undefined, or are mentioned several times before being even informally defined:
- "This task" is mentioned several times in the abstract and conclusion without being given a name or even informally introduced. This is especially concerning given it is the main object of study of the paper.
- The two algorithms "scan" and "compressed front" are not formally defined. Once again, these are the main object of study.
- What does it mean formally for "the outcome to be one of two algorithms"?
- The checkpoints "237 and 90" are mentioned 3 times in the abstract and introduction without being even informally defined. It seems looking at page 4 that those refer to the number of tests conducted.
- Table 1 is given page 3, and the only mention of it in the main text is a cryptic paragraph "Table 1 reads naturally as a continuum of efficiency. It is not one." at page 4.
- What is the meaning of "reach" and "capacity", discussed in the introduction?
A lot of choices are unmotivated or not sufficiently explained, some claims are not proven.
- Why study "this task"?
- The model studied is not sufficiently described, as the "single core block" is not defined.
- Claims such as "S5 is NC1-complete" or "Solvable non-abelian S4 is not NC1-complete" are not justified. It would help to add references.
- The training details of the transformer are not introduced.
The paper may have interesting results. However, it requires extensive rewriting for it to be valuable to the community. I encourage the authors to spend time on rewriting the paper:
- Clearly expose the main motivation of the paper.
- Define every term clearly, especially those that are central to the paper.
- Justify every assumption, claim, and methodological choice.
Questions for authors
Why study "this task"?
What does it mean formally for "the outcome to be one of two algorithms"?
Corrected revision PDF
Corrected revision PDF. The PDF uploaded on Nov 8 carried a shortened AI-use statement: it limited the assistant's analysis role to one comparison (Section 9) and left out its role during the revision. The corrected PDF, now uploaded, states both: the assistant helped analyse and interpret results, and during the revision it drafted the designs and registered predictions of the new experiments and carried out the post-hoc analysis that identified the deadline rule. The authors approved everything submitted. Appendix A records for each prediction made during the discussion who drafted it and whether the authors adopted it before it was tested. The Nov 8 PDF also printed the ethics and reproducibility statements twice; the corrected PDF prints them once. Apart from these two fixes, the corrected PDF has wording edits throughout; no number, result or scientific claim changed.
changes_from_submission.pdfin the supplementary material and the anonymous repository is updated and marks every change.TL;DR correction. The submission form does not let us edit the TL;DR during the discussion, so it still states the withdrawn two-algorithms claim. It should read: "On group prefix products, weight-tied looped transformers learn a one-position-per-loop scan by default; under a binding deterministic depth budget, the median model that leaves it runs about as fast as the tightest training deadline requires."