Summary
This paper proposes Quiet-STaR, which trains the model to generate (pseudo-)internal thoughts for predicting every token on the general language modeling task.
Despite the absence of finetuning on downstream tasks/datasets, the model trained by Quiet-StaR achieves significantly better performance on two reasoning datasets (GSM8K and CommonsenseQA) than the baseline model does.
Reasons to accept
+ I personally believe the general topic of “generating internal thought” is worth researching and this work is a great effort under this topic. Compared to previous works, the proposed method itself is technically good.
+ Quiet-STaR doesn’t rely on randomness (e.g., Goyal et al. (2023) insert pseudo tokens at random locations).
+ It is also used in an unsupervised fashion (e.g., unlike Deng et al. (2023), Quiet-STar doesn’t need any external supervision of the internal thoughts or even its locations) so it is quite scalable.
+ Quiet-STaR is very effective given the significant performance improvement on downstream reasoning tasks despite the model not training on the downstream tasks.
+ It is great to show the generated internal thoughts may contain meaningful reasoning. This indicates that Quiet-STaR does some effective and could-be-interpretable learning. I also would be happy to see more research on that in the future, and it may contribute to some interpretability research.
+ The analysis of improvement distribution is insightful. It is great to empirically show that some tokens need more computation than others do, a hypothesis that is mentioned by many works on “adaptive computation” (I personally still love to see some strong empirical evidence tho it is quite intuitively reasonable).
### Reference
Yuntian Deng, Kiran Prasad, Roland Fernandez, Paul Smolensky, Vishrav Chaudhary, and Stuart Shieber. Implicit chain of thought reasoning via knowledge distillation. *arXiv preprint arXiv:2311.01460, 2023.*
Sachin Goyal, Ziwei Ji, Ankit Singh Rawat, Aditya Krishna Menon, Sanjiv Kumar, and Vaishnavh Nagarajan. Think before you speak: Training language models with pause tokens. *arXiv preprint arXiv:2310.02226, 2023.*
Reasons to reject
+ As Quiet-STaR incurs significant extra computation overhead, would it be possible to achieve similar performance by spending the extra computation on scaling up the model size & training data (or even just use a larger model during the inference, noting that the extra overhead during inference is also significant)? It is okay even if the answer is YES as I think this work’s value is more about performance improvement, but now the paper lacks such an analysis.
+ [**Not a major concern and could be regarded as a discussion on future work**] I doubt the argument that `We expect that this is a more difficult task, as predicting the usefulness of a thought is simpler when one has already generated the thought`, which was used to justify Quiet-STaR generating many tokens before generating **every** additional token.
+ Some other works on “adaptive computation (i.e., the model spending different computations on different tokens)” succeed in doing this kind of computation prediction ahead of the real computation. For example, Raposo et al. (2024) predicted whether a token needs to pass a layer or not ahead (tho this work doesn't use the technique of pseudo-tokens/internal thought, it is still about computation allocation so I mention it here).
+ Also, thinking about humans' thinking process, we are able to recognize some tokens (e.g., the result of an addition problem) are more difficult than others (e.g., I am sing-*ing*).
+ [**Not a major concern**] I am curious about how the internal thoughts (for difficult tokens) are changed during the training process. Intuitively, the generated thought may make little sense at the beginning, and finally, it can contain some meaningful reasoning as the paper has already shown. This analysis of training dynamics could provide insights into how the REINFORCE loss term works.
### Reference
David Raposo, Sam Ritter, Blake Richards, Timothy Lillicrap, Peter Conway Humphreys, and Adam Santoro. Mixture-of-Depths: Dynamically allocating compute in transformer-based language models. *arXiv preprint arXiv:2404.02258, 2024.*