The paper introduces the Preference Dependency Graph Framework (PDG‑F) for narrative‑driven recommendation, where user requests are parsed into a directed acyclic graph that captures how preferences qualify and condition one another. PDG‑A builds this graph from free‑form text, retrieves candidate evidence via directed path retrieval, and ranks recommendations using topological path ranking. Experiments across English and Chinese domains show PDG‑F outperforms baselines, retrieval agents, and state‑of‑the‑art language models, highlighting the importance of modeling preference dependencies.
arXiv:2607. 25420v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly used in recommender systems, but it is often unclear how much performance can be obtained from strong pre-trained backbones alone when they are placed inside a structured recommendation pipeline.
By Jiahao Tian, Zhenkai Wang
Large language models (LLMs) are increasingly used in recommender systems, but it is often unclear how much performance can be obtained from strong pre-trained backbones alone when they are placed inside a structured recommendation pipeline. In this paper, we present MARS, a modular multi-agent re-ranking framework for repeat-order food delivery recommendation.
LIGE‑GR is a framework that transitions traditional ranking‑based recommender systems to a generative, listwise approach inspired by large language models. It extends existing pointwise recommendation models into a listwise generation system, enabling sequence‑level optimization without overhauling the entire infrastructure. Experiments on Instagram Reels and Facebook Video show modest gains in user time spent—1.14 % and 0.72 % respectively—while adding only slight inference overhead.
By Venkat Srinivas, Chenzhang He, Sam Woodmansee, Shawn Lian, Wenjie Hu, Renjie Jiang, Ziheng Huang, Xinyuan Zhang, Zhihao Zheng, Zhuoran Yu, Rui Li, Lei Yuan, Ziwei Li, Jimmy Jia, Mert Terzihan, Ekrem Kocaguneli, Yiming Liao, Zhichen Zhao, Yue Yin, Yue Weng, Wanlin Ma, Xufeng Cai, Weimiao Wu, Yezhou Huang, Du Zhang, Yukun Ding, Aaron Johnston, Yueming Wang, Zhaojie Gong, Yuting Zhang, Serena Li, Adithya Ganesh, Boying Liu, Haichuan Yang, Xialu Li, Matt Ma, Qunshu Zhang, John Joshua Miller, Praveen Rathinavelu, Cheng Huang, Aadhar Sachdeva, Josh Karns, Andres Aaron Gutierrez, Neil Agarwal, Gustas Pladis, Vladimir Batygin, Gopal Ray, Aditya Priyadarshi, Shantanu Patil, Zhe Wang, Penny Pan, Yiping Han, Arun Singh, Guangdeng Liao, Bi Xue, Xinyao Hu, Yang Song, Yisong Song, Meihong Wang, Haotian Wu, Deepak Agarwal, Ji Liu
REGER is a unified framework that enhances generative recommendation by explicitly modeling inter-item relations through semantic pretraining, history encoding, and SID generation. It pretrains the model to generate semantic neighbors’ IDs, uses combined global and local attention to capture historical context, and introduces a hierarchical preference decomposition over the SID prefix tree. The approach also distills a discriminative teacher’s full conditional distributions to improve next-token predictions, yielding consistent performance gains on real-world datasets.
By Yuxi Huang, Silin Zhou, Chenhao Wang, Zihan Li, Gangming Guo, Pei Ke, Shen Gao, Shuo Shang
arXiv:2606. 15741v1 Announce Type: cross Abstract: Narrative question answering (NQA) is a challenging task in natural language processing that requires models to understand long textual contexts, capture relationships across events, and generate coherent responses.
By Molham Mohamed, Ali Hamdi
REGER is a framework that enhances generative recommendation by explicitly modeling inter-item relations through semantic pretraining, refined history encoding, and SID generation. It pretrains the model to generate semantic neighbors’ IDs, uses a combination of global and local attention to capture context, and introduces a hierarchical preference decomposition that allows exact factorization of collaborative preferences. The method also distills a discriminative teacher’s full conditional distributions to improve next-token predictions, yielding consistent performance gains on real-world datasets.
arXiv:2608. 14011v1 Announce Type: cross Abstract: Generative recommendation autoregressively generates the semantic IDs of the target item, unifying preference modeling and index retrieval within the shared token space.
By Haokai Ma, Aoqi Hu, Yueao Xing, Ruobing Xie, Yonghui Yang, Teng Tu, Lei Meng, Tat-Seng Chua
arXiv:2603. 16410v2 Announce Type: replace-cross Abstract: Creative plot generation presents a fundamental challenge for language models: transforming a concise premise into a coherent narrative that sustains global coherence, character development, pacing, tone consistency, and emotional progression.
By Abhinav Thorat, Ravi Kolla, Jyotin Goel, Madhav Kataria, Niranjan Pedanekar
arXiv:2608. 09605v1 Announce Type: cross Abstract: Large Language Models (LLMs) have emerged as powerful tools for improving recommendation systems.
By Wenqiao Zhu, Chao Xu, Haipang Wu, Ji Liu
arXiv:2609.16070v1 Announce Type: cross
Abstract: Generative recommendation reformulates item prediction as semantic identifier generation, yet episodic content introduces a fundamentally different s...
By Chenxing Wang, Nantao Zheng, Hao Miao, Juyuan Wang, Xinke Jiang, Yuchen Fang, Aolin Li, Haijun Wu
arXiv:2609.15094v1 Announce Type: cross
Abstract: In industrial recommendation feeds, presenting a static headline for an item often fails to satisfy the diverse, multimodal interests of the user pop...
By Yi Chen, Rufeng Cheng, Qiang Xie, Tao Li