数学系Seminar第1532期 Multiple Change Point Detection for Correlated High-Dimensional Observations via the Largest Eigenvalue

创建时间:  2017/11/15  龚惠英   浏览次数:   返回

报告主题:Multiple Change Point Detection for Correlated High-Dimensional Observations via the Largest Eigenvalue
报告人: Guangming Pan  教授 (Nanyang Technological University, Singapore)
报告时间:2017年 11月15日(周三)17:00
报告地点:校本部G507
邀请人:王卿文 
主办部门:8455新葡萄场网站数学系 
报告摘要:We propose to deal with a mean vector change point detection problem from a new perspective via the largest eigenvalue when the data dimension p is comparable to the sample size n. An optimization approach is proposed to figure out both the unknown number of change points and multiple change point positions simultaneously. Moreover, an adjustment term is introduced to handle sparse signals when the change only appears in few components out of the p dimensions. The computation time is controlled at $O(n^2)$ by adopting a dynamic programming, regardless of the true number of change points $k_0$. Theoretical results are developed and various simulations are conducted to show the effectiveness of our method.

欢迎教师、学生参加 ! 

上一条:数学系Seminar第1530期 各项异性扩散问题的保正定性中心节点格式

下一条:数学系Seminar第1531期 Decoupling the coupled Navier-Stokes and Darcy equations with realistic parameters


数学系Seminar第1532期 Multiple Change Point Detection for Correlated High-Dimensional Observations via the Largest Eigenvalue

创建时间:  2017/11/15  龚惠英   浏览次数:   返回

报告主题:Multiple Change Point Detection for Correlated High-Dimensional Observations via the Largest Eigenvalue
报告人: Guangming Pan  教授 (Nanyang Technological University, Singapore)
报告时间:2017年 11月15日(周三)17:00
报告地点:校本部G507
邀请人:王卿文 
主办部门:8455新葡萄场网站数学系 
报告摘要:We propose to deal with a mean vector change point detection problem from a new perspective via the largest eigenvalue when the data dimension p is comparable to the sample size n. An optimization approach is proposed to figure out both the unknown number of change points and multiple change point positions simultaneously. Moreover, an adjustment term is introduced to handle sparse signals when the change only appears in few components out of the p dimensions. The computation time is controlled at $O(n^2)$ by adopting a dynamic programming, regardless of the true number of change points $k_0$. Theoretical results are developed and various simulations are conducted to show the effectiveness of our method.

欢迎教师、学生参加 ! 

上一条:数学系Seminar第1530期 各项异性扩散问题的保正定性中心节点格式

下一条:数学系Seminar第1531期 Decoupling the coupled Navier-Stokes and Darcy equations with realistic parameters