Pith.

Information Retrieval · arXiv:2611.16795 v1 · submitted 12 Nov 2026 · 82 references

KuaiRecV2: Benchmarking Large-Scale Continual Learning for Diversified and Multi-task Recommendation

Chenxu Li, Shuchang Liu, Hantao Shu, Wei Yuan, Zhe Xu, Guoqing Hu, Yan Wang, Biao Yang

show 10 more authors

Xiang Li, Cheng Ling, Fan Yang, Yongqi Liu, Lantao Hu, Han Li, Kaiqiao Zhan, Kun Gai, An Zhang, Xiang Wang

The paper says

“Recommender systems, which retrieve items of interest to users based on their interaction histories, have recently witnessed several key technological advancements, benefiting from the semantic representation space and model-data scaling.”

more of the abstract

Nevertheless, practitioners and researchers have frequently encountered critical inconsistencies between simple offline evaluations and complex online results, and this gap still exists in the era of large models. In this work, we address several key factors that contribute to this inconsistency: 1) the large-scale continual learning challenge that assumes a practical demand to maintain long-term model effectiveness under dynamic item pools and distributional shifts; 2) the combinatorial diversity challenge that requires the generation strategy to solve the accuracy-diversity trade-off in both the finer token level and the holistic item level; and 3) the multi-task reward balancing challenge, which is particularly critical for modern generative models that can accurately model the sequence distribution but are less controllable for the multi-task demands. To address these challenges and further pave the way for the development of more realistic recommendation solutions, we introduce KuaiRecV2, a deliberately constructed benchmark with industrial-level datasets from Kuaishou. Specifically, we provide a large-scale interaction dataset with million-scale multi-modal item information and long-term interaction records across 30 days, with a dynamic video candidate pool. Additionally, we provide a rigorous benchmark that evaluates retrieval accuracy, diversity, and multi-task performance in one rubric system, where an effective advancement occurs if and only if the new method improves all metrics. The code is available at https://github.com/cxli2333/KuaiRecV2

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

The passes disagreed. Reader: holds up. Skeptic: holds up only with conditions. Referee: major revision.

5 major objections · 10 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 82 references say.

The paper says, at §2.2, Figure 1, Appendix B

The review did not quote this passage.

A classifier read this sentence of the paper as acknowledging the concern (probability 0.63):

“Our work provides the data and fundamental framework for continual recommendation. 25 B Limitations and Future Directions B.1 Limitations While KuaiRecV2 moves the field towards a more online-alike evaluation of recommender systems, the data used in industrial recommendation systems can still be far more complex than ours (e.g., excluding user features for privacy concerns), making it impossible for us to fully simulate real-world online recommendation systems.”

Pith says: Objection 1 of 5 · major

The 7-day sliding window for item pools and the daily training schedule are central to the benchmark's claim of realism for continual learning. However, the paper does not provide any validation that this temporal structure produces distribution shifts representative of real-world dynamics.

more of objection 1

The authors acknowledge in Appendix B that 'the data used in industrial recommendation systems can still be far more complex than ours... making it impossible for us to fully simulate real-world online recommendation systems.' While this is honest, the benchmark's primary contribution—narrowing the gap between offline and online evaluation—rests on the assumption that the 7-day window and daily schedule are meaningful proxies. The paper does not analyze alternative window sizes (e.g., 3-day, 14-day) or training frequencies (e.g., every 2 days) to demonstrate robustness. Without such analysis, the observed catastrophic forgetting, diversity bottlenecks, and multi-task trade-offs could be artifacts of the specific temporal discretization rather than fundamental challenges of generative recommenders. I recommend that the authors either provide a sensitivity analysis of the window size and training schedule, or explicitly reframe the benchmark's contribution as a controlled laboratory setting rather than a realistic simulation, and adjust the claims accordingly.

The paper says, at §4.1, Table 3

The review did not quote this passage.

Pith says: Objection 2 of 5 · major

The backward transfer results in Table 3 show catastrophic forgetting, but the evaluation uses only HR@50 on Day 1. The paper does not report whether the forgetting is uniform across behaviors or item types. Given the multi-task and diversity focus, it would be informative to report backward transfer for other metrics (e.g., NDCG, diversity metrics) and for other days (e.g., Day-2 retention).

more of objection 2

Additionally, the replay baseline retains only 5% of previous instances; the paper does not discuss why 5% was chosen or whether results are sensitive to this hyperparameter. Without this, the claim that 'all methods show substantial forgetting' is supported but the analysis is shallow for a benchmark paper.

The paper says, at §3.1, §4.2, Table 6

The review did not quote this passage.

Pith says: Objection 3 of 5 · major

The token-level diversity metrics are a novel contribution, but the paper does not explain how they are computed in sufficient detail for reproducibility. Appendix D provides brief definitions, but key implementation choices are missing: how are 'TopK Layer Diversity' and 'Average Path Diversity' exactly computed?

more of objection 3

Are they averaged over users? Over days? The paper states 'Detailed explanations are provided in the appendix D' but the appendix is only a few lines. For a benchmark, these metrics must be precisely defined. I recommend providing formal definitions with equations, and releasing the evaluation code to ensure reproducibility.

The paper says, at §4.3, Figure 4

The review did not quote this passage.

Pith says: Objection 4 of 5 · major

The RL experiments compare SFT+RL alternating, RL-only, and SFT-only, but the RL-only strategy is applied starting from Day 20 without any SFT initialization. This is an unfair comparison because the RL-only model has not been trained on the data distribution before Day 20.

more of objection 4

The paper acknowledges that 'RL alone is insufficient to adapt to new data distributions,' but the experimental design conflates lack of SFT pretraining with inability to adapt. A fairer comparison would initialize the RL-only model with the Day 19 SFT checkpoint (same as the alternating strategy) and then apply only RL from Day 20 onward. The current setup overstates the limitation of RL. I recommend rerunning this experiment with proper initialization or clarifying that the RL-only condition is intentionally disadvantaged.

The paper says, at §4.4, Table 4

The review did not quote this passage.

Pith says: Objection 5 of 5 · major

The scalability comparison on KuaiRecV2-Small shows that generative models outperform traditional models, but the traditional models (SASRec, GRURec) are trained with negative sampling (num_negatives=1000) while generative models use full vocabulary generation. This is not an apples-to-apples comparison: traditional models are evaluated on a sampled subset, which may underestimate their performance.

more of objection 5

The paper should discuss how negative sampling affects the comparison, or provide results with full softmax or other approximations for traditional models. Without this, the claim that 'architectural choice is more critical than model size alone' is weakened.

10 minor objections

The paper says, at Abstract

Pith says: minor objection 1 of 10

The abstract states 'an effective advancement occurs if and only if the new method improves all metrics.' This is a strong criterion that may discourage research on specialized improvements. Consider softening to 'improves all metrics or provides a clear trade-off analysis.'

The paper says, at §1.1, RQ2

Pith says: minor objection 2 of 10

The phrase 'combinatorial diversity challenge' is introduced but not clearly defined until later. Consider providing a brief definition in the introduction.

show 8 more

The paper says, at §2.1, Table 1

Pith says: minor objection 3 of 10

The sparsity is reported as 99.9843% and 99.9871%. These values seem extremely high; please verify the calculation (e.g., sparsity = 1 - (#records)/(#users * #items)). With 124k users and 24M items, the total possible interactions is ~3 trillion, so 484M interactions gives sparsity ~99.984%, which is plausible but worth double-checking.

The paper says, at §3.2.2

Pith says: minor objection 4 of 10

The RL reward design is described in Appendix E.3, but the main text mentions 'reward functions, formatted as RB = Pb∈B αbRb' without defining αb. Please provide the α values used in experiments or state that they are tuned.

The paper says, at §4.1, Figure 3

Pith says: minor objection 5 of 10

The loss curve shows spikes at day boundaries, but the y-axis is loss and the inset shows initial loss. It would be helpful to also show validation metrics (e.g., HR@50) over days to correlate loss spikes with performance degradation.

The paper says, at §4.2, Table 5

Pith says: minor objection 6 of 10

The Gini coefficient values are reported as percentages (×10−2). Please clarify whether these are Gini indices (0-1) scaled by 100, or something else. The values around 90% seem high; typical Gini for recommendation is lower. Provide interpretation.

The paper says, at Appendix E.2

Pith says: minor objection 7 of 10

The hyperparameter lists for SASRec and GRURec include 'item_num=2452987' which matches the Small dataset. Please confirm that the FullMonth experiments use the same item_num or adjust accordingly.

The paper says, at Appendix F.2, Table 8

Pith says: minor objection 8 of 10

The tag frequency quantiles show median=1, meaning most tags appear once. This is an important characteristic but is not discussed in the main paper. Consider mentioning in §2.1 or §4.2.

The paper says, at General

Pith says: minor objection 9 of 10

The paper uses 'KuaiRecV2' as the benchmark name, but the original KuaiRec [24] is a fully-observed dataset. The naming might cause confusion. Consider adding a brief note distinguishing the two.

The paper says, at References

Pith says: minor objection 10 of 10

Reference [50] and [51] are duplicates of [29] and [30] respectively. Please remove duplicates.

What would settle it

Re-run the MiniOneRec continual learning experiment (Section 4.1) with two alternative temporal configurations: (a) a 14-day sliding window instead of 7 days, and (b) a twice-daily training schedule instead of daily. If the qualitative patterns (catastrophic forgetting, loss spikes at day boundaries, relative ordering of methods) change substantially, then the benchmark's temporal design is not robust and the central claim of realistic evaluation is weakened.

from the skeptic's reading

How the review went

3 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up confidence high
  2. Skeptic agrees: says it holds up only with conditions 7 s · 33,651 tokens read, 559 written The 7-day sliding window and daily training schedule are not validated against real-world dynamics; the benchmark's claim to test continual learning under realistic distribution shift rests on this unvalidated temporal structure.
  3. Referee major revision: 5 major objections, 10 minor 17 s · 33,941 tokens read, 2,087 written

Not run on this paper: the editor, the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The strongest objection

The paper's central claim is that KuaiRecV2 enables realistic evaluation of continual learning, diversity, and multi-task performance. The weakest load-bearing assumption is that the 7-day sliding window for item pools and the daily training schedule adequately capture the dynamics of real-world recommendation systems. The paper acknowledges this limitation in Appendix B: 'the data used in industrial recommendation systems can still be far more complex than ours... making it impossible for us to fully simulate real-world online recommendation systems.' However, the entire benchmark's claim to realism rests on this temporal structure. The paper does not provide any analysis showing that the 7-day window or daily schedule produces distribution shifts that are representative of real-world dynamics. Without validation, the observed catastrophic forgetting, diversity bottlenecks, and multi-task trade-offs could be artifacts of the specific temporal discretization rather than fundamental challenges of generative recommenders. The paper also does not compare against alternative window sizes or training schedules to demonstrate robustness. This is a load-bearing concern because if the temporal structure is not representative, the benchmark's primary contribution—narrowing the gap between offline and online evaluation—is undermined.

The reader's weakest_assumption correctly identifies the 7-day sliding window and daily training schedule as the load-bearing assumption. The paper acknowledges this limitation but does not validate it. The concern is not that the assumption is false, but that it is unvalidated and central to the benchmark's contribution. The proposed concrete test would settle whether the temporal design is robust. The verdict should be CONDITIONAL because the paper's central claim depends on this assumption being reasonable; if the test shows sensitivity, the claim is weakened. The reader's verdict of ACCEPT is too strong given this unresolved concern. The paper is otherwise well-constructed and transparent, which is why the adjustment is to CONDITIONAL rather than REJECT.

The referee's report

If the benchmark is adopted, it could significantly advance the evaluation of recommender systems by incorporating continual learning, diversity, and multi-task objectives in a realistic temporal setting. The dataset size and temporal structure are substantial, and the inclusion of semantic IDs and multi-modal embeddings supports modern generative recommendation research. The paper's emphasis on a unified rubric (improvement on all metrics) is a strong contribution to preventing over-optimization on single metrics. The baseline experiments are thorough and reveal important challenges. The benchmark fills a gap in existing resources (FORGE, MUSE, KuaiRec) by focusing on continual learning and multi-task evaluation.

Pith's reading of the paper (a machine's summary, not the authors')

This paper introduces KuaiRecV2, a large-scale benchmark for evaluating generative sequential recommenders in a more realistic setting that combines continual learning, diversity, and multi-task objectives. The authors argue that existing offline evaluations miss critical failures—catastrophic forgetting, diversity collapse, and multi-task trade-offs—that appear when models face daily item-pool changes and shifting user interests over 30 days. They provide a dataset of 124k users, 24 million items, and 484 million interactions from Kuaishou, with multi-modal item features and a dynamic candidate pool that refreshes every seven days. The central claim is that a method advances the state of the art only if it improves retrieval accuracy, diversity, and multi-task metrics simultaneously; anything less is a ‘defective advancement.’ Experiments show that even state-of-the-art generative models suffer from sharp performance drops when item pools change, that token-level diversity is concentrated in the first few tokens, and that reinforcement learning alone fails under distribution shift unless combined with supervised fine-tuning. If the benchmark’s temporal structure captures real-world dynamics, then many published gains on static benchmarks may not carry over to production settings, and the field needs new algorithms that explicitly balance adaptation, retention, diversity, and multiple user behaviors.

What carries the argument. The key machinery is the long-term recommendation pipeline with a 7-day sliding window for the item candidate pool. Each day, items created more than seven days ago are removed and newly created items are added; models are trained sequentially on each day’s data, initialized from the previous day’s checkpoint, and evaluated daily on a leave-one-out task. This temporal structure forces models to confront distribution shifts, cold-start items, and forgetting, and it grounds the benchmark’s three evaluation axes: retrieval accuracy, token-level and item-level diversity, and multi-task performance across behaviors (click, long view, like, follow, forward, comment, search, profile enter, hate).

Core claim. The paper’s central discovery is that generative sequential recommenders, when evaluated under a continual-learning rubric with daily item-pool refreshes, exhibit three systematic weaknesses that are invisible in static benchmarks: (1) catastrophic forgetting of earlier user preferences as new items enter the pool, with back-transfer HR@50 dropping from 39 to 0.19 over seven days; (2) a combinatorial diversity bottleneck in which the first few tokens of a semantic ID determine most of the diversity while later tokens are nearly deterministic; and (3) a fragility of reinforcement-learning-based multi-task alignment, which improves accuracy on the current day but collapses when the item distribution shifts unless RL is interleaved with supervised fine-tuning. The authors operationalize an ‘effective advancement’ as a method that improves retrieval accuracy, multi-level diversity, and multi-task metrics all at once, and they show that no current method meets this bar on KuaiRecV2.

The premise it rests on. The 7-day sliding window for item pools and the daily training schedule are assumed to capture the essential dynamics of real-world recommendation systems, but the authors acknowledge that industrial systems are far more complex, making it impossible to fully simulate online conditions.

If the paper is right (Pith's inferences, not the authors')

Generative recommenders that rely on semantic IDs (SIDs) will need explicit mechanisms to retain knowledge of earlier items when the pool turns over, because even replay buffers and elastic weight consolidation only partially mitigate the observed forgetting.

Token-level diversity metrics reveal that diversity control must operate on the first few tokens of an SID; later tokens contribute little variety, so beam-search strategies that treat all tokens equally will fail to produce diverse recommendations.

Multi-task reinforcement learning for recommender systems should be combined with supervised fine-tuning on the current day’s data rather than applied alone, because RL-only training cannot adapt to item-pool changes.

The benchmark’s ‘effective advancement’ criterion—improving accuracy, diversity, and multi-task metrics simultaneously—raises the bar for future work and may disqualify methods that trade one objective for another.

The 7-day sliding window is a plausible but untested proxy for real-world item churn; an experiment that varies the window length (e.g., 1 day, 14 days, 30 days) would reveal how sensitive the observed forgetting and diversity bottlenecks are to this temporal assumption.

The benchmark’s exclusion of user profile features for privacy means that methods relying on user-side embeddings are under-served; a synthetic user-feature variant could test whether additional user context helps mitigate forgetting.

The SID collision rate (0.81%) is low, but the tag distribution is extremely long-tailed (median frequency 1); this suggests that semantic diversity at the fine-grained level is sparse, and token-level diversity metrics may conflate semantic sparsity with model diversity failure.

The paper does not report confidence intervals or statistical significance tests; the reported standard deviations across three seeds are small, but without significance tests it is unclear whether observed differences between models are reliable.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

Recommender systems, which retrieve items of interest to users based on their interaction histories, have recently witnessed several key technological advancements, benefiting from the semantic representation space and model-data scaling. Nevertheless, practitioners and researchers have frequently encountered critical inconsistencies between simple offline evaluations and complex online results, and this gap still exists in the era of large models. In this work, we address several key factors that contribute to this inconsistency: 1) the large-scale continual learning challenge that assumes a practical demand to maintain long-term model effectiveness under dynamic item pools and distributional shifts; 2) the combinatorial diversity challenge that requires the generation strategy to solve the accuracy-diversity trade-off in both the finer token level and the holistic item level; and 3) the multi-task reward balancing challenge, which is particularly critical for modern generative models that can accurately model the sequence distribution but are less controllable for the multi-task demands. To address these challenges and further pave the way for the development of more realistic recommendation solutions, we introduce KuaiRecV2, a deliberately constructed benchmark with industrial-level datasets from Kuaishou. Specifically, we provide a large-scale interaction dataset with million-scale multi-modal item information and long-term interaction records across 30 days, with a dynamic video candidate pool. Additionally, we provide a rigorous benchmark that evaluates retrieval accuracy, diversity, and multi-task performance in one rubric system, where an effective advancement occurs if and only if the new method improves all metrics. The code is available at https://github.com/cxli2333/KuaiRecV2

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-13

The authors' main claim, as the classifier picked it out 0.78

“To address these challenges and further pave the way for the development of more realistic recommendation solutions, we introduce KuaiRecV2, a deliberately constructed benchmark with industrial-level datasets from Kuaishou.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.07 · states limitation 0.16 · human participants 0.15 · controlled comparison 0.12 · randomized assignment 0.01 · states quantitative result 0.46 · compares with prior results 0.09 · mentions code or data availability 0.98

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
Recommender systems, which retrieve items of interest to users based on their interaction histories, have recently witnessed several key technological advancements, benefiting from the semantic representation space and model-data scaling. background 1.00 0.04 0.02 asserted 1.00
Nevertheless, practitioners and researchers have frequently encountered critical inconsistencies between simple offline evaluations and complex online results, and this gap still exists in the era of large models. gap 0.68 0.07 0.04 asserted 1.00
In this work, we address several key factors that contribute to this inconsistency: 1) the \textit{large-scale continual learning challenge} that assumes a practical demand to maintain long-term model effectiveness under dynamic item pools and distributional shifts; 2) the \textit{combinatorial diversity challenge} that requires the generation strategy to solve the accuracy-diversity trade-off in both the finer token level and the holistic item level; and 3) the \textit{multi-task reward balancing challenge}, which is particularly critical for modern generative models that can accurately model the sequence distribution but are less controllable for the multi-task demands. gap 0.49 0.10 0.07 asserted 1.00
To address these challenges and further pave the way for the development of more realistic recommendation solutions, we introduce KuaiRecV2, a deliberately constructed benchmark with industrial-level datasets from Kuaishou. contribution 1.00 0.92 0.09 asserted 1.00
Specifically, we provide a large-scale interaction dataset with million-scale multi-modal item information and long-term interaction records across 30 days, with a dynamic video candidate pool. method 0.62 0.91 0.03 asserted 1.00
Additionally, we provide a rigorous benchmark that evaluates retrieval accuracy, diversity, and multi-task performance in one rubric system, where an effective advancement occurs if and only if the new method improves all metrics. method 0.54 0.84 0.13 asserted 1.00
The code is available at https://github.com/cxli2333/KuaiRecV2 contribution 0.85 0.47 0.02 asserted 0.97

What kind of paper the classifier reports this is: dataset or benchmark 1.00 · evidence from observation or experiment 0.63

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 5,863 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (5)
Figure 1 of the paper
Figure 1. Data Organization of KuaiRecV2. 1 Introduction Recommender systems [1, 2] capture user characteristics and preferences from their interaction histo￾ries and filter new content of interest that fulfills users’ demands for daily information consumption. Due to the similarity in the sequential modeling formulation, recommendation technologies have wit￾nessed significant development in expressiveness and accuracy, as they benefit from the advancements of large language models and multi-modal models [3, 4]. In addition to the LLM-enhanced recom￾mendation paradigm [5], recent discussions…
Figure 2 of the paper
Figure 2. Daily Statstics of KuaiRecV2. Data Structure: Each user-item interaction record contains labels for multiple tasks, including view￾ing behaviors (e.g., short view and complete view), positive interactions (e.g., like and comment), and a negative interaction label (hate). For each retained item, we provide a 64-dimensional multimodal embedding using the model in [42], an eight-level semantic ID generated by a fixed RQ-VAE-style tokenizer [8], and MLLM-inferred tag IDs [43] for semantic matching analysis. All these models were fixed during the generation of item meta information, and…
Figure 3 of the paper
Figure 3. Training loss during 5-day continual learning.
Figure 5 of the paper
Figure 5. The distribution of SID, the SID distribution of higher-level codebooks is more uneven.

Showing 4 of the paper's 5 figures. Figures are the authors', reproduced from the paper.

References (82)
  1. [1] Charu C. Aggarwal.Recommender Systems - The Textbook. Springer, 2016 on Pith
  2. [2] Francesco Ricci, Lior Rokach, and Bracha Shapira. Recommender systems: Techniques, applications, and challenges. In Francesco Ricci, Lior Rokach, and Bracha Shapira, editors, Recommender Systems Handbook, pages 1–35. Springer US, 2022 on Pith
  3. [3] Zihuai Zhao, Wenqi Fan, Jiatong Li, Yunqing Liu, Xiaowei Mei, Yiqi Wang, Zhen Wen, Fei Wang, Xiangyu Zhao, Jiliang Tang, and Qing Li. Recommender systems in the era of large language models (llms).IEEE Trans. Knowl. Data Eng., 36(11):6889–6907, 2024 on Pith
  4. [4] Jianghao Lin, Xinyi Dai, Yunjia Xi, Weiwen Liu, Bo Chen, Hao Zhang, Yong Liu, Chuhan Wu, Xiangyang Li, Chenxu Zhu, Huifeng Guo, Yong Yu, Ruiming Tang, and Weinan Zhang. How can recommender systems benefit from large language models: A survey.ACM Trans. Inf. Syst., 43(2):28:1–2... on Pith
  5. [5] Qing Yu, Xiaobei Wang, Shuchang Liu, cheng.feng, Xiaoyu Yang, Xueliang Wang, Chang Meng, Shanshan Wu, HailanYang, Bin Wen, Huihui Xiao, Xiang Li, Fan Yang, Xiaoqiang Feng, Lantao Hu, Han Li, Kun Gai, and Lixin Zou. Who you are matters: Bridging interests and social roles via L... on Pith
  6. [6] Qijiong Liu, Jieming Zhu, Lu Fan, Kun Wang, Hengchang Hu, Wei Guo, Yong Liu, and Xiao- Ming Wu. Can LLMs outshine conventional recommenders? a comparative evaluation. In The Thirty-ninth Annual Conference on Neural Information Processing Systems Datasets and Benchmarks Track, 2026 on Pith
  7. [7] Yashar Deldjoo, Zhankui He, Julian J. McAuley, Anton Korikov, Scott Sanner, Arnau Ramisa, René Vidal, Maheswaran Sathiamoorthy, Atoosa Kasirzadeh, and Silvia Milano. A review of modern recommender systems using generative models (gen-recsys). In Ricardo Baeza- Yates and France... on Pith
  8. [9] Jiaqi Zhai, Lucy Liao, Xing Liu, Yueming Wang, Rui Li, Xuan Cao, Leon Gao, Zhaojie Gong, Fangda Gu, Jiayuan He, Yinghai Lu, and Yu Shi. Actions speak louder than words: Trillion- parameter sequential transducers for generative recommendations. In Ruslan Salakhutdinov, Zico Kol... on Pith
  9. [10] Guorui Zhou, Jiaxin Deng, Jinghao Zhang, Kuo Cai, Lejian Ren, Qiang Luo, Qianqian Wang, Qigen Hu, Rui Huang, Shiyao Wang, Weifeng Ding, Wuchao Li, Xinchen Luo, Xingmei Wang, Zexuan Cheng, Zixing Zhang, Bin Zhang, Boxuan Wang, Chaoyi Ma, Chengru Song, Chenhui Wang, Di Wang, Don... on PitharXiv
  10. [11] Xiaoxi Li, Jiajie Jin, Yujia Zhou, Yuyao Zhang, Peitian Zhang, Yutao Zhu, and Zhicheng Dou. From matching to generation: A survey on generative information retrieval.ACM Trans. Inf. Syst., 43(3):83:1–83:62, 2025 on Pith
  11. [12] Yupeng Hou, Jiacheng Li, Xiangjun Fu, Zhankui He, An Yan, Xiusi Chen, and Julian McAuley. Bridging language and items for retrieval and recommendation: Benchmarking llms as semantic encoders, 2026 on Pith
  12. [13] Shuchang Liu, Qingpeng Cai, Zhankui He, Bowen Sun, Julian J. McAuley, Dong Zheng, Peng Jiang, and Kun Gai. Generative flow network for listwise recommendation. In Ambuj K. Singh, Yizhou Sun, Leman Akoglu, Dimitrios Gunopulos, Xifeng Yan, Ravi Kumar, Fatma Ozcan, and Jieping Ye... on Pith
  13. [14] Yanhua Huang, Yuqi Chen, Xiong Cao, Rui Yang, Mingliang Qi, Yinghao Zhu, Qingchang Han, Yaowei Liu, Zhaoyu Liu, Xuefeng Yao, Yuting Jia, Leilei Ma, Yinqi Zhang, Taoyu Zhu, Liujie Zhang, Lei Chen, Weihang Chen, Min Zhu, Ruiwen Xu, and Lei Zhang. Towards large-scale generative r... on PithPith's reviewarXiv
  14. [15] Kaike Zhang, Xiaobei Wang, Shuchang Liu, HailanYang, Xiang Li, Lantao Hu, Han Li, Qi Cao, Fei Sun, and Kun Gai. Goalrank: Group-relative optimization for a large ranking model. InThe Fourteenth International Conference on Learning Representations, 2026 on Pith
  15. [16] Pengyue Jia, Xiaobei Wang, Yingyi Zhang, Shuchang Liu, Yupeng Hou, Hailan Yang, Xu Gao, Xiaopeng Li, Yejing Wang, Julian McAuley, et al. From local indices to global identi- fiers: Generative reranking for recommender systems via global action space.arXiv preprint arXiv:2604.2... on PithPith's reviewarXiv
  16. [17] Shijie Geng, Shuchang Liu, Zuohui Fu, Yingqiang Ge, and Yongfeng Zhang. Recommendation as language processing (RLP): A unified pretrain, personalized prompt & predict paradigm (P5). In Jennifer Golbeck, F. Maxwell Harper, Vanessa Murdock, Michael D. Ekstrand, Bracha Shapira, J... on Pith
  17. [18] Wenjie Wang, Honghui Bao, Xinyu Lin, Jizhi Zhang, Yongqi Li, Fuli Feng, See-Kiong Ng, and Tat-Seng Chua. Learnable item tokenization for generative recommendation. In Edoardo Serra and Francesca Spezzano, editors,Proceedings of the 33rd ACM International Conference on Informat... on Pith
  18. [19] Xiaopeng Li, Bo Chen, Junda She, Shiteng Cao, You Wang, Qinlin Jia, Haiying He, Zheli Zhou, Zhao Liu, Ji Liu, et al. A survey of generative recommendation from a tri-decoupled perspective: Tokenization, architecture, and optimization. 2025 on Pith
  19. [20] Hai Zhu, Yantao Yu, Lei Shen, Bing Wang, and Xiaoyi Zeng. Gatesid: Adaptive gating for semantic-collaborative alignment in cold-start recommendation.CoRR, abs/2603.22916, 2026 on PithPith's reviewarXiv
  20. [21] Jiawei Feng, Xiaoyu Kong, Leheng Sheng, Bin Wu, Chao Yi, Feifang Yang, Xiang-Rong Sheng, Han Zhu, Xiang Wang, Jiancan Wu, and Xiangnan He. Fine-grained semantics integration for large language model-based recommendation.CoRR, abs/2602.22632, 2026 on PithPith's reviewarXiv
show 62 more
  1. [22] Jiaju Chen, Wang Wenjie, Chongming Gao, Peng Wu, Jianxiong Wei, and Qingsong Hua. Treat- ment effect estimation for user interest exploration on recommender systems. InProceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retriev... on Pith
  2. [23] Seyed Amir Bidaki, Amir Mohammadkhah, Kiyan Rezaee, Faeze Hassani, Sadegh Eskandari, Maziar Salahi, and Mohammad M. Ghassemi. Online continual learning: A systematic literature review of approaches, challenges, and benchmarks.CoRR, abs/2501.04897, 2025 on PithPith's reviewarXiv
  3. [24] Chongming Gao, Shijun Li, Wenqiang Lei, Jiawei Chen, Biao Li, Peng Jiang, Xiangnan He, Jiaxin Mao, and Tat-Seng Chua. Kuairec: A fully-observed dataset and insights for evaluating recommender systems. In Mohammad Al Hasan and Li Xiong, editors,Proceedings of the 31st ACM Inter... on Pith
  4. [25] Kairui Fu, Tao Zhang, Shuwen Xiao, Ziyang Wang, Xinming Zhang, Chenchi Zhang, Yuliang Yan, Junjun Zheng, Yu Li, Zhihong Chen, Jian Wu, Xiangheng Kong, Shengyu Zhang, Kun Kuang, Yu-Gang Jiang, and Bo Zheng. FORGE: forming semantic identifiers for generative retrieval in industr... on PithPith's reviewarXiv
  5. [26] Everton Lima Aleixo, Juan Gabriel Colonna, Marco Cristo, and Everlandio Fernandes. Catas- trophic forgetting in deep learning: A comprehensive taxonomy.J. Braz. Comput. Soc., 30(1), 2024 on Pith
  6. [27] Ke Wan, Yi Liang, and Susik Yoon. Online drift detection with maximum concept discrepancy. In Ricardo Baeza-Yates and Francesco Bonchi, editors,Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2024, Barcelona, Spain, August 25-29, 2024,... on Pith
  7. [28] Rahaf Aljundi, Min Lin, Baptiste Goujaud, and Yoshua Bengio. Gradient based sample selection for online continual learning. In Hanna M. Wallach, Hugo Larochelle, Alina Beygelzimer, Flo- rence d’Alché-Buc, Emily B. Fox, and Roman Garnett, editors,Advances in Neural Information ... on Pith
  8. [29] Jaime G. Carbonell and Jade Goldstein. The use of mmr, diversity-based reranking for re- ordering documents and producing summaries. In W. Bruce Croft, Alistair Moffat, C. J. van Rijsbergen, Ross Wilkinson, and Justin Zobel, editors,SIGIR ’98: Proceedings of the 21st Annual In... on Pith
  9. [30] Cai-Nicolas Ziegler, Sean M. McNee, Joseph A. Konstan, and Georg Lausen. Improving recommendation lists through topic diversification. In Allan Ellis and Tatsuya Hagino, editors, Proceedings of the 14th international conference on World Wide Web, WWW 2005, Chiba, Japan, May 10... on Pith
  10. [31] Yuying Zhao, Yu Wang, Yunchao Liu, Xueqi Cheng, Charu C. Aggarwal, and Tyler Derr. Fairness and diversity in recommender systems: A survey.ACM Trans. Intell. Syst. Technol., 16(1):2:1–2:28, 2025 on Pith
  11. [32] Jiaqi Ma, Zhe Zhao, Xinyang Yi, Jilin Chen, Lichan Hong, and Ed H. Chi. Modeling task relationships in multi-task learning with multi-gate mixture-of-experts. In Yike Guo and Faisal Farooq, editors,Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discov... on Pith
  12. [33] Hongyan Tang, Junning Liu, Ming Zhao, and Xudong Gong. Progressive layered extraction (PLE): A novel multi-task learning (MTL) model for personalized recommendations. In Rodrygo L. T. Santos, Leandro Balby Marinho, Elizabeth M. Daly, Li Chen, Kim Falk, Noam Koenigstein, and Ed... on Pith
  13. [34] Yuhao Wang, Ha Tsz Lam, Yi Wong, Ziru Liu, Xiangyu Zhao, Yichao Wang, Bo Chen, Huifeng Guo, and Ruiming Tang. Multi-task deep recommender systems: A survey.CoRR, abs/2302.03525, 2023 on PithPith's reviewarXiv
  14. [35] Zijian Zhang, Shuchang Liu, Jiaao Yu, Qingpeng Cai, Xiangyu Zhao, Chunxu Zhang, Ziru Liu, Qidong Liu, Hongwei Zhao, Lantao Hu, Peng Jiang, and Kun Gai. M3oe: Multi-domain multi-task mixture-of experts recommendation framework. In Grace Hui Yang, Hongning Wang, Sam Han, Claudia... on Pith
  15. [36] Jiaju Chen, Chongming Gao, Shuai Yuan, Shuchang Liu, Qingpeng Cai, and Peng Jiang. Dlcrec: A novel approach for managing diversity in llm-based recommender systems. InProceedings of the Eighteenth ACM International Conference on Web Search and Data Mining, pages 857–865, 2025 on Pith
  16. [37] Zhanyu Liu, Shiyao Wang, Xingmei Wang, Rongzhou Zhang, Jiaxin Deng, Honghui Bao, Jinghao Zhang, Wuchao Li, Pengfei Zheng, Xiangyu Wu, Yifei Hu, Qigen Hu, Xinchen Luo, Lejian Ren, Zixing Zhang, Qianqian Wang, Kuo Cai, Yunfan Wu, Hongtao Cheng, Zexuan Cheng, Lu Ren, Huanjie Wang... on PitharXiv
  17. [38] Yang Yu, Lei Kou, Huaikuan Yi, Bin Chen, Yayu Cao, Lei Shen, Chao Zhang, Bing Wang, and Xiaoyi Zeng. SIGMA: A semantic-grounded instruction-driven generative multi-task recommender at aliexpress.CoRR, abs/2602.22913, 2026 on PithPith's reviewarXiv
  18. [39] Xiaofeng Liu, Wenliang Li, Tao Yu, Guanliang Song, Zhen Chen, Jing Zhou, Dongyue Wang, Xiwei Zhao, and Sulong Xu. From modularity to unity: Towards industrial-scale generative recommendation. In Hakim Hacid, Yoelle Maarek, Francesco Bonchi, Ido Guy, and Emine Yilmaz, editors,P... on Pith
  19. [40] Hongxun Ding, Keqin Bao, Jizhi Zhang, Yi Fang, Wenxin Xu, Fuli Feng, and Xiangnan He. Towards sample-efficient and stable reinforcement learning for llm-based recommendation. CoRR, abs/2602.00632, 2026 on PitharXiv
  20. [41] Ruining He and Julian J. McAuley. VBPR: visual bayesian personalized ranking from implicit feedback. In Dale Schuurmans and Michael P. Wellman, editors,Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA, pages 1... on Pith
  21. [42] Da Li, Yuxiao Luo, Keping Bi, Jiafeng Guo, Wei Yuan, Biao Yang, Yan Wang, Fan Yang, Tingting Gao, and Guorui Zhou. Compressing then matching: An efficient pre-training paradigm for multimodal embedding. In Maria Liakata, Viviane P. Moreira, Jiajun Zhang, and David 13 Jurgens, ... on Pith
  22. [43] Jinke Wu, Yinghao Wu, Shuchang Liu, Yandong Bai, Qi Zhu, Huihui Xiao, and Fan Yang. GUIDER: generative user interest discovery via explicit reasoning with large language models. In Won Kim, Jae-Gil Lee, Kyuseok Shim, James Caverlee, David F. Gleich, Xiangliang Zhang, Qi He, Fa... on Pith
  23. [44] Wang-Cheng Kang and Julian J. McAuley. Self-attentive sequential recommendation. InIEEE International Conference on Data Mining, ICDM 2018, Singapore, November 17-20, 2018, pages 197–206. IEEE Computer Society, 2018 on Pith
  24. [45] Balázs Hidasi, Alexandros Karatzoglou, Linas Baltrunas, and Domonkos Tikk. Session-based recommendations with recurrent neural networks. In Yoshua Bengio and Yann LeCun, editors, 4th International Conference on Learning Representations, ICLR 2016, San Juan, Puerto Rico, May 2-... on Pith
  25. [46] Shashank Rajput, Nikhil Mehta, Anima Singh, Raghunandan Hulikal Keshavan, Trung Vu, Lukasz Heldt, Lichan Hong, Yi Tay, Vinh Q. Tran, Jonah Samost, Maciej Kula, Ed H. Chi, and Mahesh Sathiamoorthy. Recommender systems with generative retrieval. In Alice Oh, Tristan Naumann, Ami... on Pith
  26. [47] Teng Shi, Chenglei Shen, Weijie Yu, Shen Nie, Chongxuan Li, Xiao Zhang, Ming He, Yan Han, and Jun Xu. Llada-rec: Discrete diffusion for parallel semantic ID generation in generative recommendation.CoRR, abs/2511.06254, 2025 on PitharXiv
  27. [48] Xiaoyu Kong, Leheng Sheng, Junfei Tan, Yuxin Chen, Jiancan Wu, An Zhang, Xiang Wang, and Xiangnan He. Minionerec: An open-source framework for scaling generative recommendation. CoRR, abs/2510.24431, 2025 on PitharXiv
  28. [49] Bin Wu, Feifan Yang, Zhangming Chan, Yu-Ran Gu, Jiawei Feng, Chao Yi, Xiang-Rong Sheng, Han Zhu, Jian Xu, Mang Ye, and Bo Zheng. MUSE: A simple yet effective multimodal search-based framework for lifelong user interest modeling.CoRR, abs/2512.07216, 2025 on PitharXiv
  29. [50] Jaime Carbonell and Jade Goldstein. The use of mmr, diversity-based reranking for reordering documents and producing summaries. InProceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR ’98, page 335–336, Ne... on Pith
  30. [51] Cai-Nicolas Ziegler, Sean M. McNee, Joseph A. Konstan, and Georg Lausen. Improving recommendation lists through topic diversification. InProceedings of the 14th International Conference on World Wide Web, WWW ’05, page 22–32, New York, NY , USA, 2005. Associa- tion for Computi... on Pith
  31. [52] Charles L.A. Clarke, Maheedhar Kolla, Gordon V . Cormack, Olga Vechtomova, Azin Ashkan, Stefan Büttcher, and Ian MacKinnon. Novelty and diversity in information retrieval evaluation. InProceedings of the 31st Annual International ACM SIGIR Conference on Research and Developmen... on Pith
  32. [53] Laming Chen, Guoxin Zhang, and Hanning Zhou. Fast greedy map inference for determinantal point process to improve recommendation diversity. InProceedings of the 32nd International Conference on Neural Information Processing Systems, NIPS’18, page 5627–5638, Red Hook, NY , USA,... on Pith
  33. [54] Mike Gartrell, Ulrich Paquet, and Noam Koenigstein. Bayesian low-rank determinantal point processes. InProceedings of the 10th ACM Conference on Recommender Systems, RecSys ’16, page 349–356, New York, NY , USA, 2016. Association for Computing Machinery on Pith
  34. [55] Nathaniel Good, J. Ben Schafer, Joseph A. Konstan, Al Borchers, Badrul Sarwar, Jon Herlocker, and John Riedl. Combining collaborative filtering with personal agents for better recommenda- tions. InProceedings of the Sixteenth National Conference on Artificial Intelligence and ... on Pith
  35. [56] Lijing Qin and Xiaoyan Zhu. Promoting diversity in recommendation by entropy regularizer. InProceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI ’13, page 2698–2704. AAAI Press, 2013 on Pith
  36. [57] Yi Ren, Xiao Han, Xu Zhao, Shenzheng Zhang, and Yan Zhang. Slate-aware ranking for recommendation. InProceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, WSDM ’23, page 499–507, New York, NY , USA, 2023. Association for Computing Machinery on Pith
  37. [58] Shuchang Liu, Fei Sun, Yingqiang Ge, Changhua Pei, and Yongfeng Zhang. Variation control and evaluation for generative slate recommendations. InProceedings of the Web Conference 2021, WWW ’21, page 436–448, New York, NY , USA, 2021. Association for Computing Machinery on Pith
  38. [59] Jun Wang, Lantao Yu, Weinan Zhang, Yu Gong, Yinghui Xu, Benyou Wang, Peng Zhang, and Dell Zhang. IRGAN: A minimax game for unifying generative and discriminative information retrieval models. In Noriko Kando, Tetsuya Sakai, Hideo Joho, Hang Li, Arjen P. de Vries, and Ryen W. W... on Pith
  39. [60] Dawen Liang, Rahul G. Krishnan, Matthew D. Hoffman, and Tony Jebara. Variational autoen- coders for collaborative filtering. In Pierre-Antoine Champin, Fabien Gandon, Mounia Lalmas, and Panagiotis G. Ipeirotis, editors,Proceedings of the 2018 World Wide Web Conference on World... on Pith
  40. [61] Irwan Bello, Sayali Kulkarni, Sagar Jain, Craig Boutilier, Ed Huai-hsin Chi, Elad Eban, Xiyang Luo, Alan Mackey, and Ofer Meshi. Seq2slate: Re-ranking and slate optimization with rnns. CoRR, abs/1810.02019, 2018 on PithPith's reviewarXiv
  41. [62] Diederik P. Kingma and Max Welling. Auto-encoding variational bayes. In Yoshua Bengio and Yann LeCun, editors,2nd International Conference on Learning Representations, ICLR 2014, Banff, AB, Canada, April 14-16, 2014, Conference Track Proceedings, 2014 on Pith
  42. [63] Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron C. Courville, and Yoshua Bengio. Generative adversarial nets. In Zoubin Ghahramani, Max Welling, Corinna Cortes, Neil D. Lawrence, and Kilian Q. Weinberger, editors,Advances i... on Pith
  43. [64] Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N. Gomez, Lukasz Kaiser, and Illia Polosukhin. Attention is all you need. In Isabelle Guyon, Ulrike von Luxburg, Samy Bengio, Hanna M. Wallach, Rob Fergus, S. V . N. Vishwanathan, and Roman Garnett,... on Pith
  44. [65] Hao Guo, Erpeng Xue, Lei Huang, Shichao Wang, Xiaolei Wang, Lei Wang, Jinpeng Wang, Zeshun Li, and Sheng Chen. Twin-flow generative ranking network for recommendation. In Meeyoung Cha, Chanyoung Park, Noseong Park, Carl Yang, Senjuti Basu Roy, Jessie Li, 15 Jaap Kamps, Kijung ... on Pith
  45. [66] Hongyu Yao, Zijin Hong, Hao Chen, Zhiqing Li, Qijie Shen, Zuobin Ying, Qihua Feng, Huan Gong, and Feiran Huang. Macro graph of experts for billion-scale multi-task recommendation. InProceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V .1, KDD ... on Pith
  46. [67] Jingtong Gao, Bo Chen, Xiangyu Zhao, Weiwen Liu, Xiangyang Li, Yichao Wang, Wanyu Wang, Huifeng Guo, and Ruiming Tang. Llm4rerank: Llm-based auto-reranking framework for recommendations. In Guodong Long, Michale Blumestein, Yi Chang, Liane Lewin-Eytan, Zi Helen Huang, and Elad... on Pith
  47. [68] Shuo Liu, An Zhang, Guoqing Hu, Hong Qian, and Tat-Seng Chua. Preference diffusion for recommendation. InThe Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025. OpenReview.net, 2025 on Pith
  48. [69] Guoqing Hu, Zhengyi Yang, Zhibo Cai, An Zhang, and Xiang Wang. Generate and instantiate what you prefer: Text-guided diffusion for sequential recommendation.CoRR, abs/2410.13428, 2024 on PithPith's reviewarXiv
  49. [70] Chao Yi, Feifan Yang, Jiawei Feng, Sishuo Chen, Zhangming Chan, Xiang-Rong Sheng, and Han Zhu. Native multimodal representation learning for click-through rate prediction in e-commerce scenarios.CoRR, abs/2608.24091, 2026 on PithPith's reviewarXiv
  50. [71] Shuchang Liu, Fei Sun, Yingqiang Ge, Changhua Pei, and Yongfeng Zhang. Variation control and evaluation for generative slate recommendations. In Jure Leskovec, Marko Grobelnik, Marc Najork, Jie Tang, and Leila Zia, editors,WWW ’21: The Web Conference 2021, Virtual Event / Ljub... on Pith
  51. [72] Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising diffusion probabilistic models. In Hugo Larochelle, Marc’Aurelio Ranzato, Raia Hadsell, Maria-Florina Balcan, and Hsuan-Tien Lin, editors,Advances in Neural Information Processing Systems 33: Annual Conference on Neural Info... on Pith
  52. [73] Zihao Li, Aixin Sun, and Chenliang Li. Diffurec: A diffusion model for sequential recommen- dation.ACM Trans. Inf. Syst., 42(3):66:1–66:28, 2024 on Pith
  53. [74] Wenyu Mao, Shuchang Liu, HailanYang, Xiaobei Wang, Xiaoyu Yang, Xu Gao, Xiang Li, Lantao Hu, Han Li, Kun Gai, An Zhang, and Xiang Wang. Denoising neural reranker for rec- ommender systems. InThe Fourteenth International Conference on Learning Representations, 2026 on Pith
  54. [75] Guoqing Hu, An Zhang, Shuchang Liu, Wenyu Mao, Jiancan Wu, Xun Yang, Xiang Li, Lantao Hu, Han Li, Kun Gai, and Xiang Wang. Fading to grow: Growing preference ratios via preference fading discrete diffusion for recommendation. InThe Thirty-ninth Annual Conference on Neural Info... on Pith
  55. [76] Xiao Lin, Xiaokai Chen, Chenyang Wang, Hantao Shu, Linfeng Song, Biao Li, and Peng Jiang. Discrete conditional diffusion for reranking in recommendation. In Tat-Seng Chua, Chong-Wah Ngo, Roy Ka-Wei Lee, Ravi Kumar, and Hady W. Lauw, editors,Companion Proceedings of the ACM on ... on Pith
  56. [77] Jiaju Chen, Chongming Gao, Chenxiao Fan, Haoyan Liu, Qingpeng Cai, Peng Jiang, and Xiangnan He. Position-aware drafting for inference acceleration in llm-based generative list- wise recommendation.arXiv preprint arXiv:2604.27747, 2026 on PithPith's reviewarXiv
  57. [78] Liyuan Wang, Xingxing Zhang, Hang Su, and Jun Zhu. A comprehensive survey of continual learning: Theory, method and application.IEEE Trans. Pattern Anal. Mach. Intell., 46(8):5362– 5383, 2024. 16 on Pith
  58. [79] Xu Huang, Jiancan Wu, Hongzheng Qin, Jiawei Feng, Can Ye, Wencong Zeng, Fengze Li, and Xiang Wang. Generative recommenders forget the long tail: Restoring memorization in retrieval and ranking, 2026 on Pith
  59. [80] Hongyi Wan, Shiyuan Ren, Wei Huang, Miao Zhang, Xiang Deng, Yixin Bao, and Liqiang Nie. Understanding the forgetting of (Replay-based) continual learning via feature learning: Angle matters. In Aarti Singh, Maryam Fazel, Daniel Hsu, Simon Lacoste-Julien, Felix Berkenkamp, Tega... on Pith
  60. [81] Gyuseok Lee, Hyunsik Yoo, Junyoung Hwang, SeongKu Kang, and Hwanjo Yu. Leveraging historical and current interests for continual sequential recommendation.CoRR, abs/2506.07466, 2025 on PitharXiv
  61. [82] Hyunsik Yoo, Ting-Wei Li, SeongKu Kang, Zhining Liu, Charlie Xu, Qilin Qi, and Hanghang Tong. Continual low-rank adapters for llm-based generative recommender systems.CoRR, abs/2510.25093, 2025. 17 NeurIPS Paper Checklist 1.Claims Question: Do the main claims made in the abstr... on PitharXiv
  62. [83] Institutional review board (IRB) approvals or equivalent for research with human subjects Question: Does the paper describe potential risks incurred by study participants, whether such risks were disclosed to the subjects, and whether Institutional Review Board (IRB) approvals... on Pith

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment