报告题目：Belief Propagation and Chinese Postman Problems

报告摘要： Belief Propagation (BP), a distributed, message-passing algorithm in machine Learning, has been widely used in different disciplines including information theory, artificial intelligence, statistics and combinatorial optimization problems in graphical models such as Bayesian networks and Markov random fields. Despite BP has a great success in many application fields and many progress about BP has been made, the rigorous analysis about the correctness and convergence of BP are known in only a few cases for arbitrary graph. With the goal of identifying the broadest class of optimization problems solvable using the simple BP algorithm directly, we will investigate the correctness and convergence of BP for determining the optimal solutions of the Chinese Postman problems in both undirected and directed graphs.

报告人：张晓岩，南京师范大学，教授，博导。2006年获得南开大学应用数学博士学位、2014年获得荷兰Twente大学理论计算机科学博士学位，现为南京师范大学数学科学学院及数学研究所教授，博士生导师，南京师范大学“百名青年领军人才”, “青蓝工程”优秀中青年学术带头人，江苏省六大人才高峰高层次人才，江苏省运筹学监事会监事，德国波恩大学离散数学中心及英国伦敦大学皇家洛伦威学院访问教授，主要从事图上离散优化及理论计算机科学的研究工作，近年来在图与超图的划分问题、图上细胞自动机问题、路覆盖、有向哈米尔顿圈及相关有向图算法、芯片设计和网络设计等问题取得了一系列理论及应用成果，并在国际著名SCI学术期刊《SIAM J. COMPUTING》、《SIAM J. SCIENTIFIC COMPUTING》、《SIAM J. DISCRETE MATH》、《J. GTAPH THEORY》、《THEO COMPUT SCI》等发表或已接收发表四十余篇，出版英文专著一部。

报告时间：2017年12月16日(周六)  9:30-10:30
报告地点: 长清湖校区F区(综合实验楼) 532
欢迎各位老师和同学参加！