AF: Medium: Collaborative Research: Information Compression in Algorithm Design and Statistical Physics

AF：媒介：协作研究：算法设计和统计物理中的信息压缩

• 批准号: 1514164
• 负责人: Eric Allender
• 金额: $ 46.13万
• 依托单位: Rutgers University New Brunswick
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2015
• 资助国家: 美国
• 起止时间: 2015-06-15 至 2020-05-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1514164&HistoricalAwards=false
• 关键词: AF; Medium; Collaborative; Research; Information

The existence of connections between probabilistic algorithms, statistical physics and information theory has been known for decades and has yielded a number of unexpected breakthroughs. Recent discoveries of the PIs and other researchers give clear indications that these connections go much deeper than previously thought. A key new idea is the realization that stochastic local search algorithms can be judged by their capacity to compress the randomness they consume, with convergence following as a consequence of compressibility. Further exploration of this idea is expected to have significant impact, both conceptual and technical, in multiple scientific fields. This includes algorithm design by information theoretic methods, the study of phase transitions in statistical mechanical systems based on information bottleneck arguments, and non-constructive proofs of existence of combinatorial objects. The project will offer a wide range of research opportunities at various levels of sophistication for graduate and undergraduate students in three state universities.Information compression arguments have recently found striking applications in computer science and combinatorics. A glowing example is Moser's proof of the algorithmic Lovasz Local Lemma, which suggested an entirely new way of reasoning about randomized algorithms. Inspired by the work of Moser, one of the PIs with a collaborator has very recently created a general framework for analyzing stochastic local search algorithms using information compression. The framework is purely algorithmic, completely bypassing the Probabilistic Method. Besides helping to analyze the running times of existing algorithms it can also be used as a powerful new tool for designing novel, non-obvious randomized algorithms. The proposed research further develops this framework with the aim of unearthing completely new applications in computer science and combinatorics, while establishing mathematically rigorous connections to statistical physics. Concrete examples of such applications to be investigated include new tools for bounding the mixing time of Markov chains and algebraic connections between randomized algorithms and the classical theory of phase transitions in statistical physics.

概率算法、统计物理和信息论之间的联系已经存在了几十年，并产生了一些意想不到的突破。PI和其他研究人员的最新发现清楚地表明，这些联系比之前想象的要深入得多。一个关键的新想法是认识到，随机局部搜索算法可以通过它们压缩其消耗的随机性的能力来判断，而收敛是可压缩性的结果。对这一想法的进一步探索预计将在多个科学领域产生重大的概念和技术影响。这包括用信息论方法进行算法设计，基于信息瓶颈论证的统计力学系统相变的研究，以及组合对象存在的非构造性证明。该项目将为三所州立大学的研究生和本科生提供不同程度的复杂程度的广泛研究机会。信息压缩论点最近在计算机科学和组合学中得到了引人注目的应用。一个热闹的例子是莫泽对算法Lovasz局部引理的证明，它提出了一种关于随机算法的全新推理方式。受Moser工作的启发，其中一个与合作者合作的PI最近创建了一个通用框架，用于使用信息压缩来分析随机本地搜索算法。该框架纯粹是算法，完全绕过了概率方法。除了帮助分析现有算法的运行时间外，它还可以作为一个强大的新工具来设计新的、不明显的随机算法。这项拟议的研究进一步发展了这一框架，目的是挖掘计算机科学和组合学中的全新应用，同时建立与统计物理的严格数学联系。有待研究的这类应用的具体例子包括限制马尔可夫链混合时间的新工具，以及随机算法与统计物理中的经典相变理论之间的代数联系。

项目成果

The Non-Hardness of Approximating Circuit Size

近似电路尺寸的非困难性

• DOI: 10.1007/978-3-030-19955-5_2
• 发表时间: 2021
• 期刊: Theory of computing systems
• 影响因子: 0.5
• 作者: Allender, Eric;Ilango, Rahul;Vafa, Neekon
• 通讯作者: Vafa, Neekon

Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity

Ker-I Ko 与资源有限 Kolmogorov 复杂性研究

• DOI: 10.1007/978-3-030-41672-0_2
• 发表时间: 2020
• 期刊: Lecture notes in computer science
• 作者: Allender, Eric