- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes MaLaCo, a semantic-ID-based generative recommendation framework that separates history encoding from item-ID generation. A bidirectional Transformer completes a masked next-item latent representation in a single pass, and a small autoregressive head performs trie-constrained SID decoding, confining beam-dependent computation to the head. The paper also introduces a collision-aware SID construction pipeline and a procedure for adding items while preserving existing identifiers. Experiments on four Amazon datasets report improved Recall@k over LLaDA-Rec at all reported cutoffs k >= 10, with a trade-off in Recall@1 on three datasets. At beam width 50 on an A100, the reported speedup is 24.9x for amortized generation cost at batch size 20 and 2.4x for single-request latency. Additional validation includes a four-seed architecture–encoder comparison, collision measurements, and an item-arrival experiment in which catalog expansion preserves existing IDs and approaches the recall of full vocabulary refitting after recommender retraining.
Critical strengths
-
The paper reflects a substantial amount of implementation and experimental work.
-
It provides extensive implementation details, explanations, and hyperparameter configurations.
Critical weaknesses
-
Limited novelty. The core implementation is a systematic combination of masked item modeling, continuous item representations, autoregressive SID generation, trie-constrained beam search, contrastive learning, residual quantization, and collision reduction. I recognize the engineering complexity involved in integrating these components in an industrial setting. However, as an academic contribution, the work lacks a clear central insight that could be broadly useful to the research community. Components such as trie-constrained decoding, collision handling, and residual processing have already appeared in prior work such as OneRec. Although this paper is developed primarily in relation to LLaDA-Rec, I do not find the underlying techniques fundamentally different. Combining so many components also makes it difficult to attribute the reported gains to the central contribution.
-
A clear trade-off in recommendation quality. The authors acknowledge that MaLaCo generally underperforms LLaDA-Rec on Recall@1, while its advantages mainly emerge as increases. This suggests that the method improves coverage deeper in the candidate list but is less effective at placing the most relevant item first. In other words, MaLaCo improves recall at larger cutoffs at the cost of top-ranked accuracy. This appears to require a larger beam size to obtain the reported accuracy, raising questions about how this requirement interacts with the claimed inference-cost advantage.
-
Poor readability. The paper introduces too many concepts at once and moves quickly into equations and multiple technical branches without first presenting a concrete example of the complete inference process. In particular, SID construction contains four stages, but their relationship to recommender training is explained in a fragmented manner.
Questions for authors
Please refer to the weaknesses part.
4 comments
Part 2
Does the accuracy require a large beam? We re-decoded our trained checkpoints at beam 5–100 (Scientific and Instrument, four seeds, full test set), and LLaDA-Rec's App. F checkpoint at beam 10 and 20. Each entry is the fraction of that model's own beam-50 value retained:
| Beam | MaLaCo R@1, Sci / Inst | MaLaCo R@10, Sci / Inst | LLaDA-Rec R@1, Sci | LLaDA-Rec R@10, Sci |
|---|---|---|---|---|
| 5 | 98% / 97% | – | – | – |
| 10 | 100% / 100% | 92.5% / 89.6% | 99% | 90.3% |
| 20 | 100% / 100% | 98.4% / 97.9% | 100% | 98.4% |
| 100 | 100% / 100% | 100.3% / 100.2% | – | – |
- R@1 does not depend on the beam. It is unchanged from beam 10 to 100 for MaLaCo and from beam 10 to 50 for LLaDA-Rec. The R@1 gap therefore does not come from the beam width, and a wider beam neither causes nor closes it.
- MaLaCo does not need a wider beam than LLaDA-Rec. Both lose almost the same fraction of R@10 at beam 10 and 20, and MaLaCo gains nothing beyond beam 50.
How beam width interacts with cost. This is where the design pays off. Beam width multiplies LLaDA-Rec's whole backbone, but only MaLaCo's small head. Per query, batch 20, Scientific:
| Beam | MaLaCo (App. F) | LLaDA-Rec | Ratio |
|---|---|---|---|
| 10 | 0.503 ms | 2.84 ms | 5.6× |
| 20 | 0.498 ms | 5.41 ms | 10.9× |
| 50 | 0.526 ms | 13.10 ms (App. F) | 24.9× |
- MaLaCo's cost is flat in beam width (+5% from beam 10 to 50), while LLaDA-Rec's grows 4.6× and its peak memory from 626 to 3,013 MiB.
- MaLaCo at beam 50 costs less than LLaDA-Rec at beam 10 (0.526 vs 2.84 ms). At beam 50 it is also more accurate at R@10 and R@50 on all four datasets (Table 1). The large beam is cheap for MaLaCo, so the reported accuracy does not depend on an expensive setting.
- TIGER, which also encodes the history once, is likewise flat in beam width (1.80 / 1.80 / 1.79 ms) but 3.4–3.6× slower than MaLaCo at every width.
- The LLaDA-Rec runs at beam 10 and 20 use App. F's timing hook. Its beam-50 run in the same setup reproduces App. F (13.11 vs 13.10 ms).
The revised App. F will add both tables.
W3. The revision opens Section 3 with a short end-to-end inference example and an overview figure before any equations. It states that SID construction runs once per catalog, before recommender training, which uses the resulting table only as SID targets and as the decoding trie.
Thanks for your replay. I will keep my score.
Thank you for reading our response. Could you please let us know if there is any specific point that we did not address clearly, especially about novelty, the ablation results, or the difference from prior work? We would be happy to clarify it briefly. Thank you again for your time and feedback.
Part 1
W1: central insight, prior components and attribution
What we do not claim. Trie-constrained beam search, residual quantization with collision handling, contrastive auxiliary losses and masked item modeling all appear in prior work (OneRec, TIGER, BERT4Rec). So does encoding the history once and decoding SIDs in a separate decoder (TIGER; concurrently, CoSID). The revised Sections 1–2 credit this work and state that we do not claim these components as new.
Central insight. Beam search in a generative recommender does not need to re-read the history. One target state, trained by masked completion over continuous item representations, carries enough information for a small head to decode the whole beam. This makes two testable claims: (i) giving the head the whole encoded history adds nothing over that single state; (ii) masked completion over continuous inputs, rather than the surrounding components, is what makes the state good. The identifier table, to which new items can be added without changing any existing identifier, is a separate contribution (App. E).
Attribution. Each row changes one factor and keeps the rest fixed. R@10, four seeds:
Relation to LLaDA-Rec. Both mask and complete, but they differ in what is completed and where beam search runs. LLaDA-Rec completes discrete SID tokens; MaLaCo completes continuous item representations. A history item enters MaLaCo through its own text-derived vector, not its quantized ID. A newly added item can therefore appear in users' histories as soon as its vector is computed, and a stronger item encoder helps MaLaCo but not LLaDA-Rec (above). LLaDA-Rec re-runs its full backbone for every hypothesis at every denoising step, whereas MaLaCo runs its backbone once and beam search runs only in the 4-layer head. Its cost is therefore nearly flat in beam width: from beam 10 to 50, LLaDA-Rec's cost per query grows 4.6× while MaLaCo's barely changes (Comment 2). The system-level gain is 24.9× at batch 20. Against TIGER, an optimized KV-cached encoder–decoder that also encodes the history once, MaLaCo is 3.4–3.5× faster and more accurate.
W2: the Recall@1 trade-off and beam width
The trade-off is real. Table 1, LLaDA-Rec / MaLaCo:
MaLaCo is below LLaDA-Rec at R@1 on three datasets (by most on Game) and above it on Arts. It leads at R@10 and R@50 on all four. NDCG@10 is mixed: higher on Scientific and Arts, lower on Instrument and Game. We position MaLaCo as a candidate generator whose list feeds a ranking stage, where R@10–R@50 matter most. We do not claim top-1 gains. The abstract already states this trade-off, and the revision states it in the introduction as well.