An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series

被引:8
|
作者
Di Gangi, Leonardo [1 ]
Lapucci, M. [1 ]
Schoen, F. [1 ]
Sortino, A. [1 ]
机构
[1] Univ Firenze, Dept Informat Engn, Via Santa Marta 3, I-50139 Florence, Italy
关键词
MINLP; Linear regression; Subset selection; Autoregressive time-series; AKAIKES INFORMATION CRITERION; ALGORITHM; ORDER; SHRINKAGE;
D O I
10.1007/s10589-019-00134-5
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we consider two relevant optimization problems: the problem of selecting the best sparse linear regression model and the problem of optimally identifying the parameters of auto-regressive models based on time series data. Usually these problems, which although different are indeed related, are solved through a sequence of separate steps, alternating between choosing a subset of features and then finding a best fit regression. In this paper we propose to model both problems as mixed integer non linear optimization ones and propose numerical procedures based on state of the art optimization tools in order to solve both of them. The proposed approach has the advantage of considering both model selection as well as parameter estimation as a single optimization problem. Numerical experiments performed on widely available datasets as well as on synthetic ones confirm the high quality of our approach, both in terms of the quality of the resulting models and in terms of CPU time.
引用
收藏
页码:919 / 948
页数:30
相关论文
共 50 条