- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents a dibiase method for generative recommendation system, which focuses on the problem of overreliance on frequent token continuations that can drown out history-specific signals. The problem is quite an important one in modern LLM-based recommender system. UniGenRec proposes a simple yet effective factorization and training method. However, I still hold some concerns about the comparison with similar methods and its precise positioning.
Critical strengths
The paper and method are well motivated with clearly established research questions. The factorization is operationalized with a clean additive logit form where a learned gate can be easily applied. Overall, the proposed method is quite practical and easy to be applied.
Critical weaknesses
The logit additive training design and removing it at inference can be understood as the logit adjustment method, which is well learned in LLM token preference debias study. Specifically, the training objective is essentially Leanred-Mixin [1]. If the adaption from a general task to SID generation task is not trivial, the gap between should be more highlighted. [1] Don’t take the easy way out: Ensemble Based Methods for Avoiding Known Dataset Biases. EMNLP 2019. [1] also reports that the learned gate tends to collapse toward zero without an entropy penalty. What are the learned gate values across depths in UniGenRec, and does a similar collapse occur? On KuaiRec, uniform random retrieval gives roughly 1.5% R@50 (A uniform random ranker would achieve roughly 50/3,327 ≈ 1.5%), yet TIGER (1.34%) and MiniOneRec+Ghost (0.29%) fall below it. I am concerning they are relatively weaker baseline. Incorporating stronger methods can make the improvement impact of UniGenRec more convincing. Some latest SID/tokenizer works that address imbalance and prefix predictability through tokenization (for example ReSID GAOQ, CoST) should be discussed and compared. It is fine if authors think these works are not directly comparable if they can be well justified.
Questions for authors
Token-frequency bias is well studied in LLMs. What makes SID token preference fundamentally different, and why can’t these methods be applied with prefix conditioning? I am wondering what is the unique challenge here. How the hyperparameter is selected can be explicitly described. And it would be better to show the evolving pattern of the learned gate alpha value.
2 comments
W4 — Relationship to SID tokenizers
Some latest SID/tokenizer works that address imbalance and prefix predictability through tokenization (for example ReSID GAOQ, CoST) should be discussed and compared. It is fine if authors think these works are not directly comparable if they can be well justified.
Response
ReSID/GAOQ and CoST intervene at tokenization. They change which codes are assigned to catalog items, addressing properties such as code quality and prefix predictability. UniGenRec addresses a different question: given a SID mapping, how can we reduce the tendency of the retriever to internalize historical interaction imbalance during training? As discussed in Related Work, even balanced code assignments can yield imbalanced training targets when popular items contribute more interactions. Replacing the tokenizer changes the item groups, their legal continuations, and the interaction frequencies attached to them.
Q1 — What makes SID token-frequency bias different?
Token-frequency bias is well studied in LLMs. What makes SID token preference fundamentally different, and why can’t these methods be applied with prefix conditioning? I am wondering what is the unique challenge here.
Response
A next-code decision in SID retrieval selects which catalog items are still reachable. For example, choosing 42 after (7) keeps the items whose SIDs start with (7, 42). Choosing 42 after (3) keeps a different set. The first set might account for most of the training interactions among the choices after (7), while the second accounts for very few after (3). The same code can therefore inherit a popularity advantage in one decision and have little such advantage in another.
A frequency correction can be adapted to SID prefixes. Adding the prefix to the model input still leaves a global or depth-level frequency correction for 42 unchanged. The challenge is to redefine what is being counted. At each prefix, we use the catalog to find the valid next codes, sum earlier training interactions over every item each code can reach, and compare those counts among the valid choices. This matters most at early steps, where pruning one continuation drops every item behind it.
Q2 — Hyperparameter selection
How the hyperparameter is selected can be explicitly described.
Response
The gate is learned during training. Its sigmoid output lies in (0, 1), and we initialize it near 0.5, the midpoint of that range. The coefficient stays at 0.5 only in the fixed-gate ablation. For frequency estimation, we use add-one smoothing so that every legal continuation has a defined probability, including those with no earlier interactions. The remaining training settings are listed in the SFT and policy optimization appendices.
Q3 — Gate dynamics during training
And it would be better to show the evolving pattern of the learned gate alpha value.
Response
We tracked the mean gate value on MIND training routes at each of the four SID depths over the five epochs shown in Appendix Figure 4. All four curves start near 0.50, then follow different trajectories. The means at depths 2 and 3 rise to approximately 0.67 and 0.63, respectively. The mean at depth 4 rises slightly to 0.53, while that at depth 1 decreases slightly to 0.48. The curves flatten toward the end of the run. This shows that the frequency contribution evolves differently across depths. At all four depths, the mean gate value stays well above zero during training.
Thank you again for your constructive feedback. We hope these clarifications and the additional gate analysis address your concerns, and we would appreciate your taking them into consideration in your final assessment.
Dear Reviewer,
Thank you for your careful review of UniGenRec. Your questions about the training objective, the learned gates, and the comparison with alternative methods helped us clarify our design and present additional evidence on how the gates behave during training.
W1 — Learned-Mixin and the SID setting
Response
UniGenRec makes two design choices for SID generation.
W2 — Gate values and collapse
Response
The gate outputs α∈(0,1) at each SID depth; one scalar is shared by all legal next codes at that prefix. Each depth-specific gate is initialized near 0.5 using a zero output bias and small final-layer weights. The table reports epoch-2 mean ± standard deviation of α after teacher-forced routing over the full test split (three decimal places; not sigmoid(bias)). At the epoch-2 checkpoint, the mean gate value is well above zero at every depth on both datasets. One possible explanation is that the prefix-conditioned frequency estimate already captures an easy-to-fit part of the training signal. When the target code is more frequent than its alternatives, increasing the gate can directly raise its probability and reduce the training loss. Adjusting the gate gives the optimizer a simple way to fit this part of the signal and reduces how much of it the backbone needs to learn.
W3 — Baselines and random retrieval on KuaiRec
Response