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

Approximate Message Passing for Multi-Layer Estimation in Rotationally Invariant Models 旋转不变模型中多层估计的近似消息传递

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2022-12-03 DOI: 10.1109/ITW55543.2023.10160238

Yi-fei Xu, Tianqi Hou, Shansuo Liang, Marco Mondelli

{"title":"Approximate Message Passing for Multi-Layer Estimation in Rotationally Invariant Models","authors":"Yi-fei Xu, Tianqi Hou, Shansuo Liang, Marco Mondelli","doi":"10.1109/ITW55543.2023.10160238","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10160238","url":null,"abstract":"We consider the problem of reconstructing the signal and the hidden variables from observations coming from a multi-layer network with rotationally invariant weight matrices. The multi-layer structure models inference from deep generative priors, and the rotational invariance imposed on the weights generalizes the i.i.d. Gaussian assumption by allowing for a complex correlation structure, which is typical in applications. In this work, we present a new class of approximate message passing (AMP) algorithms and give a state evolution recursion which precisely characterizes their performance in the large system limit. In contrast with the existing multi-layer VAMP (ML-VAMP) approach, our proposed AMP – dubbed multilayer rotationally invariant generalized AMP (ML-RI-GAMP) – provides a natural generalization beyond Gaussian designs, in the sense that it recovers the existing Gaussian AMP as a special case. Furthermore, ML-RI-GAMP exhibits a significantly lower complexity than ML-VAMP, as the computationally intensive singular value decomposition is replaced by an estimation of the moments of the design matrices. Finally, our numerical results show that this complexity gain comes at little to no cost in the performance of the algorithm.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121665964","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

Multi-User Privacy Mechanism Design with Non-zero Leakage 非零泄漏的多用户隐私机制设计

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2022-11-28 DOI: 10.1109/ITW55543.2023.10161670

A. Zamani, T. Oechtering, M. Skoglund

{"title":"Multi-User Privacy Mechanism Design with Non-zero Leakage","authors":"A. Zamani, T. Oechtering, M. Skoglund","doi":"10.1109/ITW55543.2023.10161670","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161670","url":null,"abstract":"A privacy mechanism design problem is studied through the lens of information theory. In this work, an agent observes useful data Y = (Y1,…,YN) that is correlated with private data X = (X1,…,XN) which is assumed to be also accessible by the agent. Here, we consider K users where user i demands a sub-vector of Y, denoted by Ci. The agent wishes to disclose Ci to user i. A privacy mechanism is designed to generate disclosed data U which maximizes a linear combinations of the users utilities while satisfying a bounded privacy constraint in terms of mutual information. In a similar work it has been assumed that Xi is a deterministic function of Yi, however in this work we let Xi and Yi be arbitrarily correlated.First, an upper bound on the privacy-utility trade-off is obtained by using a specific transformation, Functional Representation Lemma and Strong Functional Representation Lemma, then we show that the upper bound can be decomposed into N parallel problems. Next, lower bounds on privacy-utility tradeoff are derived using Functional Representation Lemma and Strong Functional Representation Lemma. The upper bound is tight within a constant and the lower bounds assert that the disclosed data is independent of all $left{ {{X_j}} right}_{i = 1}^N$ except one which we allocate the maximum allowed leakage to it. Finally, the obtained bounds are studied in special cases.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127415614","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

Secure Distributed Gram Matrix Multiplication 安全分布式克矩阵乘法

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2022-11-25 DOI: 10.1109/ITW55543.2023.10161614

Okko Makkonen, C. Hollanti

引用次数: 2

Galois Hull Dimensions of Gabidulin Codes 加比都林码的伽罗瓦壳体尺寸

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

H. Islam, Anna-Lena Horlemann

引用次数: 0

Testing Against Independence with an Eavesdropper 使用窃听器进行独立性测试

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2022-11-07 DOI: 10.1109/ITW55543.2023.10161630

Sara Faour, Mustapha Hamad, M. Sarkiss, M. Wigger

引用次数: 2

Optimal Zero-Error Coding for Computing under Pairwise Shared Side Information 成对共享侧信息下计算的最优零错误编码

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2022-11-07 DOI: 10.1109/ITW55543.2023.10161637

Nicolas Charpenay, M. L. Treust, A. Roumy

{"title":"Optimal Zero-Error Coding for Computing under Pairwise Shared Side Information","authors":"Nicolas Charpenay, M. L. Treust, A. Roumy","doi":"10.1109/ITW55543.2023.10161637","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161637","url":null,"abstract":"We study the zero-error source coding problem in which an encoder with Side Information (SI) g(Y) transmits source symbols X to a decoder. The decoder has SI Y and wants to recover f(X,Y) where f,g are deterministic. We exhibit a condition on the source distribution and g that we call \"pairwise shared side information\", such that the optimal rate has a single-letter expression. This condition is satisfied if every pair of source symbols \"share\" at least one SI symbol for all output of g; in the case f(X,Y) = X, the PX,Y and g that satisfy it, induce the worst optimal rate. More generally for all f, it has a practical interpretation, as Y models a request made by the encoder on an image X, and g(Y) corresponds to the type of request. It also has a graph-theoretical interpretation: under \"pairwise shared side information\" the characteristic graph can be written as a disjoint union of OR products. In the case where the source distribution is full-support, we provide an analytic expression for the optimal rate. We develop an example under \"pairwise shared side information\", and we show that the optimal coding scheme outperforms several strategies from the literature.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124823804","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

Optimal Fault-Tolerant Data Fusion in Sensor Networks: Fundamental Limits and Efficient Algorithms 传感器网络中最优容错数据融合:基本限制和有效算法

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

Marian Temprana Alonso, Farhad Shirani, S. Iyengar

引用次数: 0

An Upper Bound on the Reliability Function of the DMC with or without Mismatch 有或无失配的DMC可靠性函数的上界

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

A. Somekh-Baruch

{"title":"An Upper Bound on the Reliability Function of the DMC with or without Mismatch","authors":"A. Somekh-Baruch","doi":"10.1109/ITW55543.2023.10161625","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161625","url":null,"abstract":"We derive a new upper bound on the reliability function for channel coding over discrete memoryless channels. Our bounding technique relies on two main elements: (i) adding an auxiliary genie-receiver that reveals to the original receiver a list of codewords including the transmitted one, which satisfy a certain type property, and (ii) partitioning (most of) the list into subsets of codewords that satisfy a certain pairwise-symmetry property, which facilitates lower bounding of the average error probability by the pairwise error probability within a subset. We compare the obtained bound to the Shannon-Gallager-Berlekamp straight-line bound, the sphere-packing bound, and an amended version of Blahut’s bound. Our bound is shown to be at least as tight for all rates, with cases of stricter tightness in a certain range of low rates, compared to all three aforementioned bounds. Our derivation is performed in a unified manner which is valid for any rate, as well as for a wide class of additive decoding metrics, whenever the corresponding zero-error capacity is zero. We also present a dual form of the bound, and discuss a looser bound of a simpler form, which is analyzed for the case of the binary symmetric channel with maximum likelihood decoding.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126331790","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

Coded Caching with Shared Caches and Private Caches 编码缓存与共享缓存和私有缓存

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

Elizabath Peter, K. K. K. Namboodiri, B. Rajan

引用次数: 1

Achievable error exponents of data compression with quantum side information and communication over symmetric classical-quantum channels 基于量子侧信息的数据压缩和对称经典量子信道通信的可实现误差指数

2023 IEEE Information Theory Workshop (ITW) Pub Date : 2022-07-18 DOI: 10.1109/ITW55543.2023.10161621

J. Renes

{"title":"Achievable error exponents of data compression with quantum side information and communication over symmetric classical-quantum channels","authors":"J. Renes","doi":"10.1109/ITW55543.2023.10161621","DOIUrl":"https://doi.org/10.1109/ITW55543.2023.10161621","url":null,"abstract":"A fundamental quantity of interest in Shannon theory, classical or quantum, is the optimal error exponent of a given channel W and rate R: the constant E(W,R) which governs the exponential decay of decoding error when using ever larger codes of fixed rate R to communicate over ever more (memoryless) instances of a given channel W. Here I show that a bound by Hayashi [CMP 333, 335 (2015)] for an analogous quantity in privacy amplification implies a lower bound on the error exponent of communication over symmetric classical-quantum channels. The resulting bound matches Dalai’s [IEEE TIT 59, 8027 (2013)] sphere-packing upper bound for rates above a critical value, and reproduces the well-known classical result for symmetric channels. The argument proceeds by first relating the error exponent of privacy amplification to that of compression of classical information with quantum side information, which gives a lower bound that matches the sphere-packing upper bound of Cheng et al. [IEEE TIT 67, 902 (2021)]. In turn, the polynomial prefactors to the sphere-packing bound found by Cheng et al. may be translated to the privacy amplification problem, sharpening a recent result by Li, Yao, and Hayashi [arXiv:2111.01075 [quant-ph]], at least for linear randomness extractors.","PeriodicalId":439800,"journal":{"name":"2023 IEEE Information Theory Workshop (ITW)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124538363","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