Shared Information for a Markov Chain on a Tree
Shared Information for a Markov Chain on a Tree
复制标题
DOI：
10.1109/isit50566.2022.9834365
复制
发表时间：
2022-06
期刊：
影响因子：
--
通讯作者：
Sagnik Bhattacharya;P. Narayan
中科院分区：
文献类型：
--
作者：
Sagnik Bhattacharya;P. Narayan
共享的信息是M≥2个共同分布的离散变量之间的相互依赖性的量度。已知，我们利用此特征的特殊形式提供了一种用于估计共享信息的多型强盗算法，并分析其错误性能。
Shared information is a measure of mutual dependence among m ≥ 2 jointly distributed discrete random variables. For a Markov chain on a tree with a given joint distribution, we give a new proof of an explicit characterization of shared information. When the joint distribution is not known, we exploit the special form of this characterization to provide a multiarmed bandit algorithm for estimating shared information, and analyze its error performance.