Skip to content
Preprint

The Objective Decides: When a Learned Dynamics Model Uses a Conserved Quantity

Jul 2026 · 0 citations · 48 references
Computer Science

TL;DR

It is argued that causal deployment, not decodability, is what interpretability should measure when the question is whether a model uses a piece of knowledge, and a cheap instrument for measuring it is given.

Abstract

A linear probe that recovers a conserved quantity from a learned dynamics model's activations is routinely read as evidence that the model uses that quantity. We show this inference is unsound. Across mechanical, circuit, and partial-differential-equation (PDE) systems, and on a 158M-parameter pretrained PDE foundation model, energy and other invariants are linearly decodable at $R^2 \approx 1$ yet causally inert on next-state prediction: overwriting the decoded direction with a donor state's value (single-step activation interchange) leaves the forward pass essentially unchanged (transfer-corr $\tau \approx 0$). The same direction in the same representation becomes causally load-bearing ($\tau \to +1$) the moment the training objective rewards the invariant, so deployment is a property of the objective, not of the representation or the probe. We further show that when an invariant is deployed is governed by a precise algebraic predicate (its relation to the prediction output), by flipping a single invariant from inert to load-bearing by changing only the output's algebra. Finally, the gap has teeth: across models that all decode the target at $R^2 = 1.00$, the deployment gap forecasts out-of-distribution (OOD) accuracy ($r = +0.97$) where decodability is blind. We argue that causal deployment, not decodability, is what interpretability should measure when the question is whether a model uses a piece of knowledge, and we give a cheap instrument for measuring it.

View source

Similar papers

Preprint Aug 2026

Can a Dynamic Internal Field Govern a Transformer's Cognition? Certifiability, not Superiority, in Homeostatic Compute Control

A discrete Schur-Cohn criterion for Verlet with velocity coupling, necessary and sufficient per latent root, with no commutation hypothesis is proved here: a discrete Schur-Cohn criterion for Verlet with velocity coupling.

F. Arrabal-Campos, Ignacio Fernández, Francisco G. Montoya et al. · 1 citation
Preprint Aug 2026

Finite-Horizon Input-Output Dynamics of Minibatch Perturbations in AdamW

This work forms AdamW as a finite-horizon input--state--output (ISO) system whose state contains the model parameters and first- and second-moment estimates, and derives an exact multistep error decomposition and establishes first-order finite-horizon accuracy under local smoothness and controlled activation switching.

Kangning Liu, Su-Yan Li · 1 citation
#robotics Jul 2026

What Can Latent World Models Know? Physical Parameter Identifiability in Multimodal Predictive Representations

A central premise of latent world models is that predicting the future forces a representation to internalize the physics of its environment. Which physical quantities does a trained latent actually contain, and what decides this? We answer with controlled interventions in POKEWORLD, an interactive environment whose vi...

Kai-Zhen Tan, Xin Xu, Siru Tao et al. · 2 citations
#machine learning Preprint Aug 2026

Hidden Gauge Controls Feature Specialization in ReLU Networks

This work shows that changing the scale of initial weights can determine which neurons learn a feature without altering any neuron's initial contribution, and reveals how initialization can control the organization of a learned representation without changing what the network initially represents.

Tong-Xi Wang · 1 citation

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