- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The authors propose "Prefix Alignment with Temporal History" (PATH), which addresses the issue where generative recommendation models—when using beam search—might prematurely lose the target by failing to preserve early prefixes. PATH improves recommendation accuracy by aligning model predictions with historical data. Experiments demonstrate that PATH enhances both recommendation performance and path integrity across multiple datasets.
Critical strengths
-
The proposed PATH significantly improves the retention of target paths during the recommendation process.
-
PATH shows higher recommendation accuracy compared to existing methods across multiple datasets.
Critical weaknesses
-
The PATH method introduces additional statistical computations, increasing the model's complexity.
-
PATH requires substantial computational resources for achieving higher prediction accuracy.
-
Its generalizability and adaptability to large-scale industrial datasets remain unverified.
Questions for authors
-
How can the performance of PATH be optimized without significantly increasing computational resources?
-
Can PATH adapt to high-frequency dynamic changes in real-time recommendation systems? How does the method handle real-time data streams?
-
How does PATH perform in multi-step prediction scenarios? Can it effectively handle cross-temporal predictions of complex user behavior sequences?
5 comments
Response to Question 1 [Part 1]
We thank the reviewer for this insightful question. We agree that balancing recommendation accuracy and computational efficiency is important for the practical applicability of PATH. In response, we have conducted additional experiments to quantify the computational overhead and evaluate the effectiveness of Monte Carlo sampling. We further clarify how the proposed design controls additional computation while maintaining recommendation performance, as detailed below.
PATH controls its additional computational cost through the chain-rule decomposition of the joint KL objective. Specifically, the first-level KL term is computed exactly, while the second-level conditional KL term is estimated using a small number of branches sampled from the teacher's first-level distribution. Since the teacher distribution is fixed with respect to the model parameters, this provides an unbiased Monte Carlo estimator of the conditional objective and its gradient, avoiding exhaustive evaluation of all supported first-token branches.
On Beauty, the SID mapping contains 197 supported first-level branches, whereas PATH evaluates only four sampled branches per instance () in the supplementary experiments. Table 1 compares the recommendation performance of NTP, PATH, and the strict two-marginal alternative.
Table 1: Recommendation performance and auxiliary branch evaluations on Beauty.
| Method | Branches | NDCG@10 | Hit@10 |
|---|---|---|---|
| NTP | 0 | 0.035413 | 0.065734 |
| PATH (sampled joint KL) | 4 | 0.046976 | 0.083397 |
| Strict two-marginal | 197 | 0.045832 | 0.079775 |
PATH improves NDCG@10 and Hit@10 over NTP by 32.7% and 26.9%, respectively. It also achieves higher recommendation accuracy than the strict two-marginal alternative in this comparison, despite evaluating substantially fewer branches. These results show that the sampled joint-prefix objective achieves favorable recommendation performance with limited additional conditional branch evaluations.
We further measure the actual training overhead on a single NVIDIA RTX 3090. The measurements use FP32 precision and include the forward pass, backward pass, and optimizer update. Table 2 reports the average training-step time and peak CUDA allocated memory.
Table 2: Training cost comparison on a single NVIDIA RTX 3090.
| Batch | Method | Branches | Step (ms) | Memory (GiB) |
|---|---|---|---|---|
| 128 | NTP | 0 | 34.34 | 1.553 |
| 128 | PATH (sampled) | 4 | 46.82 | 2.394 |
| 32 | NTP | 0 | 19.97 | 0.471 |
| 32 | PATH (sampled) | 4 | 41.69 | 0.859 |
| 32 | Strict two-marginal | 197 | 494.72 | 8.444 |
At batch size 128, PATH increases training-step time by 36.3% and peak GPU memory by 54.1% relative to NTP. At batch size 32, the strict two-marginal alternative requires approximately 11.9 times the training-step time and 9.8 times the peak allocated memory of sampled PATH.
The computational efficiency of PATH comes from estimating the conditional KL term through Monte Carlo sampling. Specifically, the additional conditional branch-evaluation cost is reduced from for exhaustive evaluation to , where denotes the number of supported first-level branches and is the cost of one conditional branch evaluation. Both the strict two-marginal alternative and unsampled PATH require second-token predictions under all first-level SID branches, and therefore incur the full branch-enumeration cost. Sampling controls this additional decoding work by evaluating only a small number of branches. These results demonstrate the computational advantage of stochastic branch evaluation over exhaustive enumeration.
Response to Question 1 [Part 2]
Regarding memory requirements, the transition matrix is indexed by valid two-token SID prefixes rather than individual items. With a fixed 256-entry codebook at each of the first two SID levels, the number of distinct prefixes satisfies
$ P \leq \min(|\mathcal{V}|,256^2) \leq 65,536 $$
Although dense storage requires memory, the prefix space has a fixed upper bound under this configuration. The actual FP32 matrix sizes are 239.95 MiB, 171.34 MiB, and 961.85 MiB on Beauty, Instruments, and Yelp, respectively. The theoretical maximum is 16 GiB per FP32 copy, which would be reduced to 8 GiB using BF16 storage. The current implementation uses FP32; the BF16 figures represent potential storage savings rather than experimentally validated configurations. Finally, PMI calibration is applied only after candidate generation. It requires transition-statistic lookups and candidate sorting, where is the beam width and is the history length, without additional autoregressive decoding.
Overall, PATH introduces measurable but controllable computational overhead. The Monte Carlo estimator limits the additional conditional decoding cost while preserving effective joint-prefix supervision, and the bounded SID prefix space makes the transition-storage requirements explicit. Together, these design choices provide a practical trade-off between recommendation accuracy and computational cost.
Response to Reviewer ai3T Feedback
We sincerely thank you for the constructive comments and insightful questions. Your feedback has been valuable in helping us strengthen the rigor and clarity of our manuscript.
We appreciate your concerns regarding the computational overhead, practical scalability, and adaptability of PATH to dynamic recommendation scenarios. In response, we have quantified the additional training and memory costs, analyzed the storage requirements of the transition matrix, and clarified the computational efficiency of Monte Carlo sampling. We have also further discussed how PATH incorporates evolving user interaction histories, its potential extension to streaming environments, and the distinction between joint-prefix prediction and multi-step recommendation.
Our detailed responses are provided below.