arXiv AI

EviGraph: Proof-Carrying Selective Recommendation over Temporal Public-Service Knowledge Graphs

EviGraph is a system that enables proof‑carrying selective recommendation over temporal public‑service knowledge graphs. It distinguishes between critical decision requirements and information that can remain unresolved, linking the former to evidence via a language agent and verifying support with a deterministic checker. Experiments on a bilingual Hong Kong public‑service benchmark show that this approach reduces unnecessary abstention, while additional verification can actually withdraw supported recommendations without improving decision quality.

arXiv AI
Sep 4

Epistemic Warrant for LLM Recommendations: Characterizing the Basis for Reliance When Ground Truth Is Unavailable

The paper introduces the concept of epistemic warrant to assess when users should rely on individual recommendations from large language models (LLMs). It defines a four-tier reliance certificate—unstable, context-dependent, locally supported, and broadly supported—based on the stability and scope of a model’s preference. Experiments show that these warrants align with expert judgments and crowd consensus, and they provide distinct information from confidence scores or decision difficulty.

By Shai Vardi, Jo\~ao Sedoc
Hugging Face Trending Papers
Sep 3

Epistemic Warrant for LLM Recommendations: Characterizing the Basis for Reliance When Ground Truth Is Unavailable

The paper introduces epistemic warrant, a decision-level construct that assesses the stability and scope of a large language model’s preference for individual recommendations. It operationalizes this concept with a four-tier reliance certificate—unstable, context-dependent, locally supported, and broadly supported—applied to pairwise recommendations. Validation shows that stronger warrants align with expert and crowd consensus, provide distinct information from verbalized confidence, and are not merely a reflection of decision difficulty.

arXiv AI
Oct 5

Reasoning with Evidence, Not Merely Rationales: Verifiable Preference Proofs for LLM-Based Recommendation

The paper introduces PROVE-REC, a two‑pass framework that generates verifiable preference proofs for large language model (LLM) recommendation systems. In Pass A, the model condenses user interaction histories into a compact proof of positive and avoidance claims linked to specific evidence entries. Pass B then uses only this proof and its evidence to predict the next item, ensuring the recommendation follows the reasoning path. Verification steps compare masked evidence and removed claims to confirm grounding and influence, while a ranking‑preservation objective retains useful historical information. Experiments on diverse real‑world datasets show PROVE‑REC outperforms strong baselines by up to 7.45%, producing claims that are both better grounded and more influential to recommendation quality.

By Yu Hou, Nathaniel Kang, Pengkai Wang, Hua Li
arXiv Computation and Language
3d ago

CARTBench: Rubric-Based Evaluation of Shopping Advice for Complex and Ambiguous Requests with Timelines

CARTBench is a new benchmark for evaluating large language model shopping assistants on complex, ambiguous requests that involve timelines. It compiles 1,603 timestamped dialogues from 17 retail domains and pairs them with product records, then uses case‑specific rubrics based on Ideal Response Principles to score responses across Core, Excellence, and Safety criteria. In a full‑suite evaluation of ten commercial APIs and several open‑weight models, only three models scored above 90% on Core and none surpassed 45% on Excellence, revealing a gap between required behavior and high‑quality purchase advice.

By Yuqin Dai, Zhanwei Zhang, Honghui Yang, Zhouheng Yao, Yueqi Zhang, Jingyu He, Chaoyang Shi, Fanding Wei, Boyuan Pan, Kai Xu, Yao Hu, Yongliang Shen
arXiv AI
Sep 2

RPCBench: A Benchmark for Proactive Premise Critique in LLM-based Recommendation

RPCBench is a new benchmark designed to evaluate large language models’ ability to critique recommendation requests by detecting, diagnosing, and handling flawed premises. It includes evidence‑grounded test instances across five recommendation domains and ten types of premise failures, and introduces a fine‑grained evaluation framework covering detection, error localization, handling strategy, and evidence faithfulness. Experiments with 11 LLMs reveal that proactive detection is the main bottleneck, with models struggling most on underspecified‑premise errors and showing that optimal critique quality occurs at intermediate reasoning lengths.

By Zhongru Chen, Yuan Wu, Yi Chang
arXiv AI
Oct 31

ATLAS-Bench: An Agentic Tool-Use Benchmark for Local Area Search

ATLAS-Bench is a new benchmark comprising 1,200 local search queries across three regions, designed to evaluate large language model agents on their ability to satisfy mandatory requirements, preferences, and factual versus subjective judgments using place attributes, reviews, and user profiles. Each query distinguishes constraints from preferences and includes evidence and criteria for verification, with validation through iterative assertion checks and cross-model review. The benchmark is paired with ATLASBox, a standardized evaluation environment that provides search tools and a fixed POI knowledge base, allowing agents to recommend evidence-supported options or report unmet requirements, and the study reports that GPT-6-Luna achieves the highest constraint satisfaction and factual accuracy, though GLM-5.3 returns acceptable recommendations for more queries. whyItMatters":"The benchmark addresses gaps in existing local search evaluations by rigorously testing agents’ ability to meet mandatory constraints and preferences, thereby advancing the development of reliable LLM agents for everyday decision-making and planning."

By Keyun Zhang, Dapeng Yin, Fanfu Wang, Shuang Lang, Zhenyu Zhu, Yulin Huang, Chong Yang, Pengjie Wang
arXiv AI
Sep 17

GraphEcho: Structural Redundancy and Evidence Provenance in LLM Graph Agents

GraphEcho is a benchmark that examines how large language model agents navigate graph paths and handle evidence redundancy. It tests whether agents treat repeated encounters as additional corroboration by varying path counts and evidential origins while keeping evidence content constant. The study finds that redundant paths increase repeated walks, and that provenance-aware post‑training can reduce revisits but may limit source diversity, revealing a gap between efficient exploration and effective evidence use.

By Sikun Wang, Yixi Zhou, Lei Fan, Fan Zhang