paper-with-me

Papers

Support Sufficiency as Consequence-Sensitive Compression in Belief Arbitration

2026-04-06 · Mark Walsh arxiv

When a system commits to a hypothesis, much of the evidential structure behind that commitment is lost to compression. Standard accounts assume that selected content and scalar confidence suffice for downstream control. This paper argues that they do not, and that determining what must survive compression is itself a consequence-sensitive problem. We develop a recurrent arbitration architecture in which active constraint fields jointly determine a hypothesis geometry over candidates. Rather than carrying that geometry forward in full, the system compresses it into a support-aware control state whose resolution is regulated by current consequence geometry, arbitration memory, and resource constraints. A bounded objective formalizes the tradeoff. Too little retained support collapses policy-relevant distinctions, producing controllers that select content adequately while misrouting verification, abstention, and recovery. Too much retained support fragments learning across overly fine contexts, degrading adaptation even as discrimination improves. These failure modes yield ordered controller predictions confirmed by a minimal repeated-interaction simulation. Adaptive controllers that regulate support resolution outperform all fixed-resolution controllers in cumulative utility. Agile adaptive control outperforms sluggish adaptive control. Fixed high-resolution control achieves the best commitment accuracy but still trails adaptive controllers because resource cost and learning fragmentation offset the gains from richer retention. Support sufficiency should be understood not as a static representational threshold, but as a dynamic compression criterion. Robust arbitration depends on preserving the smallest support structure adequate for policy under the current consequence landscape, and on regulating that structure as conditions change across repeated cycles of inference and action.

📄 PDF Abstract BibTeX arXiv:2604.16434

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Support sufficiency as action-sufficient compression: a single-cycle rate-regret formulation

2026-05-28 · Mark Walsh arxiv

Robust decision-making requires compression. A system that forms a rich support state cannot usually preserve its full structure at the point of action. It must retain only those distinctions needed to act, verify, absta…

Latent State Design for World Models under Sufficiency Constraints

2026-05-03 · Keon Woo Kim arxiv

A world model matters to an agent only through the state it constructs. That state must preserve some information, discard other information, and support some future function: prediction, control, planning, memory, groun…

Video Prediction

Latent Belief Theory and Belief Dependencies: A Solution to the Recovery Problem in the Belief Set Theories

2015-07-06 · Ryuta Arisaka

The AGM recovery postulate says: assume a set of propositions X; assume that it is consistent and that it is closed under logical consequences; remove a belief P from the set minimally, but make sure that the resultant s…

Predictable Compression Failures: Order Sensitivity and Information Budgeting for Evidence-Grounded Binary Adjudication

2025-09-14 · Leon Chlon, Ahmed Karim, Maggie Chlon, MarcAntonio Awada arxiv

Transformers used for evidence-grounded binary adjudication (e.g., support/refute, yes/no, or verifier-backed pass/fail decisions) can be sensitive to the order in which exchangeable evidence is presented, producing disp…

Combining Extraction and Generation for Constructing Belief-Consequence Causal Links

2022-05-01 · insights (ACL) 2022 5 · Maria Alexeeva, Allegra A. Beal, Mihai Surdeanu

In this paper, we introduce and justify a new task—causal link extraction based on beliefs—and do a qualitative analysis of the ability of a large language model—InstructGPT-3—to generate implicit consequences of beliefs…

Language ModelingLanguage ModellingLarge Language Model