CIF: Small: Poisson matching: A new tool for information theory

CIF：小：泊松匹配：信息论的新工具

基本信息

批准号：
2007965
负责人：
Venkatachalam Anantharam
金额：
$ 50万
依托单位：
University of California-Berkeley
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2020
资助国家：
美国
起止时间：
2020-10-01 至 2024-09-30
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=2007965&HistoricalAwards=false
关键词：
CIF Small Poisson matching new

项目摘要

The existence of good designs for communication problems is often demonstrated by studying probability distributions over communication schemes and showing that good ones exist with positive probability. This is called a random coding methodology. The Poisson matching technique to be developed in this project is a novel method of this kind, which has the advantage of working for communication problems with more stringent delay constraints than was previously possible. This is important for emerging modern applications such as the Internet of Things and in scenarios involving control over communication channels, including remote surgery and unmanned vehicles. Because of its ability to work when there are delay constraints, the Poisson matching approach seems particularly promising for discovering better schemes in problems involving multiple agents interacting with each other. Such problems are ubiquitous in networks and have previously resisted attempts to use the earlier available random coding approaches. The goal of this project is to develop the use of the Poisson matching technique in developing good designs for problems of communication, estimation and control involving multiple agents.The Poisson matching lemma can be thought of as a way in which a receiver, having access to a noisy version of a random variable that the sender has access to, can nevertheless coordinate with the sender to pick out the same point from a Poisson process with a probability of error that diminishes as the mutual information increases between the sender and the receiver. This lemma can be used to give very sharp bounds on error probabilities in many of the core one-shot information theory problems - these bounds are usually as good as or better than the previously best known such bounds. At its heart, the Poisson matching lemma is a methodology allowing multiple agents, having related views of some underlying random variable, to coordinate their actions. The project aims to develop the power of the Poisson matching lemma from this more broad perspective, by studying its use in problems of communication, estimation and control involving multiple agents.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

通常通过研究沟通方案的概率分布并表明良好的概率以积极的概率存在，这通常是通过研究概率分布来证明的。这称为随机编码方法。该项目中要开发的泊松匹配技术是一种新颖的方法，它具有与以前更严格的延迟约束有关的交流问题的优势。这对于新兴的现代应用程序（例如物联网）以及涉及控制沟通渠道（包括远程手术和无人车辆）的情况很重要。由于它在存在延迟限制时能够工作的能力，因此，泊松匹配方法似乎特别有希望地发现涉及多个代理相互作用的问题中的更好的方案。此类问题在网络中无处不在，并且以前曾抵制使用早期可用的随机编码方法的尝试。该项目的目标是开发使用Poisson匹配技术在为涉及多个代理的沟通，估计和控制问题开发良好的设计中。可以将泊松匹配的引理视为接收器的一种方式，可以访问随机变量的嘈杂版本，以至于发件人可以访问poiss osers ofers of soild oss poiss of shore poiss of sodise copers of shord oser的探险。发送者和接收器之间的共同信息增加。这种引理可用于在许多核心的一声信息理论问题中对错误概率的极端界限 - 这些界限通常比以前最著名的此类界限一样好或更好。从本质上讲，泊松匹配的引理是一种方法，允许多种代理，具有某些基本随机变量的相关视图来协调其作用。该项目旨在通过研究其在涉及多个代理的沟通，估算和控制问题中的用途来从更广泛的角度来发展泊松匹配的引理的力量。该奖项反映了NSF的法定任务，并被认为是值得通过基金会的知识分子优点和更广泛影响的审查标准来通过评估来支持的。