Modeling Preference Dependencies with Directed Acyclic Graphs for Narrative-Driven Recommendation
Authors: Mingzhe Lu, Jian Qin, Ruize Qin, Jinhao Liu, Yunpeng Li, Hang Su
Organizations: Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China · School of Cyber Security, University of Chinese Academy of Sciences, Beijing, China · Faculty of Engineering and IT, The University of Melbourne, Melbourne, Australia · Independent Researcher
Narrative-driven recommendation allows users to express multifaceted needs through free-form text where stated preferences naturally qualify and condition one another. Existing methods typically treat narratives as flat keyword combinations or unconstrained generative queries, failing to capture how complex preferences hierarchically refine and contextualize each other. We propose the Preference Dependency Graph Framework (PDG-F), a narrative-driven recommendation framework centered on explicit preference dependencies. Specifically, PDG-A (PDG-Agent) first parses unstructured requests to organize user preferences and their mutual qualifications into a directed acyclic Preference Dependency Graph (PDG). Through this graph, candidate evidence from the open Web is acquired via directed path retrieval, and final recommendations are determined by topological path ranking. Comprehensive experiments across three diverse domains spanning English and Chinese contexts confirm that PDG-F consistently achieves superior recommendation performance over competitive baselines, open-domain retrieval agents, and frontier language models. Further diagnostic analyses show that our dependency-guided retrieval markedly raises the attainable candidate-pool ceiling, demonstrating the fundamental value of modeling preference dependencies in narrative-driven recommendation.
Figures & tables
Figure 1. Overview of PDG-F. PDG-A constructs the preference dependency graph, which guides directed path retrieval and topological path ranking. Overview of PDG-F. PDG-A constructs the preference dependency graph, which guides directed path retrieval and topological path ranking.
Method
Movie
Book
Anime
P@10
R@10
NDCG@10
P@10
R@10
NDCG@10
P@10
R@10
NDCG@10
qwen3.8-27B
0.2730
0.1645
0.3280
0.1100
0.0989
0.1492
0.0267
0.0383
0.0429
minimax-m3
0.3070
0.1885
0.3647
0.1900
0.1589
0.2606
0.0633
0.0791
0.0979
deepseek-v4-pro
0.3170
0.1954
0.3753
0.1867
0.1648
0.2526
0.0567
0.0736
0.0884
OCG-Agent
0.2410
0.1448
0.2647
0.2200
0.2299
0.3264
0.1133
0.1356
0.1901
OCG-Agent (+Year)
0.2880
0.1693
0.3284
0.2200
0.2299
0.3264
0.1167
0.1389
0.1922
Table 1. Main comparison results. Best values are bold; second-best values are underlined. For ties, only the last occurrence in each column is marked.
Figure 2. Recall at cutoffs k∈[1,50] . Shaded bands denote 95% bootstrap confidence intervals. The dashed PDG-F curves largely overlap with the solid PDG-F (+Year) curves on Book and Anime. Recall at cutoffs k∈[1,50]. Shaded bands denote 95% bootstrap confidence intervals. The dashed PDG-F curves largely overlap with the solid PDG-F (+Year) curves on Book and Anime.
Dataset
Method
Avg. candidates
Pool recall
Movie
PDG-F (+Year)
251.84
0.4858
OCG-Agent
22.52
0.2102
Book
PDG-F (+Year)
687.33
0.5481
OCG-Agent
17.63
0.2854
Anime
PDG-F (+Year)
366.30
0.4734
OCG-Agent
17.33
0.1672
Table 2. Candidate-pool size and relevant-item coverage.
Figure 3. Ground truth item overlap between candidate pools. Ground truth item overlap between candidate pools.
Strategy
Movie
Book
Anime
Random
0.0641
0.0163
0.0242
Mean node
0.1506
0.0178
0.0667
Max node
0.3205
0.1997
0.1255
Full strategy
0.4511
0.5101
0.3085
Table 3. Evaluation of candidate ranking strategies.
Figure 4. Relevance rates across score deciles. Relevance rates across score deciles.
Figure 5. Decomposition of ideal NDCG@10 into pool and ranking gaps. Decomposition of ideal NDCG@10 into pool and ranking gaps.
Large Language Models (LLMs) have shown strong potential for recommendation by leveraging their semantic understanding and contextual modeling capabilities. Recent studies further introduce reasoning mechanisms to improve user preference modeling. However, explicit natural-language reasoning incurs substantial inference overhead, whereas existing latent reasoning methods mainly focus on generating or verifying intermediate states, leaving their layer-wise preference roles and contributions insufficiently characterized. We propose HiLaR, a Hierarchical Latent Reasoning framework with layer-aware reinforcement optimization for LLM-based recommendation. HiLaR constructs temporal-guided hierarchical user preference representations, aligns them with multiple LLM latent reasoning states, and organizes the reasoning process from broad preferences to fine-grained current intents. To further optimize the reasoning trajectory, HiLaR combines final recommendation feedback with layer-aware process rewards derived from the marginal target-likelihood gain of each state. Experiments on four Amazon benchmark datasets show that HiLaR generally outperforms strong sequential, generative, and LLM-based recommendation baselines. Ablation and sensitivity analyses further verify the contribution of hierarchical representation learning, latent alignment, and process-level optimization. Our code is available in https://github.com/hupeiyu21/HiLaR.
Peiyu Hu, Siying Gu, Weihai Lu +8
1Xi’an Jiaotong-Liverpool University · 2Xiaohongshu · 3Peking University +1
Situated conversational recommendation (SCR), which utilizes visual scenes grounded in specific environments and natural language dialogue to deliver contextually appropriate recommendations, has emerged as a promising research direction due to its close alignment with real-world scenarios. Compared to traditional recommendations, SCR requires a deeper understanding of dynamic and implicit user preferences, as the surrounding scene often influences users' underlying interests, while both may evolve across conversations. This complexity significantly impacts the timing and relevance of recommendations. To address this, we propose situated preference reasoning (SiPeR), a novel framework that integrates two core mechanisms: (1) Scene transition estimation, which estimates whether the current scene satisfies user needs, and guides the user toward a more suitable scene when necessary; and (2) Bayesian inverse inference, which leverages the likelihood of multimodal large language models (MLLMs) to predict user preferences about candidate items within the scene. Extensive experiments on two representative benchmarks demonstrate SiPeR's superiority in both recommendation accuracy and response generation quality. The code and data are available at https://github.com/DongdingLin/SiPeR.
Dongding Lin, Jian Wang, Yongqi Li +1
Department of Computing, The Hong Kong Polytechnic University · College of Computer Science, Sichuan University
Recommender agents built on Large Language Models offer a promising paradigm for personalized recommendation. However, existing agents typically suffer from a misalignment between their tool-integrated reasoning trajectories and recommendation feedback, limiting their ability to distinguish fine-grained user preferences. To address these challenges, we propose AgenticRec, an agentic recommendation framework that formulates recommendation as a tool-integrated reasoning process over a recommendation-oriented tool suite. Built upon this framework, we further develop a dedicated two-stage training paradigm tailored for recommender agents. In the first stage, we introduce Recommendation-Oriented Trajectory Activation, optimize the agentic recommendation ability under implicit feedback. In the second stage, Progressive Preference Refinement further refines the agent through bidirectional preference reasoning over self-bootstrapped hard pairs, progressively sharpening preference boundaries. Theoretical analysis and extensive experiments demonstrate the effectiveness of AgenticRec. Our code is available at https://anonymous.4open.science/r/AgenticRec-FB16.