應(yīng)yl7703永利官網(wǎng)李朋副教授邀請(qǐng),北京航空航天大學(xué)數(shù)學(xué)科 學(xué)學(xué)院謝家新副研究員, 將于2022年12月8號(hào)(星期四)上午9:00-10:00在線舉辦學(xué)術(shù)報(bào)告.

報(bào)告題目：Graph Sparsification by Universal Greedy Algorithms

騰訊會(huì)議號(hào)：631-204-388

報(bào)告摘要: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.

報(bào)告人簡(jiǎn)介

謝家新, 北京航空航天大學(xué)數(shù)學(xué)科學(xué)學(xué)院副研究員, 碩士生導(dǎo)師.2012年和2017年于湖南大學(xué)數(shù)學(xué)學(xué)院分別獲得學(xué)士和博士學(xué)位,2017-2019年于中國(guó)科學(xué)院數(shù)學(xué)與系統(tǒng)科學(xué)研究院從事博士后研究, 合作導(dǎo)師許志強(qiáng)研究員. 研究興趣為數(shù)據(jù)科學(xué)中的數(shù)學(xué)問題, 特別是壓縮感知、隨機(jī)優(yōu)化算法和子集選擇等問題. 主持北航青年拔尖計(jì)劃和國(guó)家自然科學(xué)基金青年等項(xiàng)目.詳情見其主頁(yè)http://math.buaa.edu.cn/szdw/axbck/jskxx/xjx.htm

甘肅應(yīng)用數(shù)學(xué)中心

甘肅省高校應(yīng)用數(shù)學(xué)與復(fù)雜系統(tǒng)省級(jí)重點(diǎn)實(shí)驗(yàn)室

萃英學(xué)院

yl7703永利官網(wǎng)

12月5日