Skip to content

APeB: Benchmarking Personalization Ability of Large Language Model Agents

Jul 2026 · 0 citations · 88 references
Computer Science

TL;DR

This work introduces personalized product search (PPS), a testbed for agentic personalization under raw queries and diverse histories, and constructs Agent Personalized Benchmark (APeB) from action logs, pairing underspecified intents with rich histories and user-viewed candidate items.

Abstract

LLM-powered agents struggle with personalization when users issue raw, underspecified queries. In this setting, agents must infer latent intent, extract preferences from noisy interaction histories, and select among competing alternatives. Existing benchmarks rarely test this capability, as they often rely on user-refined queries or simplified histories. We introduce personalized product search (PPS), a testbed for agentic personalization under raw queries and diverse histories. We construct Agent Personalized Benchmark (APeB) from action logs, pairing underspecified intents with rich histories and user-viewed candidate items. Evaluating state-of-the-art LLMs with multi-step agent workflows, we find that models handle explicit queries well but struggle with early-stage queries requiring intent and preference discovery. Rubric analysis attributes this gap mainly to ineffective history use. A simple history-aware query-refinement pipeline, VQRA, yields consistent gains, highlighting the need for dedicated history-utilization modules in personalized agents.

View source

Similar papers

Preprint Sep 2026

AdaptArena: Evaluating Test-Time Personalization of Web Agents

It is found that correctly inferring user preferences is necessary but not sufficient for task success, as execution failures in downstream web interactions remain a significant bottleneck even when agents align with the target preference.

Dong-Chan Shin, Xing Han Lù, Jiaqi Deng et al. · 0 citations
#artificial intelligence Preprint Sep 2026

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

This work introduces ENOUGH, a method that iteratively appends behavioral records or emits STOP to construct profiles with adaptive lengths, which consistently outperforms strong heuristic and retrieval-augmented baselines in both effectiveness and efficiency.

Ming-Hang Liu, Qiang Qiu, Yuan-Zhuo Wang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

VIBE-Bench: Evaluating Personalized Large Language Models When Profiles Don't Mean Preferences

VIBE-Bench is introduced, a benchmark with two psychology-grounded tasks, 3,504 personas and 12,239 dialogues, including a manually verified gold test set, and requires cross-concept preference reasoning beyond surface semantic overlap, establishing PRCM as a distinct failure regime in PLLMs and position VIBE-Bench as...

Yi-Wen Jiang, Yang Deng, Stephanie Fong et al. · 0 citations
#artificial intelligence Preprint Oct 2026

DyadMem: A Long-Term Memory Benchmark of How Agents Work with Users

Long-term agents must remember not only what is true about a user, but also how a particular agent should work with that user as their shared history evolves. Existing benchmarks primarily supervise user facts and preferences or experience reusable across users, leaving this relationship-specific agent memory implicit....

Yi-Fei Tao, Xin-Yue Zhong, Henry Hengyuan Zhao et al. · 0 citations
#machine learning Preprint Sep 2026

Rethinking Personalized Generation: Test-Time Alignment via Factorized Ranking Models

This work uses empirical studies to reveal the existence of a massive, untapped performance headroom for personalized generation through test-time alignment, and proposes a parameter-efficient framework utilizing million-parameter scale multi-layer perceptron (MLP) ranking models.

Qi-Yao Ma, Jun-Shan Zhang, Zhe Zhao · 0 citations
Preprint Aug 2026

CAPO: Constraint-Aware Prompt Optimization for LLM Agents

This work introduces CAPO (Constraint-Aware Prompt Optimization), a primal-dual method that combines pool-based rewrites with adaptive constraint weighting to optimize system prompts under explicit operational constraints.

Victor Ye Dong, Reid Pryzant, Yi Liu et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.