Reinforcement-learning models commonly predict complete future states, observations, or feature occupancies, even though action selection depends only on differences between the consequences of candidate actions. As a result, these models may devote substantial statistical and representational capacity to high-dimensional phenomena that evolve independently of the agent's current choice. We introduce the Counterfactual Quotient Model, which treats action-conditioned futures as equivalent when they differ only by a component shared across actions. Its canonical centered representation removes this common component while preserving every pairwise action comparison expressible by the modeled reward family. The implemented model learns these action-dependent effects directly from synchronized counterfactual rollouts, so shared stochastic dynamics cancel before function approximation rather than after complete futures have been predicted. We establish the decision sufficiency, identifiability, common-mode invariance, approximation behavior, and regret properties of the resulting representation. Controlled experiments in physics-based environments provide initial evidence for these properties: direct effect learning suppresses action-independent variation, supports previously unseen reward queries, and improves action ranking relative to models trained to predict absolute futures.
Figures & tables
Domain
CQM -B
World
SF
Direct value
Task-TD
COCOA
Cartpole
0.9998±0.0003
0.2521±0.1389
0.4236±0.0840
0.9904±0.0084
0.8407±0.0766
0.6445±0.0791
Reacher
0.9553±0.0290
0.2598±0.0592
0.3456±0.0647
0.8534±0.0974
0.6769±0.0892
0.6316±0.1331
Cheetah
0.6411±0.0118
0.2693±0.0901
0.3713±0.0362
0.6115±0.0523
0.5338±0.0501
0.5957±0.0398
Walker
0.3134±0.0101
0.2989±0.0114
0.2719±0.0099
0.2665±0.0375
0.2900±0.0171
0.2268±0.0357
Table 1: Held-out action accuracy over five seeds (mean ± approximate 95% confidence interval). Bold is the best learned method. Chance is 1/3 on Cartpole and 1/5 elsewhere.
Domain
CQM -B
World
SF
Direct value
Task-TD
COCOA
Cartpole
0.0000001±0.0000002
0.1909±0.0598
0.1412±0.0208
0.00007±0.00007
0.0139±0.0086
0.0850±0.0310
Reacher
0.0011±0.0005
0.1561±0.0262
0.1095±0.0349
0.0039±0.0027
0.0167±0.0082
0.0192±0.0094
Cheetah
0.0542±0.0041
0.2044±0.0327
0.1450±0.0121
0.0606±0.0143
0.0894±0.0216
0.0627±0.0078
Walker
0.2427±0.0209
0.2536±0.0199
0.2716±0.0182
0.2847±0.0332
0.2604±0.0206
0.3125±0.0099
Table 2: Held-out normalized regret (lower is better). The oracle has zero regret. Bold is the best learned method.
Domain
CQM -B
World
SF
Cartpole
0.000007
1.2182
1.0658
Reacher
0.0385
1.0369
1.0125
Cheetah
0.4503
1.0228
1.0113
Walker
1.0453
1.6460
1.1585
Table 3: Effect NMSE for the three matched vector predictors. Unlike absolute-future NMSE, this metric isolates action-dependent prediction error.
Figure 1: Held-out action-score alignment for one representative Reacher seed. Each hexagon aggregates (s,a,g) triples. The horizontal coordinate is the oracle advantage and the vertical coordinate is the model advantage, each centered over actions and normalized within (s,g) . The red diagonal is perfect agreement. CQM concentrates tightly around the diagonal (correlation 0.986 ), while the absolute world model ( 0.236 ) and successor features ( 0.542 ) show weak or fragmented action geometry. Reward-aware methods are strong but less tightly aligned.
Figure 2: CDF of held-out normalized regret for the same Reacher run. Curves farther left and higher are better. CQM places almost all queries at zero or negligible regret; the world model has a long tail, and successor features improves on the world model but remains substantially worse than the quotient and reward-aware critics.
We ask whether a small, directly addressable hidden-state intervention can place a learned world model on an intended counterfactual future and then let the model's own dynamics carry that future forward. In a controlled two-object collision environment, we study a 192-dimensional recurrent model trained on factual and locally edited counterfactual trajectories. Candidate carriers are learned from training-only counterfactual-minus-factual hidden differences, and an affine map predicts carrier coordinates from the factual state and requested edit without access to the native counterfactual hidden state at test time. For bounded single-component velocity edits, rank 4 is the smallest tested rank on the preregistered grid that satisfies the development criteria. A one-shot rank-4 patch launches a 12-transition autonomous rollout without future observations, teacher forcing, repeated hidden-state correction, or physical-state clamping. The frozen procedure satisfies the preregistered 2-of-3 fresh-checkpoint replication rule and remains reusable at nearby anchors. The same Single-derived carrier and Single-only affine map also support bounded same-object two-component requests. Across the matched training regimes, broader counterfactual support was associated mainly with better Joint rollout accuracy and more additive Joint hidden responses. Composition-related structure is enriched in the rank-4 subspace but is not confined to it, and local recurrent diagnostics show strong one-step coupling from the carrier to the rest of the hidden state. A position-edit stress test fails the required specificity controls. Together, these results support a compact dynamics-effective intervention-entry interface, not a closed four-dimensional state or an intrinsic state dimension.
Yang Liu, Yuming Chen
College of Intelligent Robotics and Advanced Manufacturing, Fudan University Shanghai, China
World-action models predict a future outcome and then infer an associated action. Although this factorization can improve representation learning and data efficiency, it is unclear whether it provides stronger control capability than direct behavior cloning when both are trained from the same observational demonstrations. We compare a direct behavior-cloning policy, an imitation-trained world-action policy, and a policy optimized with an action-conditioned world model. At the controller-class level, every world-action policy can be flattened into a direct stochastic policy with the same closed-loop trajectory distribution. At the population level, under realizability, exact optimization, common deployment information, and distribution-preserving deployment, direct behavior cloning and world-action imitation both recover the observational behavior policy. Thus, future prediction changes the learning factorization but not the unrestricted external policy class or ideal imitation target. Action-conditioned world-model learning differs by predicting outcomes under specified actions and comparing them through a control objective. We characterize the irreducible action-specific prediction error of future models that do not condition on the candidate action, identify conditions under which a world-action joint can recover an interventional forward model, and show that observational demonstrations do not identify action effects in general. Finally, we construct an environment family in which every observational learner has positive worst-case regret, whereas one informative intervention permits zero regret. The key distinction is therefore between predicting futures associated with observed behavior and predicting consequences of specified actions for policy optimization.
Accurate action models are critical for effective planning. Existing action-model learning methods largely assume simple action representations or become computationally intractable when learning conditional and quantified effects. We present Online Hypothesis-Driven Conditional Action Model Learning (OHCAM), an online approach for learning action models with conditional and quantified effects from limited interactions with the environment. OHCAM maintains a belief over hypothesized action models and actively selects informative actions to reduce uncertainty by maximizing disagreement among competing hypotheses, while being robust to noisy observations. To enable scalability, OHCAM begins with a small set of simple action model hypotheses and expands to more complex conditions only when the current hypotheses become inconsistent with the data. Experiments on six benchmark planning domains demonstrate that OHCAM is sample efficient in learning action models that solve substantially more tasks than baselines, even with observation noise. We validate OHCAM on two tasks using a Kinova Gen3 robot, demonstrating the real-world applicability of our approach.
Jeffrey Jewett, William Solow, Sandhya Saisubramanian