当前位置: 首页 / English / Academics / 正文

Belief Propagation for Directed Chinese Postman Problems

作者:   时间:2022-05-05   点击数:

Lecturer:Zhang Xiaoyan

Abstract:

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 directed graphs.

Introduction to the Lecturer:

Zhang Xiaoyan is the Professor and Doctoral Supervisor from School of Mathematical Sciences and Institute of Mathematics, Nanjing Normal University; visiting research fellow from Center for High Performance Computing, Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences; an excellent young and middle-aged academic leader of "100 Young Leading Talents" Project and "Qinglan Project" of Nanjing Normal University; a high-level talent of Jiangsu Provincial Six-Category High-level Talents Project; Supervisor of Board of Supervisors of Jiangsu Operations Research Society; a member of Youth Commission of Jiangsu Association for Western Returned Scholars; Director of Mathematical Programming Branch, Operations Research Society of China; Director of Graphing & Grouping Branch, Operations Research Society of China; a member of CCF Theoretical Computer Science; Visiting Professor from Institute of Discrete Mathematics, University Bonn, Royal Holloway College, University of London, and Business School, University of New Brunswick. He is mainly engaged in researches on graph optimization and partitioning, chip layout algorithm and theoretical computer science, with his research results published on internationally known academic journals, including SIAM J. COMPUTING, SIAM J. SCIENTIFIC COMPUTING, SIAM J. DISCRETE MATH, J.GRAPH THEORY and IEEE TRANSACTIONS ON INFORMATION THEORY. He has presided over several projects supported by NSFC and research subjects at ministerial and provincial level, and published two English academic monographs and one translation.

Invited by:

Yan Jin, Professor from School of Mathematics

Time:

16:00-17:00, May 10 (Tuesday)

Venue:

Tencent Meeting

Contact person: Yan Jin Contact information: 139 6405 5656

Sponsored by: School of Mathematics, Shandong University

地址:中国山东省济南市山大南路27号   邮编:250100  

电话:0531-88364652  院长信箱:sxyuanzhang@sdu.edu.cn

Copyright@山东大学数学学院

微信公众号