Personalized Federated Sequential Recommender

• URL: http://arxiv.org/abs/2603.22349v1
• Date: Sun, 22 Mar 2026 07:56:17 GMT
• Title: Personalized Federated Sequential Recommender
• Abstract summary: We propose the Personalized Federated Sequential Recommender (PFSR)<n>An Associative Mamba Block is introduced to capture user profiles from a global perspective.<n>A Variable Response Mechanism is developed to enable fine-tuning of parameters in accordance with individual user needs.
• Score: 1.827510863075184
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the domain of consumer electronics, personalized sequential recommendation has emerged as a central task. Current methodologies in this field are largely centered on modeling user behavior and have achieved notable performance. Nevertheless, the inherent quadratic computational complexity typical of most existing approaches often leads to inefficiencies that hinder real-time recommendation. Moreover, these methods face challenges in being effectively adapted to the personalized requirements of users across diverse scenarios. To tackle these issues, we propose the Personalized Federated Sequential Recommender (PFSR). In this framework, an Associative Mamba Block is introduced to capture user profiles from a global perspective while improving prediction efficiency. In addition, a Variable Response Mechanism is developed to enable fine-tuning of parameters in accordance with individual user needs. A Dynamic Magnitude Loss is further devised to preserve greater amounts of localized personalized information throughout the training process.

Related papers

• Synthetic Interaction Data for Scalable Personalization in Large Language Models [67.31884245564086]
  We introduce a high-fidelity synthetic data generation framework called PersonaGym.<n>Unlike prior work that treats personalization as static persona-preference pairs, PersonaGym models a dynamic preference process.<n>We release PersonaAtlas, a large-scale, high-quality, and diverse synthetic dataset of high-fidelity multi-turn personalized interaction trajectories.
  arXiv  Detail & Related papers  (2026-02-12T20:41:22Z)
• RecNet: Self-Evolving Preference Propagation for Agentic Recommender Systems [109.9061591263748]
  RecNet is a self-evolving preference propagation framework for recommender systems.<n>It proactively propagates real-time preference updates across related users and items.<n>In the backward phase, the feedback-driven propagation optimization mechanism simulates a multi-agent reinforcement learning framework.
  arXiv  Detail & Related papers  (2026-01-29T12:14:31Z)
• One Adapts to Any: Meta Reward Modeling for Personalized LLM Alignment [55.86333374784959]
  We argue that addressing these constraints requires a paradigm shift from fitting data to learn user preferences to learn the process of preference adaptation.<n>We propose Meta Reward Modeling (MRM), which reformulates personalized reward modeling as a meta-learning problem.<n>We show that MRM enhances few-shot personalization, improves user robustness, and consistently outperforms baselines.
  arXiv  Detail & Related papers  (2026-01-26T17:55:52Z)
• 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)
• Personalized Reasoning: Just-In-Time Personalization and Why LLMs Fail At It [81.50711040539566]
  Current large language model (LLM) development treats task-solving and preference alignment as separate challenges.<n>We introduce PREFDISCO, an evaluation methodology that transforms static benchmarks into interactive personalization tasks.<n>Our framework creates scenarios where identical questions require different reasoning chains depending on user context.
  arXiv  Detail & Related papers  (2025-09-30T18:55:28Z)
• Churn-Aware Recommendation Planning under Aggregated Preference Feedback [6.261444979025644]
  We study a sequential decision-making problem motivated by recent regulatory and technological shifts.<n>We introduce the Rec-APC model, in which an anonymous user is drawn from a known prior over latent user types.<n>We prove that optimal policies converge to pure exploitation in finite time and propose a branch-and-bound algorithm to efficiently compute them.
  arXiv  Detail & Related papers  (2025-07-06T19:22:47Z)
• PERSCEN: Learning Personalized Interaction Pattern and Scenario Preference for Multi-Scenario Matching [38.829190984763294]
  Key to effective multi-scenario recommendation lies in capturing both user preferences shared across all scenarios and scenario-aware preferences specific to each scenario.<n>We propose PERSCEN, an innovative approach that incorporates user-specific modeling into multi-scenario matching.<n>PERSCEN constructs a user-specific feature graph based on user characteristics and employs a lightweight graph neural network to capture higher-order interaction patterns.
  arXiv  Detail & Related papers  (2025-06-23T08:15:16Z)
• Modeling Churn in Recommender Systems with Aggregated Preferences [6.261444979025644]
  We propose a model that addresses the dual challenges of leveraging aggregated user information and mitigating churn risk.<n>Our model assumes that the RS operates with a probabilistic prior over user types and aggregated satisfaction levels for various content types.
  arXiv  Detail & Related papers  (2025-02-09T13:12:11Z)
• Efficient and Robust Regularized Federated Recommendation [52.24782464815489]
  The recommender system (RSRS) addresses both user preference and privacy concerns. We propose a novel method that incorporates non-uniform gradient descent to improve communication efficiency. RFRecF's superior robustness compared to diverse baselines.
  arXiv  Detail & Related papers  (2024-11-03T12:10:20Z)
• PP-TIL: Personalized Planning for Autonomous Driving with Instance-based Transfer Imitation Learning [4.533437433261497]
  We propose an instance-based transfer imitation learning approach for personalized motion planning. We extract the style feature distribution from user demonstrations, constructing the regularization term for the approximation of user style. Compared to the baseline methods, our approach mitigates the overfitting issue caused by sparse user data.
  arXiv  Detail & Related papers  (2024-07-26T07:51:11Z)

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.