- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies the role of hierarchical Semantic ID (SID) levels in LLM-based generative recommendation. It finds that early SID tokens carry more semantic and behavior-relevant information, then proposes Critical-Branch Direct Preference Optimization (CB-DPO). For each chosen/rejected SID pair, CB-DPO applies preference supervision at the first position where the two sequences diverge, rather than optimizing the preference margin over the entire sequence. It also adds a next-token prediction (NTP) regularizer to mitigate entropy collapse. The method is evaluated with Qwen3 and TIGER on KuaiRec and KuaiRand-1K.
Critical strengths
- The motivation is clear. In autoregressive SID generation, an early token determines the prefix on which all later predictions are conditioned. Focusing preference supervision on the first divergent decision is therefore well motivated.
- The paper offers useful diagnostic analyses. It examines SID-level performance and tests semantic and behavioral information by perturbing SID levels and removing suffix tokens from histories.
- The method is simple and directly targeted. CB-DPO isolates the preference margin at the shared-prefix branching point, while NTP regularization is intended to preserve chosen-sequence likelihood and mitigate entropy collapse.
- The evaluation spans both LLM-based and LLM-free recommenders. Improvements on TIGER suggest that the proposed preference objective may apply beyond pretrained LLMs.
Critical weaknesses
-
The early-level finding may depend on the SID construction. The analysis uses RQ-VAE hierarchical SIDs, whose residual-quantization process naturally assigns coarse information to early levels and refinements to later ones. The paper does not establish whether the same asymmetry holds with other tokenizers or SID constructions.
-
The theoretical guarantee does not cover the complete CB-DPO objective as written. The first-order increase in the critical margin is derived for the critical-branch preference term. The full objective also includes an NTP regularizer, whose gradient is not included in that derivation. Thus, the theorem alone does not guarantee that each update of the combined objective increases the critical margin.
-
The empirical gains vary substantially by dataset. Improvements are modest on KuaiRec—for Qwen3, Hit@10 decreases slightly—while gains are much larger on KuaiRand-1K. This suggests that performance may depend strongly on the quality of the constructed preference pairs and the availability of explicit feedback.
-
The independent contribution of NTP regularization is not fully established. The paper shows that NTP stabilizes chosen-token scores and reduces entropy collapse, but it provides limited evidence about its separate effect on final recommendation quality.
Questions for authors
Please refer to Weaknesses.
Author- Reviewer Discussion
Dear Reviewers, the authors have submitted their response. Kindly review it and update your review where appropriate.