Universal Bayesian Measures and Universal Histogram Sequences
Joe Suzuki

TL;DR
This paper introduces a universal Bayesian measure that generalizes data compression and model estimation to sources with discrete, continuous, or mixed variables, overcoming limitations of histogram-based methods.
Contribution
It extends the concept of universal Bayesian measures to more general sources, improving model approximation and inference capabilities beyond traditional histogram approaches.
Findings
Constructed a universal Bayesian measure applicable to mixed variable types.
Overcame limitations of histogram range dependency in source modeling.
Extended applications of the minimum description length principle.
Abstract
Consider universal data compression: the length of sequence with finite alphabet and length satisfies Kraft's inequality over , and almost surely converges to zero as grows for the and any stationary ergodic source . In this paper, we say such a is a universal Bayesian measure. We generalize the notion to the sources in which the random variables may be either discrete, continuous, or none of them. The basic idea is due to Boris Ryabko who utilized model weighting over histograms that approximate , assuming that a density function of exists. However, the range of depends on the choice of the histogram sequence. The universal Bayesian measure constructed in this paper overcomes the drawbacks and has many applications to infer relation among random variables, and…
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
TopicsAlgorithms and Data Compression · Bayesian Methods and Mixture Models · Machine Learning and Algorithms
