P3Rec: Distilling Prior--Posterior Preference Reasoning for LLM-based Recommendation

• URL: http://arxiv.org/abs/2609.13993v2
• Date: Tue, 15 Sep 2026 12:16:58 GMT
• Title: P3Rec: Distilling Prior--Posterior Preference Reasoning for LLM-based Recommendation
• Abstract summary: We propose P$3$Rec, a framework that jointly extracts and internalizes complementary prior and posterior preference reasoning knowledge.<n>P$3$Rec achieves more complete preference reasoning while preserving efficient recommendation.
• Score: 3.449214186081224
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Large language models (LLMs) exhibit strong semantic understanding and preference reasoning capabilities, offering new opportunities for user modeling in recommender systems. Existing LLM-as-Enhancer methods typically distill LLM-derived preference knowledge into lightweight recommenders to avoid costly online LLM inference. However, they often construct distillation knowledge from only one perspective. Prior preference captures users' stable and consistent interests but provides limited guidance for the current decision, whereas posterior preference reveals target-relevant fine-grained interests but may rely excessively on target clues. To address these limitations, we propose P$^3$Rec, a framework that jointly extracts and internalizes complementary prior and posterior preference reasoning knowledge. Specifically, P$^3$Rec first derives target-agnostic prior preferences and target-conditioned posterior preferences from the user side, while further extracting item-centric preference representations from item semantics and predecessor interactions. It then progressively internalizes prior and posterior knowledge into behavioral representations through prior preference absorption and posterior-guided preference distillation. Since the resulting comprehensive preference representation may not always provide an equally decisive retrieval direction, P$^3$Rec further characterizes historical interest dispersion with interest entropy and adaptively calibrates the user representation before contrastive retrieval optimization. In this way, P$^3$Rec achieves more complete preference reasoning while preserving efficient recommendation. Extensive experiments on multiple public datasets demonstrate its effectiveness.

Related papers

• RecRec: Latent Interests Recursive Reasoning for Sequential Recommendation [52.23179023639867]
  Sequential recommender systems rely on a single forward pass to encode user interaction and predict the next item.<n>How to structure the reasoning process for sequential recommendation remains an open question.<n>Existing approaches couple reasoning and prediction in a single $d$-dimensional state, limiting reasoning depth.<n>We propose RecRec (Recursive Reasoning for Recommendation), an RL-free framework that overcomes fixed $d$-dimensional state of methods.
  arXiv  Detail & Related papers  (2026-07-14T16:28:28Z)
• Intuition-Guided Latent Reasoning for LLM-Based Recommendation [72.06271644558291]
  We propose emphIntuRec, a framework that anchors latent reasoning with emphrecommendation intuition.<n>IntuRec consistently outperforms state-of-the-art baselines in experiments on multiple real-world datasets.
  arXiv  Detail & Related papers  (2026-06-26T03:29:48Z)
• Selective Ensemble Based on Preference-Directed Multi-Objective Bandits [90.75513823660775]
  We formalize a sequential decision problem under partially specified linear preferences.<n>We then propose a preference-directed upper confidence bound (PrefUCB) algorithm.<n> Experiments on large pre-trained model selective ensemble tasks and online asset allocation under institutional mandates validate our method.
  arXiv  Detail & Related papers  (2026-06-20T07:52:46Z)
• Enhancing LLM-based Recommendation with Preference Hint Discovery from Knowledge Graph [26.065016082075264]
  We propose a preference hint discovery model based on the interaction-integrated knowledge graph.<n>We develop an instance-wise dual-attention mechanism to quantify the preference credibility of candidate attributes.
  arXiv  Detail & Related papers  (2026-01-26T03:20:42Z)
• Tree of Preferences for Diversified Recommendation [54.183647833064136]
  We study diversified recommendation from a data-bias perspective.<n>Inspired by the outstanding performance of large language models (LLMs) in zero-shot inference leveraging world knowledge, we propose a novel approach.
  arXiv  Detail & Related papers  (2025-12-24T04:13:17Z)
• R$^2$ec: Towards Large Recommender Models with Reasoning [59.32598867813266]
  We propose R$2$ec, a unified large recommender model with intrinsic reasoning capability.<n>R$2$ec introduces a dual-head architecture that supports both reasoning chain generation and efficient item prediction in a single model.<n>To overcome the lack of annotated reasoning data, we design RecPO, a reinforcement learning framework.
  arXiv  Detail & Related papers  (2025-05-22T17:55:43Z)
• Think Before Recommend: Unleashing the Latent Reasoning Power for Sequential Recommendation [23.546871718624605]
  We propose textbfReaRec, the first inference-time computing framework for recommender systems.<n>ReaRec autoregressively feeds the sequence's last hidden state into the sequential recommender.<n>We introduce two lightweight reasoning-based learning methods, Ensemble Reasoning Learning (ERL) and Progressive Reasoning Learning (PRL)
  arXiv  Detail & Related papers  (2025-03-28T17:59:03Z)
• Review-driven Personalized Preference Reasoning with Large Language Models for Recommendation [21.769969074938142]
  EXP3RT is a novel LLM-based recommender designed to leverage rich preference information contained in user and item reviews.<n>It generates detailed step-by-step reasoning followed by predicted rating.<n>Experiments show that EXP3RT outperforms existing methods on both rating prediction and candidate item reranking for top-k recommendation.
  arXiv  Detail & Related papers  (2024-08-12T16:39:03Z)
• On Softmax Direct Preference Optimization for Recommendation [50.896117978746]
  We propose Softmax-DPO (S-DPO) to instill ranking information into the LM to help LM-based recommenders distinguish preferred items from negatives. Specifically, we incorporate multiple negatives in user preference data and devise an alternative version of DPO loss tailored for LM-based recommenders.
  arXiv  Detail & Related papers  (2024-06-13T15:16:11Z)
• Spread Preference Annotation: Direct Preference Judgment for Efficient LLM Alignment [72.99676237703099]
  We propose a new framework that boosts the alignment of large language models with human preferences.<n>Our key idea is leveraging the human prior knowledge within the small (seed) data.<n>We introduce a noise-aware preference learning algorithm to mitigate the risk of low quality within generated preference data.
  arXiv  Detail & Related papers  (2024-06-06T18:01:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.