- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper is about how the number of targets from each user history affects training efficiency in sequential recommendation. It proposes a supervision-density scaling law and an allocation rule based on gradient variance and computational cost. The authors also introduce Exact Prefix-Loss Compilation (EPC), which shares computation across prefix losses.
Critical strengths
a) The paper addresses a useful training-efficiency problem. b) The experiments are extensive, covering multiple backbones and datasets with five seeds.
Critical weaknesses
a) The paper is poorly written, making it difficult for a human reviewer to follow the logic. For example, the introduction does not develop the motivation, research gap, and connections between the main contributions. Technical details and numerical results are introduced before the underlying ideas are explained. This leaves readers to reconstruct the argument themselves. b) The novelty of certain components needs clearer justification. For example, the scaling law (Equation (5)) is similar to the relation in An Empirical Model of Large-Batch Training (McCandlish et al., 2018). Both describe how the required training steps decrease towards a fixed offset as more targets are included per update. The authors should clarify what their formulation adds beyond this existing relation. c) The claimed optimal compute allocation is insufficiently validated. Equation (10) predicts which density should perform best within a specified training-time budget. However, this fixed-budget prediction has not been empirically validated. The comparisons in Table 1 and Figure 4 show useful speed–quality trade-offs, but do not establish whether it selects the best density under the same compute budget.
Questions for authors
Please refer to the weaknesses.