Sign inGet started
Paper · arXiv

The Free Inference Dimension: Complexity Measure for Zero-Collision Navigation under Hypothesis Mixtures

Solomonoff induction frames prediction as a mixture over computable hypotheses, typically leading to identification of the true environment. In a finite meta-reinforcement learning setting with nested constraint families, in our previous work, we observe a different regime: a value-mixture (VM) agent achieves near-optimal, zero-collision navigation without identifying the true environment, a phenomenon we call Free Inference. This regime persists up to a sharp density threshold, beyond which performance degrades and posterior-mode selection (PMS) becomes preferable. We formalize this behavior via the Free Inference dimension dFI(S,N), a combinatorial measure of the environmental complexit...

AuthorsLuiz Carlos Castro Guedes, Edward Hermann Haeusler
Primary categorycs.LG
Published15 September 2026
Last updated at source15 September 2026
cs.LGcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/e6e65d99-f9ed-4dda-8b27-c4af6e9ac687" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.