SAERec: Constructing Fine-grained Interpretable Intents Priors via Sparse Autoencoders for Recommendation

• URL: http://arxiv.org/abs/2606.18897v1
• Date: Wed, 17 Jun 2026 10:17:04 GMT
• Title: SAERec: Constructing Fine-grained Interpretable Intents Priors via Sparse Autoencoders for Recommendation
• Abstract summary: We propose the Sparse Autoencoder for intent-based recommendation (SAERec)<n>SAERec automatically constructs a fine-grained and interpretable intent space from a textual corpus to guide recommendation.<n>Experiments on public demonstrate the superiority of SAERec, consistently outperforming state-of-the-art baselines.
• Score: 30.06423221745951
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Intent-based recommender systems have gained significant attention for improving accuracy and interpretability by modeling the underlying motivations behind user behaviors. Most existing models derive intents directly from user sequences via clustering or prototype learning. However, they are sensitive to sequence quality, require presetting the number of intents, and lack explicit semantic grounding. These issues lead to an incomplete and coarse intent set and limit the effectiveness of recommendation. In this paper, we propose the Sparse Autoencoder for intent-based recommendation (SAERec), a novel recommender that automatically constructs a fine-grained and interpretable intent space from a textual corpus to guide recommendation. Rather than treating texts as side signals, SAERec leverages them as high information density evidence for intent construction. Specifically, we first extract a comprehensive set of fine-grained interpretable intents from the latent space of large language models (LLMs) by using a sparse autoencoder (SAE) to disentangle and interpret text embeddings, which isolates intent-related semantics from textual noise. Then, for each user, we retrieve relevant intents from this set as priors to guide recommendation. It contains personal intents matching a user's current interests and public intents capturing general item patterns shared across users (e.g., quality, price). Finally, to integrate retrieved intents into sequence modeling, we propose a multi-branch attention mechanism that captures temporal dependencies and injects both personal and public intent signals, followed by an adaptive fusion layer to construct the final user representation for recommendation. Extensive experiments on public datasets demonstrate the superiority of SAERec, consistently outperforming state-of-the-art baselines while providing human-understandable explanations.

Related papers

• Structuring and Tokenizing Distributed User Interest Context for Generative Recommendation [60.03046892817763]
  Generative recommendation is an emerging paradigm that has shown promise in industrial recommendation systems.<n>Existing methods often struggle to organize and inject complex user-behavioral and item-semantic contexts into recommendation models simultaneously.<n>We propose G2Rec, a scalable framework that unifies holistic graph-based user co-engagement modeling with semantic tokenization for industrial-scale generative recommendation.
  arXiv  Detail & Related papers  (2026-06-18T17:58:32Z)
• RAGR: Review-Augmented Generative Recommendation [61.29879991713178]
  Review-Augmented Generative Recommendation (RAGR) is a novel GR framework that incorporates review feedback directly into the generative user sequence.<n>RAGR yields consistent and significant gains over strong GR backbones across all metrics.
  arXiv  Detail & Related papers  (2026-05-17T05:21:23Z)
• IntPro: A Proxy Agent for Context-Aware Intent Understanding via Retrieval-conditioned Inference [22.214499732123173]
  IntPro is a proxy agent that learns to adapt to individual users via retrieval-conditioned intent inference.<n>We show that IntPro achieves strong intent understanding performance with effective context-aware reasoning capabilities.
  arXiv  Detail & Related papers  (2026-02-10T07:20:58Z)
• CoFiRec: Coarse-to-Fine Tokenization for Generative Recommendation [55.783414010717074]
  CoFiRec is a novel generative recommendation framework that decomposes item information into semantic levels.<n>We show that CoFiRec outperforms existing methods, offering a new perspective for generative recommendation.
  arXiv  Detail & Related papers  (2025-11-27T18:59:35Z)
• Quick on the Uptake: Eliciting Implicit Intents from Human Demonstrations for Personalized Mobile-Use Agents [35.28287742448611]
  We propose textbfIFRAgent, a framework built upon textbfFlow textbfRecognition from human demonstrations.<n>IFRAgent analyzes explicit intention flows from human demonstrations to construct a query-level vector library of standard operating procedures.
  arXiv  Detail & Related papers  (2025-08-12T05:20:14Z)
• IntentGPT: Few-shot Intent Discovery with Large Language Models [9.245106106117317]
  We develop a model capable of identifying new intents as they emerge. IntentGPT is a training-free method that effectively prompts Large Language Models (LLMs) to discover new intents with minimal labeled data. Our experiments show that IntentGPT outperforms previous methods that require extensive domain-specific data and fine-tuning.
  arXiv  Detail & Related papers  (2024-11-16T02:16:59Z)
• Exploring the Individuality and Collectivity of Intents behind Interactions for Graph Collaborative Filtering [9.740376003100437]
  We propose a novel recommendation framework designated as Bilateral Intent-guided Graph Collaborative Filtering (BIGCF) Specifically, we take a closer look at user-item interactions from a causal perspective and put forth the concepts of individual intent. To counter the sparsity of implicit feedback, the feature distributions of users and items are encoded via a Gaussian-based graph generation strategy.
  arXiv  Detail & Related papers  (2024-05-15T02:31:26Z)
• Latent User Intent Modeling for Sequential Recommenders [92.66888409973495]
  Sequential recommender models learn to predict the next items a user is likely to interact with based on his/her interaction history on the platform. Most sequential recommenders however lack a higher-level understanding of user intents, which often drive user behaviors online. Intent modeling is thus critical for understanding users and optimizing long-term user experience.
  arXiv  Detail & Related papers  (2022-11-17T19:00:24Z)
• Intent Contrastive Learning for Sequential Recommendation [86.54439927038968]
  We introduce a latent variable to represent users' intents and learn the distribution function of the latent variable via clustering. We propose to leverage the learned intents into SR models via contrastive SSL, which maximizes the agreement between a view of sequence and its corresponding intent. Experiments conducted on four real-world datasets demonstrate the superiority of the proposed learning paradigm.
  arXiv  Detail & Related papers  (2022-02-05T09:24:13Z)
• Intent Mining from past conversations for conversational agent [1.9754522186574608]
  Bots are increasingly being deployed to provide round-the-clock support and to increase customer engagement. Many of the commercial bot building frameworks follow a standard approach that requires one to build and train an intent model to recognize a user input. We have introduced a novel density-based clustering algorithm ITERDB-LabelSCAN for unbalanced data clustering.
  arXiv  Detail & Related papers  (2020-05-22T05:29:13Z)
• AGIF: An Adaptive Graph-Interactive Framework for Joint Multiple Intent Detection and Slot Filling [69.59096090788125]
  In this paper, we propose an Adaptive Graph-Interactive Framework (AGIF) for joint multiple intent detection and slot filling. We introduce an intent-slot graph interaction layer to model the strong correlation between the slot and intents. Such an interaction layer is applied to each token adaptively, which has the advantage to automatically extract the relevant intents information.
  arXiv  Detail & Related papers  (2020-04-21T15:07:34Z)

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.