Computable Bayesian compression for uniformly discretizable statistical models
From MaRDI portal
Recommendations
Cites work
- Data compression and histograms
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3492569 (Why is no real title available?)
- scientific article; zbMATH DE number 3602484 (Why is no real title available?)
- scientific article; zbMATH DE number 472936 (Why is no real title available?)
- scientific article; zbMATH DE number 509157 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 3189754 (Why is no real title available?)
- Iterated logarithmic expansions of the pathwise code lengths for exponential families
- Minimum description length induction, Bayesianism, and Kolmogorov complexity
- On a definition of random sequences with respect to conditional probability
- Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
- The consistency of the BIC Markov order estimator.
- The minimum description length principle in coding and modeling
- Universal codeword sets and representations of the integers
- Von Mises' definition of random sequences reconsidered
Cited in
(4)
This page was built for publication: Computable Bayesian compression for uniformly discretizable statistical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648742)