Arno G. Stefani, Johannes B. Huber, Christophe Jardin, H. Sticht
{"title":"二值和任意有限随机变量的互信息的紧下界作为变分距离的函数","authors":"Arno G. Stefani, Johannes B. Huber, Christophe Jardin, H. Sticht","doi":"10.1109/AusCTW.2014.6766418","DOIUrl":null,"url":null,"abstract":"In this paper a numerical method is presented, which finds a tight lower bound for the mutual information between a binary and an arbitrary finite random variable with joint distributions that have variational distance to a known joint distribution not greater than a known value. This lower bound can be applied to mutual information estimation with confidence intervals.","PeriodicalId":378421,"journal":{"name":"2014 Australian Communications Theory Workshop (AusCTW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A tight lower bound on the mutual information of a binary and an arbitrary finite random variable as a function of the variational distance\",\"authors\":\"Arno G. Stefani, Johannes B. Huber, Christophe Jardin, H. Sticht\",\"doi\":\"10.1109/AusCTW.2014.6766418\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a numerical method is presented, which finds a tight lower bound for the mutual information between a binary and an arbitrary finite random variable with joint distributions that have variational distance to a known joint distribution not greater than a known value. This lower bound can be applied to mutual information estimation with confidence intervals.\",\"PeriodicalId\":378421,\"journal\":{\"name\":\"2014 Australian Communications Theory Workshop (AusCTW)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-01-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Australian Communications Theory Workshop (AusCTW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AusCTW.2014.6766418\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Australian Communications Theory Workshop (AusCTW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AusCTW.2014.6766418","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A tight lower bound on the mutual information of a binary and an arbitrary finite random variable as a function of the variational distance
In this paper a numerical method is presented, which finds a tight lower bound for the mutual information between a binary and an arbitrary finite random variable with joint distributions that have variational distance to a known joint distribution not greater than a known value. This lower bound can be applied to mutual information estimation with confidence intervals.