A Mathematical Theory of Interpretation: Rational Entropy, Spectral Readout, and Confusability as a Resource

• URL: http://arxiv.org/abs/2608.23892v1
• Date: Mon, 24 Aug 2026 23:03:06 GMT
• Title: A Mathematical Theory of Interpretation: Rational Entropy, Spectral Readout, and Confusability as a Resource
• Abstract summary: MTI makes interpretation a method-design problem.<n>A four-condition certificate characterizes sharp, decodable, medium-faithful, and order-independent readout.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: This article presents the abridged core of \emph{A Mathematical Theory of Interpretation} (MTI), which treats interpretation as observer-relative spectral measurement under an access structure. MTI makes interpretation a method-design problem: access, query, utility, and medium determine what an observer can select, identify, communicate, or refuse. On a learning-invariant Hilbert realization, Rational Entropy measures residual uncertainty across knowledge, utility, and medium. In the finite-effective regime, we classify its zero set. Pairwise confusability is equivalent to uniform atomic collapse, while a unique utility maximum can select one atom even when other zero-cost states remain non-atomic. This reverses the usual zero-error role of confusability: agreement in at least one observer direction excludes unresolved multi-atom readings, while the joint label preserves identification. The corresponding free-design capacity is the product of all but the smallest direction budget. A four-condition certificate characterizes sharp, decodable, medium-faithful, and order-independent readout on a finite commuting code sector and returns typed obstructions when those guarantees fail. Together, these results establish MTI as a theoretical basis for constructing interpretation methods with explicit access assumptions, guarantees, and failure modes.

Related papers

• Intrinsic Structure: Spectral Identifiability for Mechanistic Interpretability [51.56484100374058]
  We prove the first identifiability theorem for a mechanistic-interpretability primitive.<n>The spectrum is an identifiable, model-intrinsic fingerprint with a stated error bar, not a legible decomposition.
  arXiv  Detail & Related papers  (2026-08-10T19:42:01Z)
• What Syntax Cannot See: The Dynamic Syntactic Invariance Principle and Several Instances of the Same Hidden Assumption, and a Contradiction [0.0]
  This paper develops a single method, find what an accepted result silently assumed, make it a variable, and prove what follows once it is dropped.<n>It shows it keeps working across domains with nothing in common.
  arXiv  Detail & Related papers  (2026-08-02T03:10:44Z)
• The conditional-mean barrier: From deterministic regression to conditional distribution learning [6.160113667162026]
  This tutorial develops a self-contained module centered on the conditional-mean barrier.<n>Adding latent randomness to a squared-loss predictor collapses it back to the conditional mean.<n>We briefly organize common distributional objectives, including negative log-likelihood, moment and observable matching, variational objectives, adversarial divergences, and score matching.
  arXiv  Detail & Related papers  (2026-05-27T07:31:42Z)
• Diverse Dictionary Learning [47.381311762862985]
  Given only observational data $X = g(Z)$, where both the latent variables $Z$ and the generating process $g$ are unknown, recovering $Z$ is ill-posed without additional assumptions.<n>We show that intersections, complements, and symmetric differences of latent variables linked to arbitrary observations, along with the latent-to-observed dependency structure, are still identifiable up to appropriate indeterminacies.
  arXiv  Detail & Related papers  (2026-04-19T18:18:34Z)
• The Observer-Situation Lattice: A Unified Formal Basis for Perspective-Aware Cognition [2.28438857884398]
  We introduce the Observer-Situation Lattice (OSL), a unified mathematical structure that provides a single, coherent semantic space for perspective-aware cognition.<n>OSL is a finite complete lattice where each element represents a unique observer-situation pair, allowing for a principled and scalable approach to belief management.<n>We present two key algorithms that operate on this lattice: (i) Relativized Belief propagation, an incremental update algorithm that efficiently propagates new information, and (ii) Minimal Contradiction Decomposition, a graph-based procedure that identifies and isolates contradiction components.
  arXiv  Detail & Related papers  (2026-03-02T03:15:36Z)
• Physics-Aware Learnability: From Set-Theoretic Independence to Operational Constraints [0.0]
  We introduce physics-aware learnability, which defines the learnability relative to an explicit access model.<n>For finite no-signaling and quantum models, PL feasibility becomes linear or semidefinite.
  arXiv  Detail & Related papers  (2026-02-28T02:34:09Z)
• Partial Feedback Online Learning [88.27143767009376]
  We study a new learning protocol, termed partial-feedback online learning.<n>Each instance admits a set of acceptable labels, but the learner observes only one acceptable label per round.
  arXiv  Detail & Related papers  (2026-01-29T09:39:11Z)
• Time Symmetry, Retrocausality, and Emergent Collapse: The Tlalpan Interpretation of Quantum Mechanics [51.56484100374058]
  The Tlalpan Interpretation (QTI) proposes that the wavefunction collapse is not a primitive, axiomatic rule but an emergent phenomenon.<n>The novelty of QTI lies in its embedding of collapse within the conceptual language of critical phenomena in statistical physics.
  arXiv  Detail & Related papers  (2025-08-25T20:30:56Z)
• Prototype-based Aleatoric Uncertainty Quantification for Cross-modal Retrieval [139.21955930418815]
  Cross-modal Retrieval methods build similarity relations between vision and language modalities by jointly learning a common representation space. However, the predictions are often unreliable due to the Aleatoric uncertainty, which is induced by low-quality data, e.g., corrupt images, fast-paced videos, and non-detailed texts. We propose a novel Prototype-based Aleatoric Uncertainty Quantification (PAU) framework to provide trustworthy predictions by quantifying the uncertainty arisen from the inherent data ambiguity.
  arXiv  Detail & Related papers  (2023-09-29T09:41:19Z)
• Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication [60.18814584837969]
  We introduce the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility. We are able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
  arXiv  Detail & Related papers  (2022-11-16T21:33:31Z)
• Neuro-Symbolic Entropy Regularization [78.16196949641079]
  In structured prediction, the goal is to jointly predict many output variables that together encode a structured object. One approach -- entropy regularization -- posits that decision boundaries should lie in low-probability regions. We propose a loss, neuro-symbolic entropy regularization, that encourages the model to confidently predict a valid object.
  arXiv  Detail & Related papers  (2022-01-25T06:23:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.