AF:Chaining methods and their applications to computer science

该奖项将支持学生和博士后出席链接方法及其在计算机科学中的应用（CMACS）会议，该会议将于2016年6月22日至23日在剑桥，马萨诸塞州举行。 会议的技术内容和专业网络机会对学生和博士后特别有价值。 该奖项将为大约16名与会者提供部分支持，以支付注册费、共用酒店房间和旅行费用。链接是一种限制依赖随机变量集合最大值的方法，比执行简单的联合界限要有效得多。 在计算机科学中，它有各种各样的应用程序与编码理论，图上的随机游走，降维，压缩感知，流形学习，字典学习，流算法等相关的问题。 本次会议旨在通过邀请来自纯概率社区和TCS的演讲者，在理论计算机科学（TCS）社区推广链接。

This award will support student and postdoc attendance at the Conference on Chaining Methods and their Applications to Computer Science (CMACS), which will take place June 22 - 23, 2016, in Cambridge, Massachusetts. The conference's technical content and professional networking opportunities are particularly valuable to students and postdocs. This award will provide partial support to approximately 16 attendees to defray costs of registration fees, shared hotel rooms, and travel.Chaining is a method for bounding the maximum of a collection of dependent random variables that can be much more efficient than performing a simple union bound. Within computer science it has a diverse array of applications to problems related to coding theory, random walks on graphs, dimensionality reduction, compressed sensing, manifold learning, dictionary learning, streaming algorithms, and more. This conference aims to popularize chaining in the theoretical computer science (TCS) community by having invited speakers both from the pure probability community and from TCS.