AI Safety

New theory unifies AI reward functions with information geometry

Proper scoring rules turn out to be generalized entropy measures—not just log loss.

Deep Dive

Proper scoring rules aren't just about evaluating forecasts — they're a doorway to generalized information theory. The logarithmic scoring rule prices information precisely as mutual information, but the same logic extends further: any convex function generates its own entropy, cross-entropy, and Bregman divergence. The quadratic score, for example, gives rise to the Gini impurity, and the gap between an entropy function and its tangent plane defines a generalized KL divergence. In this picture, entropy and cross-entropy are equally fundamental, and each information measure is just the vertical gap between a curve and its supporting tangent plane.

Key Points
  • Every convex entropy function induces a proper scoring rule via tangent-plane geometry
  • Quadratic scoring corresponds to Gini impurity, while log scoring maps exactly to mutual information
  • Bregman divergence measures belief overconfidence and generalizes KL divergence across scoring rules

Why It Matters

Reward design is really information design—choosing a scoring rule determines what AI agents learn to optimize.

📬 Get the top 10 AI stories daily