Structural theorems in communication complexity

通信复杂性的结构定理

• 批准号: RGPIN-2022-03745
• 负责人: Hatami, Hamed
• 金额: $ 3.5万
• 依托单位: McGill University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2022
• 资助国家: 加拿大
• 起止时间: 2022-01-01 至 2023-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=750357
• 关键词: Structural; theorems; communication; complexity

Communication occurs in several forms across the domains of science and technology.  For example, it occurs as interactions between different parts of the human brain, as the transmission of data through the internet, as the exchange of signals between different parts of a microchip, as the exchange of information among a handful of supercomputers. The field of communication complexity provides a rigorous framework for measuring, studying, and understanding communication. It is supported by a rich and deep mathematical theory that employs a surprisingly diverse collection of techniques and tools from other areas of mathematics. This proposal aims to investigate a class of mathematical problems in communication complexity that appear across different fields of computer science and pure mathematics in various disguises. Several seemingly different problems in the fields of communication complexity and machine learning on the one hand, and the purely mathematical fields of abstract harmonic analysis and operator theory, on the other hand, are essentially equivalent. This proposal aims to understand these connections better and devise potential approaches to resolve the fundamental underlying mathematical problems. The problems mentioned above arise from the study of very efficient algorithms in communication complexity. As large data sets become more common in science and technology, it has become increasingly important to understand which problems can be solved super-efficiently. The primary objectives of this proposal arise from the study of this problem in the context of communication complexity: Which communication problems are solvable by protocols that exchange only a few bits of communication? It turns out that the above problem has deep connections to problems in complexity theory, machine learning, harmonic analysis, and operator theory. Communication problems, in the most commonly studied framework, are represented by Boolean matrices. Such matrices also represent binary data. For example, the entries of such a matrix could take true or false values depending on which people show which medical symptoms. Machine learning classification algorithms, which predict the label of a new data point based on a known set of correctly labeled points, often rely on the assumption that it is possible to model the data points and their labels geometrically. The performance and accuracy of many of these algorithms rely on the existence of low-dimensional large-margin representations. The mathematical problems considered in this proposal will help us understand which data sets have such desirable geometric representations.

在科学和技术领域，交流有多种形式，例如，人脑不同部分之间的相互作用，通过互联网传输数据，微芯片不同部分之间的信号交换，以及少数超级计算机之间的信息交换。通信复杂性领域为测量、研究和理解通信提供了一个严格的框架。它由丰富而深刻的数学理论支持，该理论采用了来自其他数学领域的各种技术和工具。 该提案旨在研究一类以各种伪装出现在计算机科学和纯数学不同领域的通信复杂性数学问题。一方面，通信复杂性和机器学习领域中的几个看似不同的问题，另一方面，抽象调和分析和算子理论的纯数学领域，本质上是等价的。该建议旨在更好地理解这些联系，并设计潜在的方法来解决基本的数学问题。上面提到的问题产生于对通信复杂性中非常有效的算法的研究。随着大型数据集在科学和技术中变得越来越普遍，了解哪些问题可以超高效地解决变得越来越重要。这个建议的主要目标产生于研究这个问题的背景下，通信的复杂性：哪些通信问题是可解决的协议，交换只有几个比特的通信？ 事实证明，上述问题与复杂性理论、机器学习、调和分析和算子理论中的问题有着深刻的联系。 在最常研究的框架中，通信问题由布尔矩阵表示。这样的矩阵也表示二进制数据。例如，这种矩阵的条目可以根据哪些人显示哪些医学症状而取真值或假值。机器学习分类算法基于一组已知的正确标记的点来预测新数据点的标签，通常依赖于这样的假设，即可以对数据点及其标签进行几何建模。许多这些算法的性能和准确性依赖于低维大边距表示的存在。这个建议中考虑的数学问题将帮助我们理解哪些数据集具有这样理想的几何表示。