Robust subgroup identification for high-dimensional data

发布者:吴梦发布时间:2020-08-20浏览次数:680

报告人:冯兴东教授,上海财经大学

摘要:It becomes an interesting problem to identify subgroup structures in data analysis as populations are probably heterogeneous in practice. In this paper, we consider M-estimators together with both concave and pairwise fusion penalties, which can deal with high-dimensional data containing some outliers. The penalties are applied both on covariates and treatment effects, where the estimation is expected to achieve both variable selection and data clustering simultaneously.  An algorithm is proposed to process relatively large datasets based on parallel computing. We establish the convergence analysis of the proposed algorithm, the oracle property of the penalized M-estimators, and the selection consistency of the proposed criterion. Our numerical study demonstrates that the proposed method is promising to efficiently identify subgroups hidden in high-dimensional data.


报告时间:2020/8/23 14:30-16:30

 

点击链接入会,或添加至会议列表:

https://meeting.tencent.com/s/WHlMPiiNkphr

会议 ID:484 250 836