2020 IEEE International Symposium on Information Theory (ISIT)最新文献_第4页

Age-of-Information Revisited: Two-way Delay and Distribution-oblivious Online Algorithm 重新审视信息时代:双向延迟和分布无关在线算法

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174306

Cho-Hsin Tsai, Chih-Chun Wang

引用次数: 14

Characterizing the Bethe Partition Function of Double-Edge Factor Graphs via Graph Covers 利用图盖刻画双边因子图的Bethe配分函数

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174508

Yuwen Huang, P. Vontobel

{"title":"Characterizing the Bethe Partition Function of Double-Edge Factor Graphs via Graph Covers","authors":"Yuwen Huang, P. Vontobel","doi":"10.1109/ISIT44484.2020.9174508","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174508","url":null,"abstract":"For standard factor graphs (S-FGs), i.e., factor graphs with local functions taking on non-negative real values, Vontobel gave a characterization of the Bethe approximation to the partition function in terms of the partition function of finite graph covers. The proof of that statement heavily relied on the method of types.In this paper we give a similar characterization for so-called double-edge factor graphs (DE-FGs), which are a class of factor graphs where local functions take on complex values and have to satisfy some positive semi-definiteness constraints. Such factor graphs are of interest in quantum information processing.In general, approximating the partition function of DE-FGs is more challenging than for S-FGs because the partition function is a sum of complex values and not just a sum of non-negative real values. In particular, for proving the above-mentioned characterization of the Bethe approximation in terms of finite graph covers, one cannot use the method of types anymore. We overcome this challenge by applying the loop-calculus transform by Chertkov and Chernyak, along with using the symmetricsubspace transform, a novel technique for factor graphs that should be of interest beyond proving the main result of this paper. Currently, the characterization of the Bethe approximation of the partition function of DE-FGs is for DE-FGs satisfying an (easily checkable) condition. However, based on numerical results, we suspect that the characterization holds more broadly.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115358765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Resolvability of the Multiple Access Channel with Two-Sided Cooperation 双边合作下多址信道的可解析性

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174302

Noha Helal, M. Bloch, Aria Nosratinia

引用次数: 0

Maximum Likelihood Decoding for Channels with Uniform Noise and Signal Dependent Offset 具有均匀噪声和信号相关偏移的信道的最大似然解码

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174270

R. Bu, J. Weber, Kees A. Schouhamer Immink

引用次数: 1

Achievable Rates for Strategic Communication 战略沟通的可实现率

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174307

Anuj S. Vora, Ankur A. Kulkarni

引用次数: 20

On Binary Statistical Classification from Mismatched Empirically Observed Statistics 从不匹配的经验观察统计数据看二元统计分类

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174520

H. Hsu, I-Hsiang Wang

{"title":"On Binary Statistical Classification from Mismatched Empirically Observed Statistics","authors":"H. Hsu, I-Hsiang Wang","doi":"10.1109/ISIT44484.2020.9174520","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174520","url":null,"abstract":"In this paper, we analyze the fundamental limit of statistical classification with mismatched empirically observed statistics. Unlike classical hypothesis testing where we have access to the distributions of data, now we only have two training sequences sampled i.i.d. from two unknown distributions P0 and P1 respectively. The goal is to classify a testing sequence sampled i.i.d. from one of the two candidate distributions, each of which is deviated slightly from P0 and P1 respectively. In other words, there is mismatch between how the training and testing sequences are generated. The amount of mismatch is measured by the norm of the deviation in the Euclidean space. Assuming the norm of deviation is not greater than δ, we derive an asymptotically optimal test in Chernoff’s regime, and analyze its error exponents in both Stein’s regime and Chernoff’s regime. We also give both upper and lower bounds on the decrease of error exponents due to (i) unknown distributions (ii) mismatch in training and testing distributions. When δ is small, we show that the decrease in error exponents is linear in δ and characterize its first-order term.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"37 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124518817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Structural Properties of Nonanticipatory Epsilon Entropy of Multivariate Gaussian Sources 多元高斯源非预期Epsilon熵的结构性质

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174319

C. Charalambous, Themistoklis Charalambous, C. Kourtellaris, J. van Schuppen

引用次数: 5

An Alphabet-Size Bound for the Information Bottleneck Function 信息瓶颈函数的字母大小边界

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174416

C. Hirche, A. Winter

{"title":"An Alphabet-Size Bound for the Information Bottleneck Function","authors":"C. Hirche, A. Winter","doi":"10.1109/ISIT44484.2020.9174416","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174416","url":null,"abstract":"The information bottleneck function gives a measure of optimal preservation of correlation between some random variable X and some side information Y while compressing X into a new random variable W with bounded remaining correlation to X. As such, the information bottleneck has found many natural applications in machine learning, coding and video compression. The main objective in order to calculate the information bottleneck is to find the optimal representation on W. This could in principle be arbitrarily complicated, but fortunately it is known that the cardinality of W can be restricted as $|mathcal{W}| leq |mathcal{X}| + 1$ which makes the calculation possible for finite $|mathcal{X}|$. Now, for many practical applications, e.g. in machine learning, X represents a potentially very large data space, while Y is from a comparably small set of labels. This raises the question whether the known cardinality bound can be improved in such situations. We show that the information bottleneck function can always be approximated up to an error $delta (varepsilon,;|mathcal{Y}|)$ with a cardinality $|mathcal{W}| leq f( in,;|mathcal{Y}|)$, for explicitly given functions δ and f of an approximation parameter ϵ > 0 and the cardinality of $mathcal{Y}$.Finally, we generalize the known cardinality boundsY to the case were some of the random variables represent quantum information.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114712101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

On MIMO Gaussian Wiretap Channels with Optimal Energy Harvesting 基于最优能量收集的MIMO高斯窃听信道研究

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174147

Nima Tavangaran, M. Vaezi, H. Poor

引用次数: 1

ISIT 2020 Organizing Committee ISIT 2020组委会

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/isit44484.2020.9174530

引用次数: 0