2023 IEEE Information Theory Workshop (ITW)最新文献_第10页

Channel Codes for Relayless Networks with General Message Access Structure 具有通用消息访问结构的中继网络信道码

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2022-06-01 DOI: 10.1109/ITW55543.2023.10161628

J. Muramatsu

引用次数: 0

Error Exponents of the Dirty-Paper and Gel’fand-Pinsker Channels 脏纸通道和凝胶通道的误差指数

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2022-05-14 DOI: 10.1109/ITW55543.2023.10161668

Ran Tamir, N. Merhav

{"title":"Error Exponents of the Dirty-Paper and Gel’fand-Pinsker Channels","authors":"Ran Tamir, N. Merhav","doi":"10.1109/ITW55543.2023.10161668","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161668","url":null,"abstract":"We derive various error exponents for communication channels with random states, which are available non-causally at the encoder only. For both the finite-alphabet Gel’fand-Pinsker channel and its Gaussian counterpart, the dirty-paper channel, we derive random coding exponents, error exponents of the typical random codes (TRCs), and error exponents of expurgated codes. For the two channel models, we analyze some sub-optimal bin-index decoders, which turn out to be asymptotically optimal, at least for the random coding error exponent. For the dirty-paper channel, we show explicitly via a numerical example, that at rates below capacity, the optimal values of the dirty-paper design parameter α in the random coding sense and in the TRC exponent sense are different from one another, and they are both different from the optimal α that is required for attaining the channel capacity. For the Gel’fand-Pinsker channel, we allow for a variable-rate random binning code construction, and prove that the previously proposed maximum penalized mutual information decoder is asymptotically optimal within a given class of decoders, at least for the random coding error exponent.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116860380","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

On the Distribution of Partially-Symmetric Codes for Automorphism Ensemble Decoding 自同构集成译码中部分对称码的分布

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2022-05-09 DOI: 10.1109/ITW55543.2023.10161664

Charles Pillet, Valerio Bioglio

引用次数: 3

Transfer Learning for Quantum Classifiers: An Information-Theoretic Generalization Analysis 量子分类器的迁移学习:一个信息论的泛化分析

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2022-01-17 DOI: 10.1109/ITW55543.2023.10160236

Sharu Theresa Jose, O. Simeone

{"title":"Transfer Learning for Quantum Classifiers: An Information-Theoretic Generalization Analysis","authors":"Sharu Theresa Jose, O. Simeone","doi":"10.1109/ITW55543.2023.10160236","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10160236","url":null,"abstract":"A key component of a quantum machine learning model operating on classical inputs is the design of an embedding circuit mapping inputs to a quantum state. This paper studies a transfer learning setting in which classical-to-quantum embedding is carried out by an arbitrary parametric quantum circuit that is pre-trained based on data from a source task. At run time, a binary quantum classifier of the embedding is optimized based on data from the target task of interest. The average excess risk, i.e., the optimality gap, of the resulting classifier depends on how (dis)similar the source and target tasks are. We introduce a new measure of (dis)similarity between the binary quantum classification tasks via the trace distances. An upper bound on the optimality gap is derived in terms of the proposed task (dis)similarity measure, two Rényi mutual information terms between classical input and quantum embedding under source and target tasks, as well as a measure of complexity of the combined space of quantum embeddings and classifiers under the source task. The theoretical results are validated on a simple binary classification example.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114421495","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