mlsanityData to 14 Oct 2026

A Transport-Based Geometry of Belief-Cost

arXiv 2606.21585 ↗First posted 19 Jun 2026cs.LG cs.IT math.DGcited by 0

Not on the map. Why?

Abstract (arXiv)

A finite agent, a machine's digital twin or any bounded reasoner, infers a fixed and noisy world through finite sensors, so its coherent output is a belief: a probability density over states (the Bayes posterior). Such an agent stops short of certainty, and revising a belief carries a cost. We propose a framework for belief costs based on optimal transport, motivated by these facts. We pose two postulates. P0 (the arena): a revision cost is a scalar price on optimal transport, so beliefs live in Wasserstein space. P1 (uniform pricing): one nat of knowledge costs the same metric length everywhere, the eikonal condition. Among conceivable pricing rules we study this one. Under P0 and P1 the cost metric is optimal transport conformally reweighted by Fisher information, tilde ge,U=2(e+U),gW2, and the Fisher family is a characterization: among continuous reliefs, uniform pricing is equivalent to U=cJ. Two consequences follow on the conformal class. Certainty sits at infinite cost-distance once the relief dominates the Fisher information, so a well-posed inference has a cost floor diverging at certainty (necessity conjectural beyond power laws). On location-scale leaves the geometry is hyperbolic, and the Stam bound places the Gaussian as the most curved one (at e=0). The results are geometric, in nats, and hold up to units: a change of cost unit rescales all distances and preserves every conclusion (boundary, eikonal family, hyperbolicity, Gaussian extremum), a gauge theorem; a global change of state units at e=0 is an isometry; the content lies in signs, rankings and ratios. Via Landauer (one nat worth kBT) the cost floor becomes an energy floor: revising toward certainty would demand unbounded energy. Physics anchors the unit and enters no theorem. Removing either postulate leaves the selection open.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 74 references that are in the map. First posted on arXiv 19 Jun 2026.

Builds on

10 of 74 references.

References · 10

  1. 2020Scaling Laws for Neural Language Modelscited by 6,586
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  3. 2022Training Compute-Optimal Large Language Modelscited by 3,019
  4. 2021Explaining Neural Scaling Lawscited by 363
  5. 2017On Quadratic Penalties in Elastic Weight Consolidationcited by 55
  6. 2019A free energy principle for a particular physicscited by 40
  7. 2018Natural gradient via optimal transportcited by 20
  8. 2023Information Geometry of Wasserstein Statistics on Shapes and Affine Deformationscited by 3
  9. 2025On the Variational Costs of Changing Our Mindscited by 1
  10. 2026A Thermodynamic Theory of Learning I: Irreversible Ensemble Transport and Epistemic Costscited by 1

Built on by

Not cited yet.