- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes Target-Masked Rejection Sampling Fine-Tuning (TM-RFT) for generative recommendation. The method retains supervision on multiple successful reasoning trajectories while masking their shared terminal Semantic ID (SID) targets. This reduces redundancy between reasoning-based and direct recommendation, improving candidate diversity and overall retrieval performance. Experiments on OneReason and three Amazon datasets demonstrate the effectiveness of the proposed approach.
Critical strengths
Simple and effective methodology. The proposed masking strategy effectively addresses redundant target supervision in multi-trajectory learning.
Insightful analysis. The paper provides meaningful insights into candidate diversity and the complementarity of reasoning and direct decoding.
Empirical improvements. TM-RFT demonstrates performance gains across multiple recommendation benchmarks.
Critical weaknesses
Limited cold-start generalization. Reliance on predefined SIDs restricts scalability to unseen items and dynamic item catalogs.
Questionable practical competitiveness. Compared with recent approaches such as Rec-R1[1] and Rec-Zero[2], the practical advantages of this SID-based framework remain unclear.
Limited generalizability. Evaluation is restricted to Qwen3-based models and offline benchmarks, with insufficient analysis of computational costs and deployment feasibility.
[1] LIN, Jiacheng; WANG, Tian; QIAN, Kun. Rec-r1: Bridging generative large language models and user-centric recommendation systems via reinforcement learning. arXiv preprint arXiv:2503.24289, 2025.
[2] KONG, Xiaoyu, et al. Think before Recommendation: Autonomous Reasoning-enhanced Recommender. Advances in Neural Information Processing Systems, 2026, 38: 141209-141232.
Questions for authors
Scalability to Unseen Items: How can TM-RFT accommodate unseen or cold-start items that lack established Semantic IDs? Can the proposed framework generalize to dynamically evolving item catalogs without retraining?
Practical Competitiveness: Compared with recent reasoning-based recommendation approaches such as Rec-R1 and Rec-Zero, what are the practical advantages of TM-RFT? Could the authors provide comparisons in terms of recommendation performance, computational efficiency, and scalability?
We thank the reviewer for the constructive feedback. We have substantially revised the manuscript with additional ablations, statistical analysis, and cross-dataset evaluations.
1. Target supervision ablations (W1, Q1).
We added Half Weight (α=0.5 on each retained augmentation) and One Anchor (unit target weight on one retained augmentation per augmented request–target pair), keeping initialization, sampled trajectories, and reasoning-token supervision unchanged. TM-RFT (k=3) achieves 0.7893, outperforming Full-RFT (0.6460), Half Weight (0.7251), Group (0.7011), and One Anchor (0.7285). Full masking outperforms all tested schemes that retain terminal-target supervision on the added trajectories, although gradient-scale effects are not fully isolated.
2. Latency and practical applicability (W2, Q2).
We agree that generating CoT incurs additional latency compared with direct decoding. Our evaluation follows the official fixed-candidate protocol, not a fixed-compute budget. Importantly, TM-RFT improves all inference routes over SFT-only: reasoning-only (0.6396→0.7129), direct-only (0.7131→0.8099), and hybrid (0.6912→0.7893).
At a fixed budget of 64 candidates on OneReason, the best direct-only score (0.8099) exceeds the best mixed score (0.8035). However, industrial studies such as OneReason and OneLatent[1] demonstrate stronger or more efficient reasoning-based recommendation. TM-RFT is a training-time strategy that could complement these systems and potentially provide further improvements, although direct integration remains future work.
3. Statistical reliability (W3, Q3).
We added 50,000 paired bootstrap resamples (Appendix F). At 32+32, TM-RFT (k=3) improves Weighted Pass@64 over SFT-only by 0.0981 (pointwise paired 95% CI [0.0574, 0.1394]). The bootstrap resamples test requests with the evaluated checkpoints and predictions held fixed. We also report sensitivity across k∈{1,2,3,4,8}. Training-seed and decoding-seed variability remain limitations.
4. Amazon generalization (W4, Q4).
Updated experiments show TM-RFT outperforming SFT-only across all three Amazon datasets: Games (23.66 vs. 22.85), Office (26.99 vs. 24.79), and Industrial (26.33 vs. 24.06). Pooled coverage improves from 23.81% to 25.49%. Full-RFT, Group, and One Anchor comparisons are also included.
5. Reasoning diversity and success-conditioned selection (W5, Q4).
We added semantic clustering of successful trajectories (Appendix H). Across the full OneReason RFT dataset, 77% of groups with exactly four retained RFT trajectories contain at least one additional core reasoning path beyond the original SFT rationale. Appendix G further shows that successful augmentations concentrate on easier requests and frequent targets, supporting our motivation to avoid repeated target supervision. We acknowledge that semantic diversity alone does not establish causal faithfulness.
Overall, the revised evidence shows that TM-RFT improves recommendation performance across reasoning, direct, and hybrid inference by learning from additional reasoning trajectories without repeatedly supervising their shared terminal target.
References
[1] Hao Jiang et al. OneLatent: Latent Reasoning for Efficient Foundation Recommendation Models. arXiv:2610.30675, 2026.