Think-to-Personalize: Unifying Reasoning and Retrieval for User-Centric Personalized Dense Retrieval

• URL: http://arxiv.org/abs/2608.18855v2
• Date: Mon, 24 Aug 2026 03:42:50 GMT
• Title: Think-to-Personalize: Unifying Reasoning and Retrieval for User-Centric Personalized Dense Retrieval
• Abstract summary: Think-to-Personalize (TTP) is a novel framework that unifies explicit user-centric intent reasoning with dense retrieval.<n>TTP significantly outperforms state-of-the-art baselines.
• Score: 37.821022474615994
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Dense retrieval has become a cornerstone of modern local-lifestyle e-commerce search by encoding queries and items into semantic embedding spaces. While recent advancements have transitioned from BERT-based embedding models to Large Language Models (LLMs), most approaches still treat LLMs as static text encoders, neglecting their inherent reasoning capabilities. Furthermore, standard dense retrieval models remain query-centric, which is insufficient in e-commerce scenarios where sparse and ambiguous queries create an intent gap that can only be bridged by the rich context of user history. Meanwhile, existing personalized retrieval methods typically rely on implicit embedding interactions, which lack the reasoning capability to effectively disambiguate user intent from noisy historical behaviors. To address these challenges, we propose Think-to-Personalize (TTP), a novel framework that unifies explicit user-centric intent reasoning with dense retrieval. By reasoning over the user's historical purchase sequence, TTP explicitly deduces latent personalized needs and generates an intent-enhanced query, which is then encoded into a unified dense embedding. Specifically, we design a two-stage training paradigm: (1) a Supervised Fine-Tuning (SFT) stage that establishes cold-start capabilities; and (2) a Reinforcement Learning (RL) stage that aligns the reasoning process with retrieval utility using Group Relative Policy Optimization (GRPO). Extensive experiments on both proprietary and public benchmarks demonstrate that TTP significantly outperforms state-of-the-art baselines. Furthermore, in online A/B tests, it achieved a +0.46% lift in order volume, validating its practical effectiveness and establishing a new paradigm for reasoning-driven personalized dense retrieval.

Related papers

• RAG-Enhanced Large Language Models for Dynamic Content Expiration Prediction in Web Search [49.70446150612307]
  In commercial web search, aligning content freshness with user intent remains challenging due to the highly varied lifespans of information.<n>Traditional industrial approaches rely on static time-window filtering, resulting in "one-size-fits-all" rankings where content may be chronologically recent but semantically expired.<n>Our framework extracts fine-grained temporal contexts from documents to deduce a query-specific "validity horizon"-a semantic boundary defining when information becomes obsolete based on user intent.
  arXiv  Detail & Related papers  (2026-05-13T06:20:28Z)
• Personalized Deep Research: A User-Centric Framework, Dataset, and Hybrid Evaluation for Knowledge Discovery [36.57361069825463]
  We introduce Personalized Deep Research (PDR), a framework that integrates dynamic user context into the core retrieval-reasoning loop.<n>PDR unifies user profile modeling with iterative query development, dual-stage (private/public) retrieval, and context-aware synthesis.<n>This allows the system to autonomously align research sub-goals with user intent and optimize the stopping criteria for evidence collection.
  arXiv  Detail & Related papers  (2026-05-11T13:14:54Z)
• Sparse Personalized Text Generation with Multi-Trajectory Reasoning [95.19317487799292]
  PAT (Personalization with Aligned Trajectories) is a reasoning framework for cold-start LLM personalization.<n>It first retrieves information along two complementary trajectories: writing-style cues from stylistically similar users and topic-specific context from preference-aligned users.<n>It then employs a reinforcement learning-based, iterative dual-reasoning mechanism that enables the LLM to jointly refine and integrate these signals.
  arXiv  Detail & Related papers  (2026-04-27T20:58:49Z)
• Towards Context-aware Reasoning-enhanced Generative Searching in E-commerce [61.03081096959132]
  We propose a context-aware reasoning-enhanced generative search framework for better textbfunderstanding the complicated context.<n>Our approach achieves superior performance compared with strong baselines, validating its effectiveness for search-based recommendation.
  arXiv  Detail & Related papers  (2025-10-19T16:46:11Z)
• Large Reasoning Embedding Models: Towards Next-Generation Dense Retrieval Paradigm [16.78399933831573]
  We propose the Large Reasoning Embedding Model (LREM), which integrates reasoning processes into representation learning.<n>For difficult queries, LREM first conducts reasoning to achieve a deep understanding of the original query, and then produces a reasoning-augmented query embedding for retrieval.<n>This reasoning process effectively bridges the semantic gap between original queries and target items, significantly improving retrieval accuracy.
  arXiv  Detail & Related papers  (2025-10-16T05:37:39Z)
• A Generative Framework for Personalized Sticker Retrieval [73.57899194210141]
  We propose PEARL, a novel generative framework for personalized sticker retrieval.<n>We make two key contributions: (i) To encode user-specific sticker preferences, we design a representation learning model to learn discriminative user representations, and (ii) To generate stickers aligned with a user's query intent, we propose a novel intent-aware learning objective.<n> Empirical results from both offline evaluations and online tests demonstrate that PEARL significantly outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-09-22T13:11:44Z)
• AI Guided Accelerator For Search Experience [4.832123045961485]
  We propose a novel framework that explicitly models transitional queries--intermediate reformulations occurring during the user's journey toward their final purchase intent.<n>This approach allows us to model a user's shopping funnel, where mid-journey transitions reflect exploratory behavior and intent refinement.<n>Our contributions include (i) the formal identification and modeling of transitional queries, (ii) the introduction of a structured query sequence mining pipeline for intent flow understanding, and (iii) the application of LLMs for scalable, intent-aware query expansion.
  arXiv  Detail & Related papers  (2025-07-25T23:26:00Z)
• Constrained Auto-Regressive Decoding Constrains Generative Retrieval [71.71161220261655]
  Generative retrieval seeks to replace traditional search index data structures with a single large-scale neural network.<n>In this paper, we examine the inherent limitations of constrained auto-regressive generation from two essential perspectives: constraints and beam search.
  arXiv  Detail & Related papers  (2025-04-14T06:54:49Z)
• Optimized Feature Generation for Tabular Data via LLMs with Decision Tree Reasoning [53.241569810013836]
  We propose a novel framework that utilizes large language models (LLMs) to identify effective feature generation rules. We use decision trees to convey this reasoning information, as they can be easily represented in natural language. OCTree consistently enhances the performance of various prediction models across diverse benchmarks.
  arXiv  Detail & Related papers  (2024-06-12T08:31:34Z)
• Leveraging Cognitive Search Patterns to Enhance Automated Natural Language Retrieval Performance [0.0]
  We show that cognitive reformulation patterns that mimic user search behaviour are highlighted. We formalize the application of these patterns by considering a query conceptual representation. A genetic algorithm-based weighting process allows placing emphasis on terms according to their conceptual role-type.
  arXiv  Detail & Related papers  (2020-04-21T14:13:33Z)

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.