Table of Contents
Fetching ...

A Theory of the Mechanics of Information: Generalization Through Measurement of Uncertainty (Learning is Measuring)

Christopher J. Hazard, Michael Resnick, Jacob Beel, Jack Xia, Cade Mack, Dominic Glennie, Matthew Fulp, David Maze, Andrew Bassett, Martin Koistinen

TL;DR

The paper proposes a model-free, information-theoretic framework for learning and inference built on surprisal, aiming to replace distribution-modeling approaches with a data-centric, traceable method. By treating uncertainty as a distance and deriving discriminative/generative inferences, the authors unify tasks such as causal discovery, anomaly detection, time-series forecasting, and supervised learning under a single, interpretable paradigm. Key contributions include formal definitions of deviations, feature influence, and conviction-based diagnostics; a nearest-neighbors-like inference engine; and a scalable implementation (Howso Engine/Amalgam) with data compression, privacy-aware synthesis, and reinforcement-learning connections. Empirically, the approach demonstrates competitive performance across diverse tasks, robustness to missing data and adversarial conditions, and promising data-efficient scalability via hierarchical sharding and ablation. Collectively, this work foregrounds a physics-of-information viewpoint as a viable, human-understandable alternative path to neural networks for scalable AI.

Abstract

Traditional machine learning relies on explicit models and domain assumptions, limiting flexibility and interpretability. We introduce a model-free framework using surprisal (information theoretic uncertainty) to directly analyze and perform inferences from raw data, eliminating distribution modeling, reducing bias, and enabling efficient updates including direct edits and deletion of training data. By quantifying relevance through uncertainty, the approach enables generalizable inference across tasks including generative inference, causal discovery, anomaly detection, and time series forecasting. It emphasizes traceability, interpretability, and data-driven decision making, offering a unified, human-understandable framework for machine learning, and achieves at or near state-of-the-art performance across most common machine learning tasks. The mathematical foundations create a ``physics'' of information, which enable these techniques to apply effectively to a wide variety of complex data types, including missing data. Empirical results indicate that this may be a viable alternative path to neural networks with regard to scalable machine learning and artificial intelligence that can maintain human understandability of the underlying mechanics.

A Theory of the Mechanics of Information: Generalization Through Measurement of Uncertainty (Learning is Measuring)

TL;DR

The paper proposes a model-free, information-theoretic framework for learning and inference built on surprisal, aiming to replace distribution-modeling approaches with a data-centric, traceable method. By treating uncertainty as a distance and deriving discriminative/generative inferences, the authors unify tasks such as causal discovery, anomaly detection, time-series forecasting, and supervised learning under a single, interpretable paradigm. Key contributions include formal definitions of deviations, feature influence, and conviction-based diagnostics; a nearest-neighbors-like inference engine; and a scalable implementation (Howso Engine/Amalgam) with data compression, privacy-aware synthesis, and reinforcement-learning connections. Empirically, the approach demonstrates competitive performance across diverse tasks, robustness to missing data and adversarial conditions, and promising data-efficient scalability via hierarchical sharding and ablation. Collectively, this work foregrounds a physics-of-information viewpoint as a viable, human-understandable alternative path to neural networks for scalable AI.

Abstract

Traditional machine learning relies on explicit models and domain assumptions, limiting flexibility and interpretability. We introduce a model-free framework using surprisal (information theoretic uncertainty) to directly analyze and perform inferences from raw data, eliminating distribution modeling, reducing bias, and enabling efficient updates including direct edits and deletion of training data. By quantifying relevance through uncertainty, the approach enables generalizable inference across tasks including generative inference, causal discovery, anomaly detection, and time series forecasting. It emphasizes traceability, interpretability, and data-driven decision making, offering a unified, human-understandable framework for machine learning, and achieves at or near state-of-the-art performance across most common machine learning tasks. The mathematical foundations create a ``physics'' of information, which enable these techniques to apply effectively to a wide variety of complex data types, including missing data. Empirical results indicate that this may be a viable alternative path to neural networks with regard to scalable machine learning and artificial intelligence that can maintain human understandability of the underlying mechanics.
Paper Structure (86 sections, 2 theorems, 86 equations, 16 figures, 18 tables, 3 algorithms)

This paper contains 86 sections, 2 theorems, 86 equations, 16 figures, 18 tables, 3 algorithms.

Key Result

Theorem 1

The expected distance between two random variables $X$ and $Y$ given that they both follow the Laplace distribution with a distributional parameter $b$ and with respective means $\mu_1$ and $\mu_2$ can be found as $d(X, Y) = |\mu_2 - \mu_1| + \frac{1}{2} e^\frac{-|\mu_2 - \mu_1|}{b} \left( 3 b + |\m

Figures (16)

  • Figure 1: Sluice gate (H Stamper / sluice gate / CC BY-SA 2.0, via Wikipedia).
  • Figure 2: An example of prediction performance where the horizontal axis represents the fraction of data elements that are null.
  • Figure 3: An example of inspecting a prediction.
  • Figure 4: An example of inspecting the most anomalous records.
  • Figure 5: ROAR curves comparing Howso Prediction Contributions, Howso Accuracy Contributions, and SHAP on diabetes (MAE) and breast cancer (Accuracy) with XGBoost; 3 seeds, no tuning.
  • ...and 11 more figures

Theorems & Definitions (4)

  • Theorem 1
  • proof
  • Theorem 2
  • proof