Beyond Local Surprise: Grounded Dialogue as Selective Belief Revision under Referential Uncertainty

• URL: http://arxiv.org/abs/2608.26035v1
• Date: Wed, 26 Aug 2026 17:13:46 GMT
• Title: Beyond Local Surprise: Grounded Dialogue as Selective Belief Revision under Referential Uncertainty
• Abstract summary: We introduce a data-driven framework for turn-by-turn preserve/revise decisions in dialogue.<n>Two findings stand out. First, a mismatch-driven policy that updates solely based on local divergence reacts strongly to mismatch but destabilizes grounding and degrades retrieval.<n>Second, an uncertainty-sensitive policy extends mismatch-based updating with accumulated evidence, preserving coherent understanding while maintaining strong retrieval performance.
• Score: 25.914720114964457
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: When a speaker refers to a scene that the listener cannot directly see, the listener must decide whether to preserve its current understanding or revise it as new utterances arrive. Many language systems treat local mismatch as a cue for updating: divergence from the current understanding encourages adjustment. Yet conversational understanding may be more conservative, interpreting mismatching evidence relative to prior understanding rather than immediately revising it. We introduce a controlled, data-driven framework for turn-by-turn preserve/revise decisions in dialogue, where competing revision policies are learned under otherwise identical conditions. We compare four theory-driven revision strategies, each reflecting a different assumption about when listeners should preserve or revise. Two findings stand out. First, a mismatch-driven policy that updates solely based on local divergence reacts strongly to mismatch but destabilizes grounding and degrades retrieval. Second, an uncertainty-sensitive policy extends mismatch-based updating with accumulated evidence, preserving coherent understanding while maintaining strong retrieval performance. Surprisingly, coherent understanding emerges from a counterintuitive pattern: local mismatch promotes preservation, whereas accumulated uncertainty promotes revision, suggesting that listeners maintain prior understanding despite local mismatch and revise only when uncertainty sufficiently accumulates. This pattern is consistent with conceptual pact theory.

Related papers

• Using Semantic Uncertainty to Estimate Transition Relevance in Turn-taking [0.675253870287079]
  Turn-taking is a fundamental mechanism that governs when interlocutors speak and listen.<n>We examine whether semantic constraints inform perceived turn-taking opportunities in unscripted interaction.
  arXiv  Detail & Related papers  (2026-09-10T00:41:23Z)
• Why2Speak: Faithful Reasoning for Abstaining Action Policies [0.19336815376402716]
  We compare direct decision policies, reasoning policies, supervised fine-tuning, and reinforcement learning.<n>We find a capability-auditability tradeoff: the strongest direct policy achieves higher quality but exposes no reasoning to inspect.<n>Supervised fine-tuning either suppresses reasoning or preserves it without improving decision quality, while reinforcement learning also fails to improve the reasoning policy.
  arXiv  Detail & Related papers  (2026-08-21T02:00:21Z)
• Inference-Time Steering for Cross-Lingual Factual Consistency in LLMs [51.56484100374058]
  Large Language Models (LLMs) demonstrate remarkable multilingual fluency, but their internal knowledge representations remain disproportionately biased toward high-resource languages.<n>We investigate whether these biases can be mitigated at inference time, forcing an English-prompted model to answer as if it were queried in target languages.<n>Experiments on Gemma 3 12B Instruct reveal persona prompting to be the strongest overall intervention, balancing efficacy, safety, and out-of-domain generalization.
  arXiv  Detail & Related papers  (2026-07-21T16:15:05Z)
• StateFuse: Deterministic Conflict-Preserving Memory for Multi-Agent Systems [6.160059055899747]
  StateFuse is a conflict-aware replicated memory contract built on standard OpSet/CRDT merge.<n>We evaluate StateFuse against flat multi-value, raw-log, provenance-style, and collapsed baselines under matched resolver and verification policies.
  arXiv  Detail & Related papers  (2026-07-07T05:06:33Z)
• Change My View? The Dynamics of Persuasion and Polarization in Online Discourse [6.390103958990699]
  We use large language models to analyze a corpus of debates on Reddit's r/ChangeMyView.<n>We find that effective public reasoning depends as much on relational framing as on evidential content.
  arXiv  Detail & Related papers  (2026-05-08T18:40:51Z)
• Empathy as Predictive Misalignment Tolerance: A Co-Regulation Framework and the Regime Structure of Dialogue Repair [0.0]
  We argue this is the wrong target for extended dialogue, where understanding unfolds over time through prediction, divergence, and repair.<n>We gist this as Interpretive Error Tolerance (IET), a dynamic-threshold that models empathy as maintaining a viable band of divergence between agents.<n>We interpret this structure through IET, suggesting that empathy in extended interaction is not eliminating divergence but regulating its dynamics.
  arXiv  Detail & Related papers  (2026-05-05T19:29:04Z)
• FRESCO: Benchmarking and Optimizing Re-rankers for Evolving Semantic Conflict in Retrieval-Augmented Generation [73.22935457705057]
  We introduce FRESCO, a benchmark for evaluating re-rankers in temporally dynamic contexts.<n>By pairing recency-seeking queries with historical Wikipedia revisions, FRESCO tests whether re-rankers can prioritize factually recent evidence while maintaining semantic relevance.<n>Our evaluation reveals a consistent failure mode across existing re-rankers: a strong bias toward older, semantically rich documents, even when they are factually obsolete.
  arXiv  Detail & Related papers  (2026-04-14T17:04:25Z)
• When Contextual Inference Fails: Cancelability in Interactive Instruction Following [51.2195840589474]
  We introduce Build What I Mean, an interactive benchmark for contextual meaning construction.<n>In BWIM, models must resolve ambiguity by either performing a contextual inference or requesting clarification at a small communication cost.<n>We observe suboptimal strategies, such as partner-blind over-clarification and question-averse guessing under uncertainty.
  arXiv  Detail & Related papers  (2026-03-20T14:46:59Z)
• CORE: Context-Robust Remasking for Diffusion Language Models [51.59514489363897]
  We propose Context-Robust Remasking (CORE), a training-free framework for inference-time revision.<n>Rather than trusting static token probabilities, CORE identifies context-brittle tokens by probing their sensitivity to targeted masked-context perturbations.<n>On LLaDA-8B-Base, CORE delivers consistent improvements across reasoning and code benchmarks, outperforming compute-matched baselines and improving MBPP by up to 9.2 percentage points.
  arXiv  Detail & Related papers  (2026-02-04T00:12:30Z)
• Critical or Compliant? The Double-Edged Sword of Reasoning in Chain-of-Thought Explanations [60.27156500679296]
  We study the role of Chain-of-Thought (CoT) explanations in moral scenarios by systematically perturbing reasoning chains and manipulating delivery tones.<n>Our findings reveal two key effects: (1) users often trust with outcome agreement, sustaining reliance even when reasoning is flawed.<n>These results highlight how CoT explanations can simultaneously clarify and mislead, underscoring the need for NLP systems to provide explanations that encourage scrutiny and critical thinking rather than blind trust.
  arXiv  Detail & Related papers  (2025-11-15T02:38:49Z)
• A New Bandit Setting Balancing Information from State Evolution and Corrupted Context [52.67844649650687]
  We propose a new sequential decision-making setting combining key aspects of two established online learning problems with bandit feedback. The optimal action to play at any given moment is contingent on an underlying changing state which is not directly observable by the agent. We present an algorithm that uses a referee to dynamically combine the policies of a contextual bandit and a multi-armed bandit.
  arXiv  Detail & Related papers  (2020-11-16T14:35:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.