发布求助
文献互助 智能选刊 最新文献

2021 IEEE International Symposium on Information Theory (ISIT)最新文献

筛选
英文 中文
An Information Inequality Motivated by the Gaussian Z-Interference Channel 高斯z -干扰信道引发的信息不平等
2021 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2021-07-12 DOI: 10.1109/ISIT45174.2021.9518133
A. Gohari, Chandra Nair, David Ng
{"title":"An Information Inequality Motivated by the Gaussian Z-Interference Channel","authors":"A. Gohari, Chandra Nair, David Ng","doi":"10.1109/ISIT45174.2021.9518133","DOIUrl":"https://doi.org/10.1109/ISIT45174.2021.9518133","url":null,"abstract":"We establish an information inequality that is motivated by the capacity region computation for the Gaussian Z-interference channel. This yields an improved slope for the capacity region at Costa's corner point. We believe the inequality may also be of independent interest as it provides a non-trivial upper bound on the entropy of sums of independent random variables.","PeriodicalId":299118,"journal":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114982258","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}
引用次数: 8
Adaptive Label Smoothing for Classifier-based Mutual Information Neural Estimation 基于互信息神经估计的自适应标签平滑
2021 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2021-07-12 DOI: 10.1109/ISIT45174.2021.9518097
Xu Wang, A. Al-Bashabsheh, Chao Zhao, Chung Chan
{"title":"Adaptive Label Smoothing for Classifier-based Mutual Information Neural Estimation","authors":"Xu Wang, A. Al-Bashabsheh, Chao Zhao, Chung Chan","doi":"10.1109/ISIT45174.2021.9518097","DOIUrl":"https://doi.org/10.1109/ISIT45174.2021.9518097","url":null,"abstract":"Estimating the mutual information (MI) by neural networks has achieved significant practical success, especially in representation learning. Recent results further reduced the variance in the neural estimation by training a probabilistic classifier. However, the trained classifier tends to be overly confident about some of its predictions, which results in an overestimated MI that fails to capture the desired representation. To soften the classifier, we propose a novel scheme that smooths the label adaptively according to how extreme the probability estimates are. The resulting MI estimate is unbiased under a mild assumption on the model. Experimental results on MNIST and CIFAR10 datasets confirmed that our method yields better representation and achieves higher classification test accuracy among existing approaches in self-supervised representation learning.","PeriodicalId":299118,"journal":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115477857","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
Fourier-Reflexive Partitions Induced by Poset Metric 由偏置度量引起的傅里叶自反分割
2021 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2021-07-12 DOI: 10.1109/ISIT45174.2021.9518140
Yang Xu, Haibin Kan, G. Han
{"title":"Fourier-Reflexive Partitions Induced by Poset Metric","authors":"Yang Xu, Haibin Kan, G. Han","doi":"10.1109/ISIT45174.2021.9518140","DOIUrl":"https://doi.org/10.1109/ISIT45174.2021.9518140","url":null,"abstract":"Let <tex>$mathrm{H}=prodnolimits_{iinOmega}H_{i}$</tex> be the cartesian product of finite abelian groups <tex>$H_{i}$</tex> indexed by a finite set <tex>$Omega$</tex>. Any partition of H gives rise to a dual partition of its character group <tex>$hat{mathrm{H}}$</tex>. A given poset (i.e., partially ordered set) P on <tex>$Omega$</tex> gives rise to the corresponding poset metric on H, which further leads to a partition <tex>$Gamma$</tex> of H. We prove that if <tex>$Gamma$</tex> is Fourier-reflexive, then its dual partition <tex>$hat{Gamma}$</tex> coincides with the partition of <tex>$hat{mathrm{H}}$</tex> induced by <tex>$overline{mathrm{P}}$</tex>, the dual poset of P, and moreover, P is necessarily hierarchical. This result establishes a conjecture proposed by Heide Gluesing-Luerssen in [4]. We also show that with some other assumptions, <tex>$hat{Gamma}$</tex> is finer than the partition of <tex>$hat{mathrm{H}}$</tex> induced by <tex>$overline{mathrm{P}}$</tex>. We prove these results by relating the partitions with certain family of polynomials, whose basic properties are studied in a slightly more general setting.","PeriodicalId":299118,"journal":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125003240","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
A Universal Lossless Compression Method applicable to Sparse Graphs and heavy-tailed Sparse Graphs 一种适用于稀疏图和重尾稀疏图的通用无损压缩方法
2021 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2021-07-12 DOI: 10.1109/ISIT45174.2021.9517897
Payam Delgosha, V. Anantharam
{"title":"A Universal Lossless Compression Method applicable to Sparse Graphs and heavy-tailed Sparse Graphs","authors":"Payam Delgosha, V. Anantharam","doi":"10.1109/ISIT45174.2021.9517897","DOIUrl":"https://doi.org/10.1109/ISIT45174.2021.9517897","url":null,"abstract":"Graphical data arises naturally in several modern applications, including but not limited to internet graphs, social networks, genomics and proteomics. The typically large size of graphical data argues for the importance of designing universal compression methods for such data. In most applications, the graphical data is sparse, meaning that the number of edges in the graph scales more slowly than $n^{2}$, where $n$ denotes the number of vertices. Although in some applications the number of edges scales linearly with $n$, in others the number of edges is much smaller than $n^{2}$ but appears to scale superlinearly with $n$. We call the former sparse graphs and the latter heavy-tailed sparse graphs. In this paper we introduce a universal lossless compression method which is simultaneously applicable to both classes. We do this by employing the local weak convergence framework for sparse graphs and the sparse graphon framework for heavy-tailed sparse graphs.","PeriodicalId":299118,"journal":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126093525","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}
引用次数: 2
Robust Gaussian JSCC Under the Near-Infinity Bandwidth Regime with Side Information at the Receiver 近无穷带宽下具有侧信息的鲁棒高斯JSCC
2021 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2021-07-12 DOI: 10.1109/ISIT45174.2021.9517856
M. Baniasadi, E. Tuncel
{"title":"Robust Gaussian JSCC Under the Near-Infinity Bandwidth Regime with Side Information at the Receiver","authors":"M. Baniasadi, E. Tuncel","doi":"10.1109/ISIT45174.2021.9517856","DOIUrl":"https://doi.org/10.1109/ISIT45174.2021.9517856","url":null,"abstract":"In this paper, minimum energy required to achieve a distortion-noise profile is studied for robust transmission of Gaussian sources over Gaussian channels when there is side information about the source at the receiver. The distortion-noise profile is a function indicating the maximum allowed distortion value for each channel noise level and side information quality, where neither are known at the transmitter. It is shown here that uncoded transmission is optimal for (inversely) linear profiles. Turning then to staircase profiles, a proposed coding scheme is studied to obtain an upper bound to the minimum energy needed. Conversely, a general family of lower bounds is derived for the minimum required energy and compared against the upper bound.","PeriodicalId":299118,"journal":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115578366","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}
引用次数: 3
Interactive Inference under Information Constraints 信息约束下的交互推理
2021 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2021-07-12 DOI: 10.1109/ISIT45174.2021.9518069
Jayadev Acharya, C. Canonne, Yuhan Liu, Ziteng Sun, Himanshu Tyagi
{"title":"Interactive Inference under Information Constraints","authors":"Jayadev Acharya, C. Canonne, Yuhan Liu, Ziteng Sun, Himanshu Tyagi","doi":"10.1109/ISIT45174.2021.9518069","DOIUrl":"https://doi.org/10.1109/ISIT45174.2021.9518069","url":null,"abstract":"We consider the problem of distributed estimation and testing of discrete distributions under local information constraints that include communication and privacy as special cases. Our main result is a unified method that establishes tight bounds for interactive protocols under both the constraints and both the problems. Our main technical contribution is an average information bound which connects learning and testing and handles correlations due to interactivity. While we establish that for learning and testing under both the constraints above, interactivity does not help, we also illustrate a natural family of “leaky query” local constraints under which interactive protocols strictly outperform the noninteractive ones for identity testing.","PeriodicalId":299118,"journal":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116419018","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}
引用次数: 1
On the Optimal Transmission Rate for Symmetric Index Coding Problems 对称索引编码问题的最优传输速率
2021 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2021-07-12 DOI: 10.1109/ISIT45174.2021.9517865
Kota Srinivas Reddy, Nujoom Sageer Karat, N. Karamchandani
{"title":"On the Optimal Transmission Rate for Symmetric Index Coding Problems","authors":"Kota Srinivas Reddy, Nujoom Sageer Karat, N. Karamchandani","doi":"10.1109/ISIT45174.2021.9517865","DOIUrl":"https://doi.org/10.1109/ISIT45174.2021.9517865","url":null,"abstract":"An Index Coding Problem (ICP) has a central server that possesses files and is connected to multiple users through a shared link. Each user demands a subset of files and possesses another subset of files as side-information. The files which are neither demanded nor possessed as side-information by a user are called its interference files. In a symmetric ICP, the relative positions of side-information and interference files are the same for all the users. In this paper, a general representation for symmetric ICPs is proposed, and using this representation, we give bounds on the optimal transmission rate for a general symmetric ICP. We identify two broad categories of symmetric ICPs: Neighboring Interference ICP (NI-ICP) and Neighboring Side-information ICP (NS-ICP). For a particular class of NI-ICP, we find the optimal transmission rate, and for another class, an order-optimal transmission rate is derived. An upper bound on the optimal transmission rate is established for NS-ICP. Furthermore, for a particular class of NS-ICP, a lower bound for the optimal transmission rate is also derived.","PeriodicalId":299118,"journal":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129709785","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}
引用次数: 1
Repairing Reed–Solomon Codes Evaluated on Subspaces 子空间上求值的Reed-Solomon码的修复
2021 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2021-07-12 DOI: 10.1109/ISIT45174.2021.9517961
Amit Berman, S. Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo
{"title":"Repairing Reed–Solomon Codes Evaluated on Subspaces","authors":"Amit Berman, S. Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo","doi":"10.1109/ISIT45174.2021.9517961","DOIUrl":"https://doi.org/10.1109/ISIT45174.2021.9517961","url":null,"abstract":"We consider the repair problem for Reed-Solomon (RS) codes, evaluated on an <tex>$mathbb{F}_{q}$</tex>-linear subspace <tex>$U subseteq mathbb{F}_{q^{m}}$</tex> of dimension <tex>$d$</tex>, where <tex>$q$</tex> is a prime power, <tex>$m$</tex> is a positive integer, and <tex>$mathbb{F}_{q}$</tex> is the Galois field of size <tex>$q$</tex>. For <tex>$q > 2$</tex>, we show the existence of a linear repair scheme for the RS code of length <tex>$n=q^{d}$</tex> and codimension <tex>$q^{s}, s < d$</tex>, evaluated on <tex>$U$</tex>, in which each of the <tex>$n-1$</tex> surviving nodes transmits only <tex>$r$</tex> symbols of <tex>$mathbb{F}_{q}$</tex>, provided that <tex>$msgeq d(m-r)$</tex>. For the case <tex>$q=2$</tex>, we prove a similar result, with some restrictions on the evaluation linear subspace <tex>$U$</tex>. Our proof is based on a probabilistic argument, however the result is not merely an existence result; the success probability is fairly large (at least 1/3) and there is a simple criterion for checking the validity of the randomly chosen linear repair scheme.","PeriodicalId":299118,"journal":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128697137","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}
引用次数: 2
Semantic Private Information Retrieval From MDS-Coded Databases 从mds编码数据库中检索语义私有信息
2021 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2021-07-12 DOI: 10.1109/ISIT45174.2021.9517765
Sajani Vithana, Karim A. Banawan, S. Ulukus
{"title":"Semantic Private Information Retrieval From MDS-Coded Databases","authors":"Sajani Vithana, Karim A. Banawan, S. Ulukus","doi":"10.1109/ISIT45174.2021.9517765","DOIUrl":"https://doi.org/10.1109/ISIT45174.2021.9517765","url":null,"abstract":"We investigate the problem of semantic private information retrieval (PIR) from coded databases, where a user requires to download a message out of $M$ independent messages, without revealing its identity to the databases. These messages are coded using an (N, K) MDS code and stored in $N$ non-colluding databases. The $M$ messages are allowed to have different semantics, e.g., different sizes and different probabilities of retrieval. We characterize the exact capacity of semantic PIR with coded databases, and provide an achievable scheme with non-uniform subpacketization. We show that the retrieval rate of semantic PIR with coded databases outperforms that of classical PIR with coded databases when the effects of zero padding shorter messages are taken into account.","PeriodicalId":299118,"journal":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128705197","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
Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel 在几乎任何复制插入通道上基于均值的跟踪重建
2021 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2021-07-12 DOI: 10.1109/ISIT45174.2021.9518161
Mahdi Cheraghchi, Joseph Downs, João L. Ribeiro, Alexandra Veliche
{"title":"Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel","authors":"Mahdi Cheraghchi, Joseph Downs, João L. Ribeiro, Alexandra Veliche","doi":"10.1109/ISIT45174.2021.9518161","DOIUrl":"https://doi.org/10.1109/ISIT45174.2021.9518161","url":null,"abstract":"Mean-based reconstruction is a fundamental, natural approach to worst-case trace reconstruction over channels with synchronization errors. It is known that $exp(O(n^{1/3}))$ traces are necessary and sufficient for mean-based worst-case trace reconstruction over the deletion channel, and this result was also extended to certain channels combining deletions and geometric insertions of uniformly random bits. In this work, we use a simple extension of the original complex-analytic approach to show that these results are examples of a much more general phenomenon: $exp(O(n^{1/3}))$ traces suffice for mean-based worst-case trace reconstruction over any memoryless channel that maps each input bit to an arbitrarily distributed sequence of replications and insertions of random bits, provided the length of this sequence follows a sub-exponential distribution.","PeriodicalId":299118,"journal":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129152374","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}
引用次数: 6
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信