Entropy of random symbolic high-order bilinear Markov chains
S. S. Melnik, O. V. Usatenko
TL;DR
This paper develops an analytical method to estimate the entropy of high-order bilinear Markov chains with symbolic sequences, enhancing understanding of their informational complexity.
Contribution
It provides a detailed analytical approach to compute the entropy of high-order bilinear Markov chains, a novel contribution in the study of symbolic sequences.
Findings
Derived explicit entropy formulas for bilinear Markov chains
Enhanced understanding of the informational properties of high-order sequences
Provided a comprehensive analytical framework for entropy estimation
Abstract
The main goal of this paper is to develop an estimate for the entropy of random stationary ergodic symbolic sequences with elements belonging to a finite alphabet. We present here the detailed analytical study of the entropy for the high-order Markov chain in the bilinear approximation. The appendix contains a short comprehensive introduction into the subject of study.
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.