Intrinsic Randomness Problem with Respect to a Subclass of f-divergence

R. Nomura
{"title":"Intrinsic Randomness Problem with Respect to a Subclass of f-divergence","authors":"R. Nomura","doi":"10.1109/itw44776.2019.8989245","DOIUrl":null,"url":null,"abstract":"This paper deals with the intrinsic randomness (IR) problem, which is one of typical random number generation problems. In the literature, the optimum achievable rates in the IR problem with respect to the variational distance as well as the Kullback-Leibler (KL) divergence have already been analyzed. On the other hand, in this study we consider the IR problem with respect to a subclass of f-divergences. The f-divergence is a general non-negative measure between two probabilistic distributions and includes several important measures such as the total variational distance, the $\\chi^{2}-$divergence, the KL divergence, and so on. Hence, it is meaningful to consider the IR problem with respect to the f-divergence. In this paper, we assume some conditions on the f-divergence for simplifying the analysis. That is, we focus on a subclass of f-divergences. In this problem setting, we first derive the general formula of the optimum achievable rate. Next, we show that it is easy to derive the optimum achievable rate with respect to the variational distance, the KL divergence, and the Hellinger distance from our general formula.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Information Theory Workshop (ITW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/itw44776.2019.8989245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper deals with the intrinsic randomness (IR) problem, which is one of typical random number generation problems. In the literature, the optimum achievable rates in the IR problem with respect to the variational distance as well as the Kullback-Leibler (KL) divergence have already been analyzed. On the other hand, in this study we consider the IR problem with respect to a subclass of f-divergences. The f-divergence is a general non-negative measure between two probabilistic distributions and includes several important measures such as the total variational distance, the $\chi^{2}-$divergence, the KL divergence, and so on. Hence, it is meaningful to consider the IR problem with respect to the f-divergence. In this paper, we assume some conditions on the f-divergence for simplifying the analysis. That is, we focus on a subclass of f-divergences. In this problem setting, we first derive the general formula of the optimum achievable rate. Next, we show that it is easy to derive the optimum achievable rate with respect to the variational distance, the KL divergence, and the Hellinger distance from our general formula.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于f-散度子类的固有随机性问题
本文研究的是典型的随机数生成问题之一的固有随机性问题。在文献中,关于变分距离和Kullback-Leibler (KL)散度,已经分析了IR问题的最佳可实现速率。另一方面,在本研究中,我们考虑关于f-散度子类的IR问题。f-散度是两个概率分布之间的一般非负度量,包括几个重要的度量,如总变分距离、$\chi^{2}-$散度、KL散度等。因此,考虑关于f散度的IR问题是有意义的。为了简化分析,本文假定了f-散度的一些条件。也就是说,我们关注的是f散度的一个子类。在这个问题集中,我们首先推导出最优可达率的一般公式。接下来,我们证明了很容易从我们的一般公式中推导出关于变分距离、KL散度和海灵格距离的最佳可实现速率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Increasing the Lifetime of Flash Memories Using Multi-Dimensional Graph-Based Codes Channel Coding at Low Capacity LDPC Code Design for Delayed Bit-Interleaved Coded Modulation Multi-library Coded Caching with Partial Secrecy Optimal Broadcast Rate of a Class of Two-Sender Unicast Index Coding Problems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1