A Divergence Formula for Randomness and Dimension
Jack H. Lutz

TL;DR
This paper establishes a divergence formula linking the dimension of sequences with respect to a probability measure to the Shannon entropy and Kullback-Leibler divergence, providing a new way to measure the similarity of probability measures using randomness.
Contribution
It introduces a divergence formula connecting sequence dimensions, entropy, and divergence, and extends it to finite-state dimensions and normal sequences, with new compression characterizations.
Findings
The divergence formula holds for random sequences with respect to computable measures.
The formula extends to all $eta$-normal sequences using finite-state dimensions.
Finite-state compression characterizations of dimensions are established.
Abstract
If is an infinite sequence over a finite alphabet and is a probability measure on , then the {\it dimension} of with respect to , written , is a constructive version of Billingsley dimension that coincides with the (constructive Hausdorff) dimension when is the uniform probability measure. This paper shows that and its dual , the {\it strong dimension} of with respect to , can be used in conjunction with randomness to measure the similarity of two probability measures and on . Specifically, we prove that the {\it divergence formula} \[ \dim^\beta(R) = \Dim^\beta(R) =\frac{\CH(\alpha)}{\CH(\alpha) + \D(\alpha || \beta)} \] holds whenever and are computable, positive probability measures on and is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
