High Fidelity Textual User Representation over Heterogeneous Sources via Reinforcement Learning

Rajat Arora, Ye Tao, Jianqiang Shen, Ping Liu, Muchen Wu +5 more
2/7/2026
cs.IRcs.AIcs.CL

No confident code implementation found for this paper.

Abstract

Effective personalization on large-scale job platforms requires modeling members based on heterogeneous textual sources, including profiles, professional data, and search activity logs. As recommender systems increasingly adopt Large Language Models (LLMs), creating unified, interpretable, and concise representations from heterogeneous sources becomes critical, especially for latency-sensitive online environments. In this work, we propose a novel Reinforcement Learning (RL) framework to synthesize a unified textual representation for each member. Our approach leverages implicit user engagement signals (e.g., clicks, applies) as the primary reward to distill salient information. Additionally, the framework is complemented by rule-based rewards that enforce formatting and length constraints. Extensive offline experiments across multiple LinkedIn products, one of the world's largest job platforms, demonstrate significant improvements in key downstream business metrics. This work provides a practical, labeling-free, and scalable solution for constructing interpretable user representations that are directly compatible with LLM-based systems.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{arora2026high,
  title  = {High Fidelity Textual User Representation over Heterogeneous Sources via Reinforcement Learning},
  author = {Rajat Arora and Ye Tao and Jianqiang Shen and Ping Liu and Muchen Wu and Qianqi Shen and Benjamin Le and Fedor Borisyuk and Jingwei Wu and Wenjing Zhang},
  year   = {2026},
  eprint = {2602.07333},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2602.07333v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2602.07333.svg)](https://codeofpaper.com/paper/2602.07333)

Discussion