- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper addresses the reasoning problem in generative recommenders, with a particular focus on lightweight and efficient methods. The paper proposes COIN, which defines collaborative intent as the reasoning language for native generative recommenders and trains a lightweight causal Transformer to predict intents from interaction histories. It then amortizes the planning capability into the native recommender. Experiments on multiple datasets demonstrate the effectiveness and efficiency of this approach.
Critical strengths
- The experiments are comprehensive, comparing the proposed method with multiple baselines across multiple datasets, thereby demonstrating its effectiveness and efficiency.
- This paper provides clear theoretical justification and discussion that explain the rationale and principles behind the proposed method, thereby contributing to its interpretation and credibility.
Critical weaknesses
- The design principles and novelty of some technologies require further clarification.
- The conclusions of some experiments are insufficient to support the authors' claims.
Questions for authors
- COIN divides items into different clusters based on co-occurrence, then trains a model to predict collaborative intent based on user history. However, this process is essentially very similar to first predicting coarse-grained product categories and then predicting specific products. The paper does not adequately explain why this intermediate step can be defined as reasoning or how it differs from traditional intent prediction.
- Figure 5 shows that Native GR has learned some of the Teacher’s preferences, but the consistency is not high. More than 20% of the plans do not even appear in the Teacher’s top 10, so the authors need to explain this phenomenon.
- Even when there is a significant discrepancy between the plans predicted by Native GR and Teacher, Figure 5(b) shows that the recommendation results are virtually unaffected. Does this suggest that the choice of intent has virtually no effect on GR’s predictions?
- Furthermore, the author should show the model’s performance when the native plan is among the top 1, top 10, and outside the top 10 of the Teacher’s top 10 set.
- Native GR's planning capability stems entirely from the Teacher's ambiguity-aware transfer, but the authors did not report the accuracy of the Teacher's predicted plans relative to the true intents.
- The Introduction should include an example or figure illustrating the COIN design—for example, showing what collaborative intent is and how it relates to recommended items—which would make the motivation easier to understand.
11 comments
Response to Reviewer e1qh (2/5)
W1 & Q1 (continued).
Why this is reasoning. Reasoning derives an intermediate conclusion from the available evidence and uses it to guide the answer: the conclusion is about the input, the model forms it itself, and it shapes what the model concludes next. Chain-of-thought [1] and plan-and-solve prompting [2] follow this pattern in LLMs. COIN's plan token plays exactly this role: it is formed from the history, about where the user's next interaction is heading; the model generates it at inference; and the item is then generated conditioned on it, so a different plan leads to a different recommendation. Prior work in reasoning-enhanced recommendation follows the same paradigm: OneRec-Think [3], GREAM [4], and SIDReasoner [5] first generate an explicit reasoning trace about the user's history and then generate the item.
How COIN differs from coarse-to-fine prediction. Coarse-to-fine prediction, such as predicting an item's category or a coarse prefix of its code before the item, also produces an intermediate token, but that token plays a different role. It is a property of the next item: it splits the prediction into stages rather than forming a conclusion about the user. COIN's plan is instead a function of the history. It summarizes the evidence in the history, expresses it with a token in the collaborative intent space, and keeps several plausible directions open when the history is ambiguous. During training, COIN learns the intermediate step from its teacher: the training targets represent the "rationale" predictable from the history, rather than part of the answer. The following experiment makes this difference concrete.
Experiment: supervising the plan with the next item's cluster (new, App. B.2.3, Table 6)
To test coarse-to-fine supervision directly, we supervise the plan token with the collaborative cluster of the observed next item. At inference, the model generates the cluster token by beam search, like the subsequent SID tokens. As a diagnostic, we also feed the same checkpoints the true cluster in place of their prediction; this leaks target information and is unavailable in practice. The following table compares these models with COIN by Recall@10 (%):
| Plan supervision | Beauty | Toys | Sports |
|---|---|---|---|
| No plan token (baseline) | 6.24 | 5.84 | 3.42 |
| Next-item cluster (predicted cluster) | 6.47 | 5.86 | 3.25 |
| Next-item cluster (true cluster, diagnostic only) | 59.03 | 56.63 | 50.93 |
| COIN (teacher distribution) | 7.23 | 7.13 | 4.07 |
Target-cluster supervision shifts the bottleneck instead of easing it. The table above shows two versions of target-cluster supervision: when fed the true next-item cluster at inference, the model achieves very high ranking accuracy, whereas with its own predicted cluster, it stays close to the baseline and well below COIN. This is because the target cluster is a function of the next item: although accurate by construction, it is hard to predict from the history. Trained with the true next-item cluster as the plan token, the decoder learns to rely on it: the model succeeds when it is given the correct plan, whereas an early error in the plan rules out the correct item. Thus, supervising the plan with the target cluster does not make next-item prediction easier; it only moves the difficulty to the plan token.
COIN avoids this bottleneck in two ways. Its plan distribution is a function of the observed history, so the planning head can learn to match it (Theorem 1). Its decoder is trained under alternative plans that share the same target, so recommendation does not hinge on a single "correct" plan (Theorem 3).
Response to Reviewer e1qh (3/5)
Q2. Why do many native plans fall outside the teacher's top 10?
We thank the reviewer for this question. The partial agreement between the teacher and student has two causes, both expected under COIN's design.
1. The two planners read the history through different inputs, by design. The teacher encodes the history with freely learned item-ID embeddings from interactions, while the student encodes it with semantic IDs built from item content. The teacher is useful only when it carries distinctions the student does not already represent, so we chose this heterogeneity deliberately (Sec. 3.1). App. B.1.2 compares two kinds of teachers: one with ID embeddings and one with semantic embeddings. To measure the recoverability of the teacher's forecasts from the student model, we fit a linear probe from the baseline generator to the teacher's outputs. The following table reports the normalized probe error (Fig. 8(a); higher means less recoverable):
| Teacher input | Beauty | Toys | Sports |
|---|---|---|---|
| Item-ID embeddings (COIN) | 0.633 | 0.636 | 0.439 |
| Semantic embeddings | 0.325 | 0.357 | 0.206 |
We then train a student with each teacher. The following table reports the student's Recall@10 (%) at matched entropy levels (η = 0.10 / 0.25 / 0.40):
| Teacher input | Beauty | Toys | Sports |
|---|---|---|---|
| Item-ID embeddings (COIN) | 6.92 / 7.03 / 6.78 | 7.29 / 7.46 / 6.85 | 4.08 / 3.98 / 3.95 |
| Semantic embeddings | 6.71 / 6.75 / 6.71 | 6.14 / 6.23 / 6.52 | 3.54 / 3.50 / 3.52 |
The ID-embedding teacher's forecasts are much harder to recover from the student's representation, and they also yield a better student at every matched entropy level. This suggests that the two planners process a history in genuinely different ways. This is what makes the teacher useful, and it also limits the recoverability of the teacher's plan from the student.
2. Some histories are inherently difficult. For a history with weak or mixed evidence, the teacher's forecast is diffuse, spreading its probability over many intents. Since COIN learns from plans sampled from this forecast, the student never sees a stable target for such histories. As a result, its prediction can land on many intent regions, even outside the teacher's top 10. Q3 & Q4 show that the teacher-student disagreements concentrate on such histories.
Response to Reviewer e1qh (1/5)
We sincerely thank the reviewer for taking the time to review our work. We appreciate the reviewer’s recognition of the broad effectiveness and theoretical justification of our work, as well as their thoughtful comments and insightful questions. We address each concern below.
Revised PDF. We have updated the paper with the analyses the reviewer asked for; all changes are in blue. App. B.1.1 reports the teacher's accuracy against the true intents (Table 4). App. B.2.3 adds a coarse-to-fine control that supervises the plan with the next item's cluster (Table 6). App. B.3.2–B.3.3 add an intervention on the executed plan (Fig. 13) and a breakdown of ranking by native–teacher agreement (Fig. 14). Several of these results are easier to read as figures, so we encourage the reviewer to look at the revised PDF. We have also tried to make this response self-contained, with the key numbers in the tables below.
Design principle and novelty. Our work asks one question: How can native generative recommenders (GRs) reason without natural language? LLM-based GRs reason in language: they first write a rationale about what the user's history suggests, then predict the next item. Native GRs are directly trained on interaction data and lack such ability. Prior methods adopt different ways to fill the gap: LLM-assisted methods compress LLM rationales into reason tokens or embeddings, so their reasoning still comes from natural language; latent-reasoning methods learn thinking tokens with no predefined meaning, typically using RL to activate their specific roles. They can be effective, but typically incur heavy costs and high system complexity stemming from specialized training and inference pipelines.
COIN instead explores a novel reasoning language, specialized for recommendation: the collaborative intent space, where each intent token favors a specific direction of item generation. The vocabulary gains its meaning through item co-occurrence, which provides heterogeneous task information that semantic IDs lack. Given a history, COIN first infers an intent token, a compact conclusion about which group of frequently co-engaged items the user is heading toward, and then generates the next item conditioned on it, just as an LLM writes a rationale before answering. COIN injects such ability through a lightweight intent teacher and trains the generator model through plain next-token prediction, with no LLM calls, RL rollouts, or extra model passes. At inference, COIN injects only ONE extra token before the generated item, adding negligible cost. We demonstrate the effectiveness of our recipe through broad evaluation with multiple tokenizers and architectures, showing significant ranking improvements with little computational overhead. This makes COIN a simple-yet-effective plug-in for the native GR family, and it opens a new direction for reasoning in recommendation beyond natural language.
W1 & Q1. Why the plan is reasoning, and how it differs from coarse-to-fine prediction (revised Sec. 3.2)
We thank the reviewer for this question. To answer it, we first revisit the two complementary roles of COIN, which we have made clearer in the revised Sec. 3.2.