A Divergence Formula for Randomness and Dimension (Short Version)
Jack H. Lutz

TL;DR
This paper introduces a divergence formula linking the dimension of random sequences to the Shannon entropy and Kullback-Leibler divergence between probability measures, providing a new way to measure measure similarity.
Contribution
It establishes a divergence formula connecting the dimension of sequences, randomness, and measure similarity using Shannon entropy and Kullback-Leibler divergence.
Findings
Proves the divergence formula for computable, positive probability measures.
Shows the relation between dimension, entropy, and divergence for random sequences.
Provides a new measure of similarity between probability measures.
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} holds whenever and are computable, positive probability measures on and is random with…
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.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Mathematical Dynamics and Fractals · Benford’s Law and Fraud Detection
