Summary
This paper proposes a hypothesis that there exists a universal and crucial discrete set of computations (quanta) for reducing loss in various prediction problems, and the model's performance is determined by successfully learning these computations. Through this hypothesis, it demonstrates the relationship between power law neural scaling and the effective learning of more quanta, which cannot be solved solely by the memorization ability of the existing model, particularly in complex problems. Additionally, the paper proposes "Quanta Discovery from Gradients" as a method to auto-discover quanta.
Strengths
1. Based on the assumption that there exists a discrete set of computations, known as "quanta," which determines the performance of the model, the paper provides hints for understanding the emergent behavior observed in the scaling law of the model.
2. The objective of the study is to interpret power law scaling and emergent behavior phenomena by using a multitask sparse parity dataset that cannot be solved solely by the model's memorization ability.
3. Through experiments conducted on the multitask sparse parity dataset, the paper shows that when the frequency of using quanta follows a power law distribution, power law neural scaling can occur as the model learns more quanta.
Weaknesses
1. The paper lacks a clear definition of quanta, which could benefit from further elaboration and clarification.
2. Insufficient explanation is provided regarding the criteria used to determine quanta through the Quanta Discovery from Gradients (QDG) method.
3. Extending the experiments on the Quantization Hypotheses, using the proposed toy dataset, to Language Models (LLM) is hindered by the lack of clarity regarding the relationship between LLM tokens and quanta.
4. Section 5 claims that "Clustering based on inputs or outputs therefore seems unlikely to discover quanta in language modeling," but lacks substantial empirical evidence to support this statement.
5. The explanation concerning the relationship between quanta and gradients, which forms the basis for determining quanta in the QDG method, needs to be further developed and elaborated upon.
Questions
1. In Figure 1, what decoding method was used for the auto-discovered quanta?
2. The experiments on the toy dataset appear to be influenced by the decoding algorithm (such as greedy, beam search, random). Is there any consideration given to this aspect?
3. In Figure 4, what is the relationship between the highlighted red section in the prompt and each graph?
4. In Section 5, it would be beneficial to include details about the dimensional of the gradients used in the Quanta Discovery from Gradients (QDG) method. The absence of explicit notation indicating the shape of each symbol for explaining QDG makes it challenging to ascertain the computational complexity involved in implementing QDG.
Rating
5: Borderline accept: Technically solid paper where reasons to accept outweigh reasons to reject, e.g., limited evaluation. Please use sparingly.
Confidence
4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.
Limitations
There is a need to demonstrate the effectiveness of the proposed Quanta Discovery from Gradients (QDG) method in identifying quanta in various Language Models (LLM) and datasets.