- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes APD-GR, an inference-acceleration framework for generative recommendation with semantic IDs. Rather than performing autoregressive draft generation and online Target verification, APD-GR extracts representations from a frozen Target once, uses a Context Adapter and Parallel Position Draft to compute representations for all SID positions in parallel, and employs a lightweight recurrent Prefix-Conditioned Head during constrained beam search. The framework is trained with a two-stage objective: supervised SID prediction followed by teacher-forced distribution distillation from the frozen Target.
Critical strengths
-
The paper identifies a practically relevant bottleneck in generative recommendation: repeated autoregressive decoding over semantic IDs.
-
The combination of a one-pass parallel position Draft with a recurrent prefix-conditioned Head is a sensible design for reducing repeated backbone computation while retaining prefix information.
Critical weaknesses
- The absence of a lightweight autoregressive baseline without online Target verification makes it difficult to isolate the benefit of the parallel Draft from that of removing verification.
- Performance degradation is substantial in some settings. For example, MiniOneRec loses approximately 25% of N@10 on Toys, weakening the claim of largely preserving recommendation quality.
Questions for authors
Stage I uses only 50% of the training data, whereas Stage II uses the full dataset. Removing Stage II therefore also reduces data coverage and training steps. Can the authors isolate the benefit of the two-stage design using controls with matched data coverage and training budgets?
Thank you for your constructive feedback and for recognizing the practical value of our work. For W1, we added AtSpeed-D, the draft-only AtSpeed baseline, to Table 1 and discussed the results in Section 4.2. For W2, we revised the abstract and conclusion to report average NDCG@20 retention and updated Section 4.2 to discuss the loss on Toys. For Q1, we added two single-stage baselines with matched data coverage and training-example counts in Appendix C.2 (Table 10).
W1. Verification-Free Baseline: We compare APD-GR and AtSpeed w/o verification using the LETTER backbone. With verification disabled, AtSpeed runs beam search under the same SID constraints and returns the top candidates ranked by the draft model’s scores.
Both methods omit online Target verification, yet APD-GR achieves higher H@10 and N@10 with lower latency across all three datasets. This shows that APD-GR’s advantage over this autoregressive baseline extends beyond removing verification.
W2. Quality Claims: We agree that the quality loss on Toys is substantial for some backbones and that “largely preserving recommendation performance” is too broad. We have revised the abstract and conclusion to report average NDCG@20 retention and updated Section 4.2 to discuss how the quality loss varies across backbone–dataset pairs.
Q1. Two-Stage Design: We compare APD-GR with two single-stage baselines using TIGER. Both baselines train on the full dataset for 14 epochs, using either CE alone or CE+KL throughout. This matches APD-GR’s total training-example count: 4 epochs on 50% of the data followed by 12 epochs on the full dataset (4 × 0.5 + 12 = 14).
Although the two-stage design primarily aims to reduce feature caching and transfer costs, it also maintains competitive recommendation quality under a matched training budget. APD-GR performs better on Beauty and Toys, while single-stage CE+KL performs better on Instruments.