- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
In generative recommendation, semantic IDs and collaborative IDs encode item content and interaction patterns, respectively. Each identifier chain has an internal order, but there is no natural order between the two chains; autoregressive generation nevertheless requires a total order. LatticeRec treats the cross-chain interleaving as a latent variable. It represents partial generations by canonical states defined by the revealed prefixes of both chains, merges paths that reach the same state, and marginalizes over valid orders using dynamic programming. Coverage regularization is added to prevent training from focusing on only a few paths. The paper reports improvements on three datasets.
Critical strengths
- The motivation is clear and well grounded. The method directly addresses the structural mismatch between two internally ordered but mutually unordered identifier chains and the total order required by autoregressive generation.
- Canonical states provide a simple, effective core idea. Paths that reveal the same prefixes in both chains share a predictive state. Dynamic programming can then aggregate their probability mass over a lattice rather than enumerate every complete interleaving.
- Coverage regularization targets a specific training issue. Marginal likelihood can let a few high-posterior paths dominate the gradients. The proposed regularizer maintains supervision for other valid interleavings.
Critical weaknesses
-
Exactness relies on a key modeling assumption. Path merging is valid because the model is designed so that the next-step prediction depends only on the revealed prefixes, not on the order in which they were generated. Thus, dynamic programming is exact for the model defined by LatticeRec, but it is not a lossless reduction for a general path-dependent autoregressive model. The paper should better justify why cross-chain arrival order is irrelevant and discuss the resulting expressivity tradeoff.
-
The evidence that marginalization is better than a strong fixed order is incomplete. The paper shows that performance varies across fixed serializations, but the direct comparison with the best fixed order is mainly reported on Games. The results support the claim that serialization choice can matter, but do not establish that marginalization consistently outperforms a well-selected fixed order across datasets.
-
Uniform path coverage introduces an additional prior. The regularizer uses a uniform reference distribution to prevent the posterior from concentrating on a few paths. This addresses training coverage, but also encourages every valid interleaving to receive some weight. The paper could better explain when this uniformity is appropriate and when it might conflict with useful order preferences in the data.
-
The guarantees for training and inference should be distinguished more clearly. The lattice dynamic program exactly aggregates valid paths during training. At inference, beam search prunes states, so only the retained paths are aggregated exactly; overall inference is approximate. The paper should emphasize this distinction and analyze how beam search affects the main results.
Questions for authors
Please refer to Weaknesses.
4 comments
W3: Uniform Coverage and Order Preferences
Coverage regularization introduces a uniform supervision bias, but does not assume that all generation orders should be equally probable. Since no cross-view order is given in the training data, its purpose is to prevent potentially useful paths from being overlooked due to insufficient supervision. Our analysis of premature path lock-in in Reviewer 1's W3/Q3 further motivates this design.
Importantly, even a small amount of uniform supervision can provide substantial benefits. Figure 4 shows that increasing λ from 0 to 0.2 improves both Effective Paths and NDCG@10 across all three datasets, while larger λ does not always yield further gains.
The key is balancing path coverage with learned order preferences. Uniform coverage is useful when alternative paths have not been adequately explored, but excessive coverage may weaken the learning signal from more informative orders. Our experiments reflect this trade-off: Instruments2018 and Steam perform best at λ=0.8 and λ=0.6, respectively, rather than λ=1, whereas Instruments and Games favor stronger coverage (Effect of coverage weight on NDCG@10). These results suggest that the appropriate coverage strength depends on the balance between supervising alternative paths and learning meaningful order preferences.
W4: Exact Marginalization in Training and Beam Approximation at Inference
We clarify the distinction between training and inference. During training, under the path-invariance assumption (Eq. 10), DP exactly marginalizes over all valid generation paths for each target item without explicit enumeration. At inference, State-Merged Beam Search exactly aggregates the probabilities of surviving paths, but pruning discards some probability mass, making the overall inference approximate.
To quantify this approximation, we rescore the beam-retrieved candidates using exact marginalization on all three datasets, keeping the candidate set fixed. We report Mass Retention (the ratio of beam-aggregated to exact marginal probability, summarized by median/P10 across candidates) and Overlap@10 (the average proportion of shared items between the two top-10 lists).
| Dataset | Mass Retention (Median/P10) | Overlap@10 | Beam N@10 | Exact N@10 |
|---|---|---|---|---|
| Instruments | 68.91% / 33.14% | 99.11% | 0.03395 | 0.03392 |
| Games | 73.87% / 35.13% | 99.39% | 0.05358 | 0.05354 |
| Steam | 72.53% / 35.98% | 99.36% | 0.05439 | 0.05438 |
Although beam pruning loses substantial probability mass (median retention: 68.91%–73.87%), its impact on recommendation rankings is small. Top-10 overlap exceeds 99% across all three datasets, with absolute NDCG@10 differences of at most 0.00004. Thus, while beam search does not recover exact item marginals, its rankings closely match exact rescoring within the same candidate set.
Thank you for the detailed response and clarifications. After considering your response, I will keep my original rating.
Thank you for your encouraging assessment and valuable feedback. We truly appreciate the time and care you have devoted to reviewing our work.
Sincerely,
The Authors
We sincerely appreciate the reviewer for spending valuable time in reviewing our paper and providing detailed comments. We hope that our response below will address your concerns.
We consider path invariance a reasonable inductive bias for multi-view ID generation. Semantic and collaborative IDs are quantized separately, each with a fixed internal order, but no cross-view generation order is given in the data. We therefore let the model predict from the revealed prefixes of both views, rather than additionally conditioning on the order in which they were revealed.
Importantly, this does not eliminate generation-order preferences. For example, paths ρA=(s1,c1) and ρB=(c1,s1) reach the same canonical state σ1,1. Their path probabilities can differ; only their subsequent predictive distributions are shared:
=p_\theta(\mu,z\mid x,\rho_B) =p_\theta(\mu,z\mid x,\sigma_{1,1}).$$ The model can therefore still learn different path preferences, as illustrated in Figure 5. We acknowledge the expressivity tradeoff: unlike a fully path-dependent autoregressive model, LatticeRec cannot distinguish the future predictions of paths reaching the same canonical state. However, since the data do not specify a cross-view generation order, we consider predicting from the revealed information a reasonable inductive bias. This reduces unnecessary modeling freedom by avoiding separate continuation functions for the same revealed prefixes, potentially improving generalization. It also enables exact marginalization within our model through DP without enumerating all valid paths. Our state-sharing ablation further supports this design, showing better recommendation performance under the evaluated settings. > W2: Comparison with the Best Fixed Order Across Datasets To address the limited cross-dataset evidence, we extended the comparison of all 20 fixed generation orders to Instruments and Steam, and repeated Games with two additional random seeds. All results are NDCG@10. Best-Fixed is selected based on validation performance, while Fixed-Avg reports the average test performance across the 20 fixed-order models. |Dataset|Best Order|Fixed-Avg|Best-Fixed|LatticeRec| |:-:|:-:|:-:|:-:|:-:| |Instruments|CSSCCS|0.0293|0.0332|**0.0339**| |Games (seed 42)|SCSCCS|0.0521|0.0533|**0.0536**| |Games (seed 43)|SCSSCC|0.0517|0.0533|**0.0539**| |Games (seed 44)|SSCSCC|0.0521|0.0536|**0.0541**| |Steam|CSCSCS|0.0527|0.0538|**0.0544**| [Games, seed 42](https://anonymous.4open.science/r/rebuttal_image-3E4F/rebuttal_image/games_seed42.png) · [Games, seed 43](https://anonymous.4open.science/r/rebuttal_image-3E4F/rebuttal_image/Games%20seed%2043.png) · [Games, seed 44](https://anonymous.4open.science/r/rebuttal_image-3E4F/rebuttal_image/games%20seed%2044.png) [Instruments, NDCG@10](https://anonymous.4open.science/r/rebuttal_image-3E4F/rebuttal_image/instruments_ndcg10.png) · [Instruments, Recall@10](https://anonymous.4open.science/r/rebuttal_image-3E4F/rebuttal_image/instruments_R10.png) [Steam, NDCG@10](https://anonymous.4open.science/r/rebuttal_image-3E4F/rebuttal_image/steam_ndcg10.png) · [Steam, Recall@10](https://anonymous.4open.science/r/rebuttal_image-3E4F/rebuttal_image/steam_recall10.png) LatticeRec outperforms Best-Fixed on all three datasets and across all three seeds on Games. Notably, the best fixed order varies across datasets and even across random seeds within Games, making it difficult to identify a suitable order in advance. Moreover, finding Best-Fixed requires training and selecting among 20 fixed-order models, whereas LatticeRec learns across generation orders within a single model. These results provide direct cross-dataset evidence that order marginalization can outperform a well-selected fixed order without requiring an expensive search over generation orders.