应pc加拿大预测准确率李朋副教授邀请,北京航空航天大学数学科 学学院谢家新副研究员, 将于2022年12月8号(星期四)上午9:00-10:00在线举办学术报告.

报告题目：Graph Sparsification by Universal Greedy Algorithms

腾讯会议号：631-204-388

报告摘要:Graph sparsification is to approximate an arbitrary graph by a sparse graph and is useful in many applications, such as simplification of social networks, least squares problems, numerical solution of symmetric positive definite linear systems and etc. In this talk, inspired by the well-known sparse signal recovery algorithm called orthogonal matching pursuit (OMP), we introduce a deterministic, greedy edge selection algorithm called universal greedy approach (UGA) for graph sparsification. The convergent results as well as the computational complexity are discussed. Extensive experimental results, including applications to graph clustering and least squares regression, show the effectiveness of proposed approaches. This is a joint work with Prof. Ming-Jun Lai and Prof. Zhiqiang Xu.

报告人简介

谢家新, 北京航空航天大学数学科学学院副研究员, 硕士生导师.2012年和2017年于湖南大学数学学院分别获得学士和博士学位,2017-2019年于中国科学院数学与系统科学研究院从事博士后研究, 合作导师许志强研究员. 研究兴趣为数据科学中的数学问题, 特别是压缩感知、随机优化算法和子集选择等问题. 主持北航青年拔尖计划和国家自然科学基金青年等项目.详情见其主页http://math.buaa.edu.cn/szdw/axbck/jskxx/xjx.htm

甘肃应用数学中心

甘肃省高校应用数学与复杂系统省级重点实验室

萃英学院

pc加拿大预测准确率

12月5日