τ-Rec: A Verifiable Benchmark for Agentic Recommender Systems

Bharath Sivaram Narasimhan, Karthik R Narasimhan
6/8/2026
cs.IRcs.AIcs.CL

Official code: nbharaths/tau-rec (3 stars, last commit 2026-05-06).

Abstract

As recommender systems transition toward agentic, multi-turn conversational interfaces, evaluation paradigms have struggled to keep pace. Current benchmarks often rely on "LLM-as-a-judge" evaluations, which introduce subjectivity, high costs and inconsistency. We present $τ$-Rec, a benchmark for agentic recommender systems that replaces subjective evaluation with verifiable rewards and a reveal-tagged elicitation (RTE) mechanism that controls how task constraints surface during dialogue. By testing agents against structured catalog predicates and employing a pass^k reliability metric, $τ$-Rec provides a systematic test for consistent reasoning. Our evaluation of nine configurations across five model families -- GPT-5.4, Claude Sonnet 4.6, Gemini 2.5 Flash, DeepSeek V4 Flash, Qwen3-32B and GPT-5 mini -- reveals a steep reliability cliff, where even the best model achieves only ~57% at pass^1 and ~38% at pass^4, highlighting a critical gap in current conversational agent deployment. All code and data are publicly available at https://github.com/nbharaths/tau-rec.

View on arXivView PDF

Code Implementations(1)

nbharaths/tau-recOfficial100%

τ-Rec: A verifiable benchmark for agentic conversational recommender systems (RecSys 2026 Resource Track)

30PythonMay 5, 20265 months agoNOASSERTION

Similar Papers

Cite this paper

@article{narasimhan2026rec,
  title  = {τ-Rec: A Verifiable Benchmark for Agentic Recommender Systems},
  author = {Bharath Sivaram Narasimhan and Karthik R Narasimhan},
  year   = {2026},
  eprint = {2606.10156},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.10156v1}
}

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/2606.10156.svg)](https://codeofpaper.com/paper/2606.10156)

Discussion