Rare, Relevant, and Still Wrong: How Memory Fails LLM Group Decisions

Hugging Face Daily Papers Papers

Summary

该论文提出 CrossProfile 诊断基准,研究多智能体讨论压缩为记忆时的选择策略,发现按稀有性或相关性选择均会失败,且决策模型存在从众偏差,完整转录反而降低准确率。

When an LLM group's discussion is compressed into a short memory for a final decision maker, what should the memory keep? Two natural heuristics keep the rarest claims or the claims relevant to the decision criteria. On hidden-profile tasks both look attractive, because how widely a fact is held is confounded with whether it helps. We introduce CrossProfile, a diagnostic benchmark of 60 templates with automatically verified answer keys, in which the ownership of supporting, decoy, and irrelevant facts is crossed while their text is held fixed (480 tasks). Across Qwen2.5-7B, Llama-3.1-8B, and two DeepSeek models, both heuristics fail in predictable places. Selecting by relevance readmits decoys, because decoys are on topic: even a perfect relevance filter loses 23 to 31 points to rarest-first selection in the classic hidden-profile configuration. Rarest-first selection is no better than random selection on average and wins only where the rare facts happen to be the useful ones. In both cases accuracy follows the balance of evidence the memory keeps, not the policy that kept it. The decision model adds a third failure, a form of social proof: it gives extra weight to facts attributed to many agents. Removing the attribution tags, or reassigning them at random with line order fixed, raises accuracy in the classic configuration by 13 to 24 points. In natural discussions the evidence is lost before any memory acts: the complete transcript yields lower accuracy than no notes at all.
Original Article
View Cached Full Text

Cached at: 10/28/26, 09:26 AM

Paper page - Rare, Relevant, and Still Wrong: How Memory Fails LLM Group Decisions

Source: https://huggingface.co/papers/2610.37624

Abstract

When compressing multi-agent discussions for final decisions, memory selection by rarity or relevance both fail due to decoy inclusion and social-proof bias, and even full transcripts reduce accuracy compared to no notes.

When anLLMgroup’s discussion is compressed into a short memory for a final decision maker, what should the memory keep? Two natural heuristics keep the rarest claims or the claims relevant to the decision criteria. Onhidden-profiletasks both look attractive, because how widely a fact is held is confounded with whether it helps. We introduceCrossProfile, a diagnostic benchmark of 60 templates with automatically verified answer keys, in which the ownership of supporting, decoy, and irrelevant facts is crossed while their text is held fixed (480 tasks). Across Qwen2.5-7B, Llama-3.1-8B, and two DeepSeek models, both heuristics fail in predictable places. Selecting by relevance readmits decoys, because decoys are on topic: even a perfectrelevance filterloses 23 to 31 points to rarest-first selection in the classichidden-profileconfiguration. Rarest-first selection is no better than random selection on average and wins only where the rare facts happen to be the useful ones. In both cases accuracy follows the balance of evidence the memory keeps, not the policy that kept it. The decision model adds a third failure, a form ofsocial proof: it gives extra weight to facts attributed to many agents. Removing theattribution tags, or reassigning them at random with line order fixed, raises accuracy in the classic configuration by 13 to 24 points. In natural discussions the evidence is lost before any memory acts: the complete transcript yields lower accuracy than no notes at all.

View arXiv pageView PDFAdd to collection

Models citing this paper0

No model linking this paper

Cite arxiv.org/abs/2610.37624 in a model README.md to link it from this page.

Datasets citing this paper0

No dataset linking this paper

Cite arxiv.org/abs/2610.37624 in a dataset README.md to link it from this page.

Spaces citing this paper0

No Space linking this paper

Cite arxiv.org/abs/2610.37624 in a Space README.md to link it from this page.

Collections including this paper0

No Collection including this paper

Add this paper to acollectionto link it from this page.

Similar Articles

Understanding and Mitigating Inference-Time Overreliance Using Agentic Memory

arXiv cs.AI

该论文研究了LLM智能体中的'记忆过度依赖'现象——即使记忆是良性的、正确存储且被恰当检索,部分证据迁移仍会误导推理。作者提出MemTrim框架,在写入时索引记忆证据、在读取时控制复用,无需重训即可减少过度依赖。

More Memory, Worse Agents: Error Reproduction and Anti-Persistence in LLM Agents

arXiv cs.AI

该论文提出"错误复现"(error reproduction)机制,指出在LLM智能体外部记忆中持久化抽象规则会循环放大错误,并提出Anti-Persistence记忆设计:仅累积轨迹与结果、按需临时合成指导,从而在多个基准上取得更高成功率与更低LLM调用成本。