Skip to content
Preprint

A Calibrated Test of Internal Action Maps: State Signals Without Global Affine Closure

Aug 2026 · 0 citations · 16 references
Computer Science

TL;DR

This work test whether action maps fitted without a source reach its natural post-action activation and compose and validate the geometric branch on a known affine S_5 carrier: all held-source folds pass one-step, composition, inverse, decoding, and commutativity gates.

Abstract

A hidden state signal can be decodable or causally usable without supporting a reusable action map. We test whether action maps fitted without a source reach its natural post-action activation and compose. We organize the tests as an evidence lattice and validate the geometric branch on a known affine S_5 carrier: all held-source folds pass one-step, composition, inverse, decoding, and commutativity gates. Structured curvature and held-domain conjugacy raise error monotonically, but only 23/30 strongest cells flip a closure gate, bounding rather than universalizing calibration. In post-trained Qwen/Qwen3-4B, frozen final-token h28 affine maps have mean held-entity error .519, versus .398 for within-test-domain cross-fit. Seven randomized entity splits and map geometry do not support a purely entity-specific account. Earlier h4/h16 layers fit one-step transitions better, but h4 conflict-state decoding is weak and lexical controls remain unresolved. Three matched intervention datasets regenerated from one frozen checkpoint show causal effects only at h28/h36. Outcome-aware refitting improves h28 one-step error to .474 (.469 with weighting), yet no refit passes composition. Learned finite worlds likewise preserve relative algebraic signals or shared charts without held-source affine closure. Within the tested carriers, state availability, causal use, local geometry, and reusable closure are separable. The result is limited to one pretrained model, sampled final-token layers, two finite worlds, and the tested affine or diagnostic function classes.

View source

Similar papers

Preprint Aug 2026

Encoded but Not Actionable: Auditing the Decode-Generate-Steer Gap in Frozen LLMs for Geometric Constraints

Large language models (LLMs) have demonstrated strong performance on structured reasoning tasks, but what they encode and whether it informs model behavior remain unclear. We investigate this question through geometric reasoning, using parametric CAD constraints as a controlled testbed for separating local pairwise rel...

M. Liang, Xin-Zhao Cheng, Faizan Wajid · 0 citations
Jul 2026

QuantWAMs: Calibrating at the Right Granularity for World Action Models

QuantWAMs is presented, a PTQ framework that aligns quantization decisions with the calibration context defined by model structure, rollout distribution, and task objective, and co-training-objective saliency, which computes empirical-Fisher scores from the joint video--action gradient and assigns weight precision at a...

Jia-Chen Zhou, Jinfan Lv, Ruixuan Li et al. · 0 citations
Preprint Aug 2026

Diagnosing JEPA World Models with Action-Conditioned Predictive Consistency

Action-Conditioned Predictive Consistency (ACPC), a diagnostic that measures how far a clean history and a visually perturbed view of it diverge after being rolled forward under the same action sequence, is introduced and it is proved that this divergence bounds the perturbation-induced change in multi-step prediction...

Guo An, Zijing Wu, Hongzhuang Dong et al. · 3 citations
Preprint Aug 2026

Rewriting or Reweighting? A Geometric Account in Language Models

Behavior manifold analysis is introduced, which isolates behavior-specific geometry by selecting sparse behavior-associated coordinates and lifting them into low-dimensional local charts, and provides a unified framework for understanding the mechanistic distinction between the two objectives.

Jun-Tong Wang, Shengkun Yang, Xiyuan Wang et al. · 0 citations
#artificial intelligence Preprint Aug 2026

HSRM: Hidden-State Reward Models for Test-Time Verification

HSRM is introduced, a lightweight hidden-state reward model that verifies candidate solutions by directly reading the generator's internal representations rather than re-processing its text, providing an efficient alternative to text-only verification by reusing representations already computed during generation.

Xianzhi Li, Xiao-Dan Zhu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.