- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes CoLaGR for generative recommendation. The method projects a frozen recommender's item preferences onto each SID level and uses them to supervise additional CP states before code prediction. After generation, CoLeaf combines generation scores with collaborative memory to rerank candidates. Experiments on three Amazon datasets show improvements over the compared methods.
Critical strengths
-
This paper examines how collaborative preferences are preserved during SID generation and provides a diagnostic measure for intermediate states.
-
Projecting item-level preferences onto SID levels provides a straightforward way to transfer collaborative knowledge. Separate preference and action heads accommodate the different supervision targets.
-
CoLeaf improves complete-item ranking with collaborative memory while preserving the generated candidate set.
-
The experiments show improvements across three datasets. The ablation studies help distinguish the contributions of collaborative supervision and final reranking.
Critical weaknesses
-
The additional CP tokens seem to offer limited benefit. Applying the same collaborative supervision directly to ordinary decoder states achieves similar results and sometimes performs better. It is unclear what the CP tokens add beyond the auxiliary supervision.
-
This paper shows that level-wise marginals cannot determine the joint item distribution. However, autoregressive models use prefix-conditioned probabilities. This result therefore does not establish that autoregressive path scoring itself loses information.
-
The collaborative-continuity analysis mainly uses ground-truth prefixes, whereas inference uses model-generated prefixes. Recovering more teacher preferences under correct prefixes does not establish that this advantage remains useful during actual decoding.
-
More efficiency analysis is needed to isolate the overhead of inserting a CP token before each SID token. How are the fixed CP positions handled during beam search?
Questions for authors
-
How do prefix-conditioned teacher targets compare with the proposed prefix-independent targets?
-
Does the reported training cost include teacher training and preference export?
10 comments
Preference Recovery under Generated Prefixes (Part 2/4)
W3: The collaborative-continuity analysis mainly uses ground-truth prefixes, whereas inference uses model-generated prefixes. Recovering more teacher preferences under correct prefixes does not establish that this advantage remains useful during actual decoding.
Response to W3: G's recovery advantage persists on the full beam-50 frontiers, including after earlier SID errors. We added the generated-prefix measurements to Section 4.7 / Table 3 (p. 9). G has lower L2/L3 recovery KL than Direct and Native-State on all three domains, under both own-generated prefixes and shared-prefix replay.
Across own-generated prefixes and shared-prefix replay, all 24 incorrect-prefix comparisons favor G, with every 95% interval for the KL reduction above zero. Tables 1(a)-1(b) report G's KL reductions relative to each control; positive values indicate lower recovery error for G, and brackets give 95% paired-history intervals. Own-prefix evaluation follows each model's generated branches, while shared replay holds earlier code choices fixed across models.
Table 1(a). G's KL reductions on own incorrect prefixes (higher is better; seed 2024; beam 50; extended readout fits).
| Domain / level | KL reduction vs. Direct ↑ | KL reduction vs. Native-State ↑ |
|---|---|---|
| Industrial L2 | ||
| Industrial L3 | ||
| Musical L2 | ||
| Musical L3 | ||
| Video Games L2 | ||
| Video Games L3 |
Table 1(b). G's KL reductions on shared incorrect-prefix replay (higher is better; seed 2024; beam 50; extended readout fits).
| Domain / level | KL reduction vs. Direct ↑ | KL reduction vs. Native-State ↑ |
|---|---|---|
| Industrial L2 | ||
| Industrial L3 | ||
| Musical L2 | ||
| Musical L3 | ||
| Video Games L2 | ||
| Video Games L3 |
Readouts fit observed-prefix training states, use validation selection with a 400-epoch cap, and are evaluated unchanged on the frozen generators' generated states; intervals use 2,000 paired-history bootstrap draws. Appendix E.1 (pp. 32-33) gives the protocol and complete prefix-group results.
Reasoning Efficiency and Beam Handling (Part 3/4)
W4: More efficiency analysis is needed to isolate the overhead of inserting a CP token before each SID token. How are the fixed CP positions handled during beam search?
Response to W4: CoLaGR uses three fixed, non-verbal CP steps instead of generating a textual reasoning chain. Explicit chain-of-thought (CoT) verbalizes intermediate reasoning token by token [3], whereas CoLaGR inserts one prescribed CP position before each SID level. Each beam advances through that position without branching or adding a probability term; only the following SID choice expands the beam and contributes to its score. This fixes the intermediate-computation budget at three steps per path and avoids decoding a free-form rationale. Neither the teacher nor the preference heads is required at inference.
Comparing CP with NoCP yields 1.57%/1.83% higher training microstep time and 15.88%/15.35% higher beam-generation time on Industrial/Musical (Table 2). Measurements use synchronized RTX-5090 timing after warmup in exclusive-computation windows; both training cases include action and preference losses. Training and decoding batches are 256 and 128, respectively, with beam 50. Industrial compares trained Native-State and CP checkpoints, while Musical toggles CP on the same frozen weights as a runtime control. Appendix E.3 / Table E.3 (p. 33) gives the full timing protocol.
Table 2. Isolated CP overhead on Industrial and Musical (seed 2024; RTX 5090).
| Domain | Variant | Training (ms/step) | Increase | Decoding (ms/1,024 histories) | Increase |
|---|---|---|---|---|---|
| Industrial | NoCP | reference | reference | ||
| Industrial | CP | ||||
| Musical | NoCP | reference | reference | ||
| Musical | CP |
References
[3] Hao et al. (2025). Training Large Language Models to Reason in a Continuous Latent Space. COLM 2025.
Collaborative Grounding and Joint Item Scoring (Part 1/4)
Dear Reviewer Bxaz,
Thank you for recognizing our diagnostic, separate preference/action supervision and candidate-preserving calibration. We have added generated-prefix experiments, isolated CP timing and conditional-target comparisons.
W1: The additional CP tokens seem to offer limited benefit. Applying the same collaborative supervision directly to ordinary decoder states achieves similar results and sometimes performs better. It is unclear what the CP tokens add beyond the auxiliary supervision.
Response to W1: The main benefit is user-matched collaborative supervision through separate readouts; CP provides a dedicated pre-action interface. Section 4.8 / Table 4 (p. 10) changes over 99.7% of within-SID reference matches while holding architecture, action labels, objective and the reference multiset fixed. Shuffling lowers NDCG@10 by 9.5%/11.0%/5.3%, showing the value of user-reference correspondence. Validation-tuned Direct gives a complementary comparison: G improves three-seed mean NDCG@10 by 4.80%/3.07% on Industrial/Musical before CoLeaf, with some per-seed intervals spanning zero (Appendix E.2, pp. 32-33).
S2GR supervises interleaved thinking states with cluster semantics [1]; CoLaGR reconstructs the user's collaborative reference through a separate preference head. Native-State implements this grounding at existing states and is competitive, including a calibrated lead on Industrial (Tables C.8 and C.23, pp. 23 and 32). CP supplies a uniform position for this decision-aligned computation rather than making auxiliary supervision exclusive to inserted tokens.
W2: This paper shows that level-wise marginals cannot determine the joint item distribution. However, autoregressive models use prefix-conditioned probabilities. This result therefore does not establish that autoregressive path scoring itself loses information.
Response to W2: AR joint expressiveness and collaborative supervision are different questions. AR conditionals can represent joint distributions; Proposition 1 establishes that collaborative marginals alone leave item order underdetermined. We clarify this distinction in the revised manuscript and Appendix A.6 (pp. 16-17).
The complete-item evidence is empirical. Tables C.21-C.22 (p. 31) fix candidates, AR scores, the memory-score multiset and Recall@50; matched memory improves ranking and shuffling the item-memory correspondence removes the gain. MemGen-GR likewise studies complementary generative/conventional scores [2], while our control isolates item-specific transition memory on the same generated candidates. These results establish CoLeaf's ranking benefit alongside AR scores, rather than asserting that AR factorization cannot express the joint distribution.
References
[1] Guo et al. (2026). S2GR: Stepwise Semantic-Guided Reasoning in Latent Space for Generative Recommendation. KDD 2026.
[2] Ding et al. (2026). On the Memorization and Generalization of Generative Recommendation. KDD 2026.