mlsanityData to 7 Oct 2026

Mirror Horizon: Viable Path Entropy as a Measure of Bounded Reflection

arXiv 2607.11937 ↗First posted 11 Jul 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Mirror Theory proposes that an intelligent system should be studied not only by what it represents, but by what coherent continuations it can sustain under repeated reflection. We make this claim operational through viable path entropy (VPE), a finite-budget measure of verified continuation capacity. Given a mirror state, a rollout protocol, a verifier, and a mode map, VPE decomposes bounded capability into two parts: the probability of reaching a viable continuation and the diversity of verified continuation modes reached among successful rollouts. This paper restores the full theoretical scaffold behind the measure: intuition as local underdetermining constraint, taste as invariant-selecting pressure, reflection as taste-guided resolution of underdetermination, and geometry as the learned structure that makes future reflection stable. We then instantiate the theory in language-model reasoning experiments on GSM8K. Across Qwen2.5-Instruct models, 32 sampled rollouts per problem, and two reflection horizons, increasing the token budget from 96 to 160 substantially expands verified reachability, reduces zero-reachability, increases verified-mode entropy, and improves smoothed VPE. At 160 tokens, Qwen2.5-1.5B realizes the strongest mirror horizon among the tested models, even though Qwen2.5-3B has more parameters. This shows that mirror horizon is not parameter count, but accessible verified continuation capacity under a bounded reflection protocol. The result supports Mirror Theory as a measure-level account: capability is the structure of viable continuations made reachable, not merely one-shot accuracy or pass@k.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 19 references that are in the map. First posted on arXiv 11 Jul 2026.

Builds on

11 of 19 references.

References · 11

  1. 2022Training language models to follow instructions with human feedbackcited by 15,712
  2. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
  3. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  4. 2020Scaling Laws for Neural Language Modelscited by 6,411
  5. 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,601
  6. 2022Training Compute-Optimal Large Language Modelscited by 2,927
  7. 2018A mathematical theory of semantic development in deep neural networkscited by 182
  8. 2026From Entropy to Epiplexity: Rethinking Information for Computationally Bounded Intelligencecited by 39
  9. 2025The Coverage Principle: How Pre-Training Enables Post-Trainingcited by 25
  10. 2026Zipping the Thought: When and How Compressed Reasoning Data Works in LLM Post-Trainingcited by 2
  11. 2026Effective Frontiers: A Unification of Neural Scaling Lawscited by 1

Built on by

Not cited yet.