讲座人：王学钦 教授，中国科学技术大学管理学院

讲座题目：A Polynomial Algorithm for Best Subset Selection Problem

讲座时间：2021/03/24 10:00-12:00

讲座简介：

Best subset selection aims to find a small subset of predictors that lead to the most desirable and pre-defined prediction accuracy in a linear regression model. It is not only the most fundamental problem in regression analysis, but also has far reaching applications in every facet of research including computer science and medicine. We introduce a polynomial algorithm which under mild conditions, solves the problem. This algorithm exploits the idea of sequencing and splicing to reach the stable solution in finite steps when the sparsity level of the model is fixed but unknown. We define a novel information criterion that the algorithm uses to select the true sparsity level with a high probability. We show when the algorithm produces a stable optimal solution that is the oracle estimator of the true parameters with probability one. We also demonstrate the power of the algorithm in several numerical studies.

讲座人简介：

王学钦教授现任中国科学技术大学管理学院教授、博士生导师。2003年毕业于纽约州立大学宾汉姆顿分校。现担任教育部高等学校统计学类专业教学指导委员会委员、统计学国际期刊《JASA》等的Associate Editor、高等教育出版社《Lecture Notes: Data Science, Statistics and Probability》系列丛书的副主编。

姜丹丹 邀请您参加腾讯会议

会议主题：姜丹丹预定的会议

会议时间：2021/03/24-2021/06/30 10:00-12:00(GMT+08:00) 中国标准时间 - 北京, 每周 (周三)

点击链接入会，或添加至会议列表：

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

会议 ID：766 6038 9461

会议密码：214257 

手机一键拨号入会

+8675536550000,,76660389461# (中国大陆)

+85230018898,,,2,76660389461# (中国香港)

根据您的位置拨号

+8675536550000 (中国大陆)

+85230018898 (中国香港)