- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes TESCO, a Teacher-Student method that uses the student's trajectory-balance discrepancy to sample lists in generative recommendation. TESCO-TB improves the average reward over GFN4Rec-TB on three datasets, with a modest memory cost. The motivation is not well justified, and further improvements are needed in terms of logical rigor.
Critical strengths
- Using the trajectory-balance discrepancy to guide sampling fits the GFlowNet objective directly. The signal is already computed during Student training, so no extra reward model is required.
- The Teacher reward mixes this discrepancy with the list reward. On KuaiRand-1K, this full setting beats both the reward-only and loss-only variants in average and maximum reward.
- TESCO-TB improves average reward over GFN4Rec-TB on all three datasets, in both the simulated online and offline settings. The extra cost is modest: about 12–15% more GPU memory, since the Teacher shares the backbone.
Critical weaknesses
- The motivational claims in the third paragraph of the Introduction are largely subjective and lack supporting evidence. The following points need further justification: a) "existing generative approaches still suffer from insufficient exploration of lists that have never interacted with users" needs to be supported by empirical data analysis; b) "This self-reinforcing training dynamic traps the model in a local optimum defined by historical data, pre-venting it from perceiving or learning from unobserved yet informative high-loss regions, and ultimately exacerbating exposure bias." This claim lacks supporting evidence.
- The correctness of the motivation "prioritizing under-explored lists that may match the user’s preferences" itself should be justified first, but the authors do not do so.
- The references include only one paper from 2025 and none from 2026. Is this because the research topic is already old?
- In Table 8, on KuaiRand-27K, TS-TB (n=3) has an average reward of 2.365 ± 0.032 and a maximum reward of 2.065 ± 0.022. If the maximum reward is the maximum over the same set of lists, it cannot be lower than the average reward of those lists.
- Figure 4 first discards configurations whose average reward is not above 2.40, and then concludes from the remaining successful configurations that the method is insensitive to C and α. Whether the method is sensitive depends precisely on the configurations that were discarded.
- Sections 2.2 and 2.3 mostly restate GFlowNets and GFN4Rec, so the new Teacher reward is hard to separate from prior work. It is recommended to move this background into a Preliminary section and state what is new relative to GFN4Rec and Kim et al. (2025).
Questions for authors
- In the second paragraph of the Introduction, it is still unclear why the probability mass over generated lists concentrates on already discovered high-reward lists. What does this have to do with cross-entropy? Cross-entropy is itself a proper scoring rule for probabilities; if the data distribution is well specified, it should in principle recover the appropriate probabilities.
11 comments
Response to Reviewer h68e (2/9)
Existing studies using randomized-exposure test data also support the possibility that historical logs omit some learnable user interests. The SIGIR 2025 paper Improving Sequential Recommenders through Counterfactual Augmentation of System Exposure trains on regular exposure data and validates and tests on KuaiRand randomized-exposure data. In its Table 2, SASRec achieves a Recall@20 of 0.0052, whereas CaseRec-R, which introduces counterfactual exposure augmentation, achieves 0.0229; NDCG@20 also increases from 0.0017 to 0.0099. This shows that supplementing training information from regions insufficiently covered by the historical exposure policy can improve recommendation performance on randomly exposed content. Although this study concerns sequential recommendation, it provides complementary evidence on the relationship between exposure and preference learning. Thus, existing generative recommendation methods still face insufficient exploration of recommendation lists with which the user has never interacted.
2. Regarding question (b), closed-loop experiments on generative recommendation have observed exposure distributions becoming more concentrated through feedback loops. The 2026 preprint Do Generative Recommenders Deepen the Information Cocoon? uses an LLM-based user simulator to conduct 15 successive rounds of recommendation, user selection, and model retraining. On Toys and Games, the exposure Gini coefficient increases from 0.933 to 0.970 for TIGER and from 0.903 to 0.916 for OneRec. A higher Gini coefficient indicates more concentrated exposure. This provides experimental evidence that repeatedly using feedback generated by the model’s own recommendations can sustain or reinforce exposure concentration.
Research on high-loss-guided sampling further shows that changing the training sampling distribution can alleviate the problem of a model’s own policy missing valuable modes. The ICLR 2025 paper Adaptive Teachers for Amortized Samplers reports experiments on a four-dimensional deceptive grid with side length 32. Trajectory Balance using samples from its own policy discovers 16.6±4.8 modes on average, prioritized experience replay discovers 46.6±14.6, and a Teacher guided by the Student’s loss discovers 246.6±14.7. These results support the role of the training sampling distribution in mode discovery and show that loss-based guidance can help discover regions poorly covered by the original policy. Because this is a synthetic sampling task, its support for the recommendation training mechanism should be understood as evidence at the mechanism level.
Long-term controlled comparisons in production systems also show that increased exploration can obtain real interactions with content that had historically received limited exposure. The KDD 2026 paper PinEqualizer: Full Funnel Content Exploration and Debiasing System at Pinterest reports that, in long-term controlled comparisons starting in the second half of 2024, its exploration and debiasing system achieved cumulative increases in interactions with underexplored content of 37%, 13%, and 27% on Homefeed, Search, and Related, respectively. This supports the role of exposure opportunities in feedback accumulation and demonstrates the practical value of selective exploration of underexposed content.
Together, these findings support the motivation for valuable exploration under limited feedback. For question (a), list-generation experiments and the analysis of real randomized-exposure logs support the existence of limited coverage and the potential value of poorly covered candidates. For question (b), closed-loop recommendation experiments, mode-discovery experiments, and production comparisons support feedback reinforcement and the need to adjust the sampling distribution. We have revised the third paragraph of the Introduction to add evidence from TD-GFN, our KuaiRand-1K data analysis, and closed-loop simulations of generative recommendation, providing stronger support for our research motivation.
Response to Reviewer h68e (3/9)
W2. The correctness of the motivation "prioritizing under-explored lists that may match the user’s preferences" itself should be justified first, but the authors do not do so.
Thank you for your suggestion. We have updated the third paragraph of the Introduction to include analyses of TD-GFN and KuaiRand-1K, as detailed below.
1. Real randomized-exposure data show that candidates not yet reached by regular recommendations can contain content that matches user preferences. Our KuaiRand-1K analysis identifies 41,953 randomized exposures of videos never previously shown to the corresponding users. Of these, 3,543 exposures result in long views, accounting for 8.45% and involving 677 users. This indicates that candidates outside historical exposure coverage can still receive positive feedback, providing direct empirical motivation for exploring insufficiently reached content.
2. Existing list-generation experiments further show that broader generation coverage can be achieved alongside higher recommendation rewards. In the aforementioned experiment generating six-item lists on MovieLens-1M, Dataset-GFN covers 7.9±0.9 distinct items and achieves an average reward of 1.681±0.202, whereas TD-GFN achieves coverage of 186.8±6.3 and an average reward of 1.988±0.006. This result supports the research direction of improving both coverage and preference-related utility in list generation. Production results provide complementary evidence: Pinterest’s exploration and debiasing system achieved cumulative increases of 37%, 13%, and 27% in interactions with underexplored content across three product surfaces, demonstrating the practical value of selective exploration of underexposed content.
Together, these findings support the motivation for exploring insufficiently covered recommendation spaces under the guidance of user preferences. The randomized-exposure analysis supports the potential value of unreached candidates, while list-generation experiments and production results support the benefits of broader exploration. Overall, this evidence sufficiently establishes the validity of our research motivation.
Response to Reviewer h68e (1/9)
Dear Reviewer h68e,
We sincerely thank you for your careful review and constructive feedback. We are encouraged by your recognition of TESCO’s sampling strategy, reward improvements, and modest memory overhead. Your comments provide valuable guidance for strengthening the motivation, clarity, and logical rigor of our paper. Below, we respond to your concerns point by point and describe the corresponding revisions.
Thank you for your suggestions, and we provide detailed clarifications below. We agree that these two claims require empirical support, and that we should distinguish coverage in list generation, the potential value of underexposed content, and the effects of feedback loops on training and exposure distributions. We address questions (a) and (b) separately below.
1. Regarding question (a), existing list-generation experiments show that training directly on offline historical trajectories can limit the coverage of generated results. The ICML 2026 paper Beyond the Proxy: Trajectory-Distilled Guidance for Offline GFlowNet Training conducted experiments generating six-item lists on MovieLens-1M. Appendix E.1, Table 4 reports that Dataset-GFN, trained directly on offline trajectories, covers 7.9±0.9 distinct items in its generated samples and achieves an average reward of 1.681±0.202. With an improved training method, TD-GFN achieves coverage of 186.8±6.3 and an average reward of 1.988±0.006. These results are means and standard deviations over three random seeds. They show that, in this experimental setting, direct training on historical trajectories does limit coverage, and that broader coverage can be achieved alongside higher rewards. Here, Coverage measures the number of distinct items appearing in generated lists; it does not directly measure the discovery rate of lists with which the user has not previously interacted.
We further analyzed real randomized-exposure logs from KuaiRand-1K. The results are as follows:
The most direct finding is that 3,543 user–video pairs had no exposure records in the regular logs for the entire month, yet received long views after randomized exposure. Our analysis of the real KuaiRand-1K logs shows that randomized exposure can discover valuable interactions that regular recommendations have not reached. Among users with prior viewing histories, 3,543 previously unreached user–video pairs received long views after randomized exposure. This indicates that relying on existing exposure records can overlook user interests with recommendation value, providing empirical motivation for further exploration of candidates with which the user has not previously interacted.