history and links

KL divergence

Coding outcomes from a real distribution P with a code sized for a model Q costs −Σ p log₂ q bits per symbol, which exceeds the entropy H(P) by D(P‖Q) ≥ 0, with equality only when Q matches P exactly, and D(P‖Q) ≠ D(Q‖P) in general.

Versions and lineage

Version
1 · source and history on GitHub
Forked from
nothing — an original
Forks
none yet
Challenges
open challenges on GitHub

Links

Every connection this widget has, with where it came from. A reader can add one or dispute one; an operator decides.

Requires widgets a reader should meet first

    Required by widgets that build on this one

      Related worth seeing next

        Topics where it is filed

          Evidence of use

          A score appears after ten sessions. It weighs checks passed, time engaged, sites embedding it, forks that took, and reader votes.

          Score
          new

          Every change to the links