arXiv Computation and Language By JaeHa Yoon, Minjun Park, Seoyeon Kim, Jiwoo Lee, Hyunwoo Choi, Dohyun Kang

Bounded Personas Match Retrieval on Classification but Not Regression for a Frozen Agent

Read the original on arXiv Computation and Language →

The paper introduces PersonaLink, a training‑free method that distills a user’s interaction history into a bounded three‑field persona and iteratively refines it by self‑evaluating a frozen 7B language model on held‑out labeled data. Each refinement rewrites the persona only if it does not regress on that slice, ensuring the persona remains bounded and query‑independent. On a 200‑user news categorization task (LaMP‑2), PersonaLink achieves 0.745–0.755 accuracy, statistically indistinguishable from BM25 retrieval’s 0.760–0.765 accuracy, demonstrating that distilled personas can match retrieval for classification but not for regression tasks.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Computation and Language
Sep 14

Creating an Atomic User Model for Personality-Aware Large Language Model Interaction

The paper introduces the Atomic User Model (AUM), a structured representation of a user’s personality that separates a stable identity nucleus from four interpretable shells—psychological, cognitive & experiential, behavioural, and social—along with cross-shell entries for conflict and authenticity. It proposes using AUM as a retrieval index rather than a prompt prefix, enabling a task‑specific, budgeted retrieval of relevant fields at generation time. Experiments with simulated participants show that retrieving eight AUM fields improves style fidelity, preference accuracy, and user voice identification compared to flat preference notes, especially benefiting users whose default assistant performs poorly.

By B. Sankar, Deepthika S, Pawni Yadav, Amogh A S
Hugging Face Trending Papers
Jul 29

Learning Dynamic User Personas from Implicit Interaction Streams via Iterative Refinement

Personalizing large language models (LLMs) to individual users is essential for improving user experience, yet existing approaches typically rely on explicit preference supervision such as pairwise comparisons or demographic attributes, limiting their applicability in natural interaction settings. We propose IRIS, a framework that learns dynamic user personas directly from implicit interaction streams by extracting behavioral signals from everyday conversations and iteratively refining persona representations through a prediction-driven closed loop without requiring explicit feedback.

arXiv Machine Learning
Jul 30

Learning Dynamic User Personas from Implicit Interaction Streams via Iterative Refinement

arXiv:2607. 26473v1 Announce Type: new Abstract: Personalizing large language models (LLMs) to individual users is essential for improving user experience, yet existing approaches typically rely on explicit preference supervision such as pairwise comparisons or demographic attributes, limiting their applicability in natural interaction settings.

By Haifeng Wu
arXiv AI
Aug 18

QUMem: Personalized Memory for Query-Conditioned User-State Inference in LLM Agents

arXiv:2608. 16168v1 Announce Type: cross Abstract: Large language model (LLM) agents increasingly use external memory systems to support personalization by drawing on long and evolving interaction histories, in which user preferences may be distributed across time, change with context, and conflict with earlier evidence.

By Heng Wang, Yifei Li, Lingling Zhang, Pengyu Li, Xinyu Che, Xinyu Zhang, Zesheng Yang
arXiv AI
Sep 10

Less Is Personal: Learning Minimal Sufficient User Profiles for Personalized Language Models

The paper introduces ENOUGH, a method for creating minimal sufficient user profiles for personalized language models. ENOUGH iteratively adds behavioral records or stops, evaluating profile prefixes with a counterfactual search that balances downstream gains, user specificity, and token costs. The resulting profiles are distilled into a lightweight controller that orders records and triggers the generator only once, achieving better effectiveness and efficiency than existing baselines across six tasks.

By Minghang Liu, Qiang Qiu, Yuanzhuo Wang, Huawei Shen, Xueqi Cheng