Summary
The paper provides some experimental and theoretical evidence that the softmax bottleneck explains degenerate behaviour that has been observed when training LLMs with fewer parameters. In particular, it empirically shows that:
1. as the input dimension $d$ of the final classification layer shrinks, training loss tends to worsen and plateau late in training, and
2. as this happens, the average cosine similiarity between vectors in this layer suddenly spikes, and
3. singular value distributions also become suddenly high entropy (that this corresponds to 2 is not surprising), and
4. The the softmax bottleneck (where $d$ is much smaller than the number of classes $n$) theoretically relates to the observed problem with singular value distributions.
Reasons to accept
- I don't work on this problem, but my outsider view is that there is enough here that it will probably be of interest to those trying to figure out how to build effective compact models. I think the evidence presented here is circumstantial (there might be other ways to explain all of these things happening at once), but that seems ok from a scientific perspective; other people might be able to follow up by exploiting these observations or by coming up with better explanations for them.
- The figures are quite clear, and make good use of a color gradient to illuminate relationships between variables. Most of what I understood from the paper was due to the figures.
Reasons to reject
1. The writing of the paper is quite frankly a mess. It appears to have been written in a big hurry, and some parts are difficult to follow, especially at the beginning. For example, at first I thought I would follow the paper pretty well, having understood the abstract, and having myself worked on the softmax bottleneck and on training dynamics. But I found the first paragraph (and much of the introduction) to be utterly incomprehensible, winging about obscure terms like "The representation degeneration problem" and "low angular variability" as if everyone working on LMs knows what these are. I think I followed the paper pretty well after a few pages in, after the central ideas were explained and it became clear that these terms were just needless technical mumbo-jumbo. But this is a problem, because as it stands, I think most readers won't bother reading past the first page if the paper remains in its current form. I certainly wouldn't have if I hadn't been reviewing it. The proof is written as a bunch of math with no intuitive explanation, including of how it connects to the rest of the exploration; you have to squint a bit to see the relationship, or else take it on faith.
2. The paper makes an overly strong, unqualified claim that "a linear head W substantially affects performance when rank(W) < 1000". While this seems to be empirically true _for the models examined in this paper_ (which, as I understand, are all trained on the same data, only varying the number of parameters), I have a hard time believing that 1000 is some kind of magic number that is applicable in all circumstances. I would be surprised if the relevant threshold wasn't dependent on other factors like the size of the training data and vocabulary. I think this claim should be softened to account for these unknowns.
tl;dr: the paper exhibits a severe case of the Curse of Knowledge (https://en.wikipedia.org/wiki/Curse_of_knowledge). Fortunately this can be fixed with better writing. I really think a rewrite is in order before it is published.