AIC for the non-concave penalized likelihood method

被引:0
|
作者
Yuta Umezu
Yusuke Shimizu
Hiroki Masuda
Yoshiyuki Ninomiya
机构
[1] Nagoya Institute of Technology,Department of Computer Science
[2] Josai University,Department of Mathematics
[3] Kyushu University,Faculty of Mathematics
[4] Kyushu University,Institute of Mathematics for Industry
关键词
Information criterion; Kullback–Leibler divergence; regularization; Statistical asymptotic theory; Tuning parameter; Variable selection;
D O I
暂无
中图分类号
学科分类号
摘要
Non-concave penalized maximum likelihood methods are widely used because they are more efficient than the Lasso. They include a tuning parameter which controls a penalty level, and several information criteria have been developed for selecting it. While these criteria assure the model selection consistency, they have a problem in that there are no appropriate rules for choosing one from the class of information criteria satisfying such a preferred asymptotic property. In this paper, we derive an information criterion based on the original definition of the AIC by considering minimization of the prediction error rather than model selection consistency. Concretely speaking, we derive a function of the score statistic that is asymptotically equivalent to the non-concave penalized maximum likelihood estimator and then provide an estimator of the Kullback–Leibler divergence between the true distribution and the estimated distribution based on the function, whose bias converges in mean to zero.
引用
收藏
页码:247 / 274
页数:27
相关论文
共 50 条
  • [41] MINIMIZATION OF CONVEX FUNCTIONALS INVOLVING NESTED MAXIMA - NON-CONCAVE DUALITY AND ALGORITHMS
    COHEN, G
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1982, 36 (03) : 335 - 365
  • [42] Non-concave fundamental diagrams and phase transitions in a stochastic traffic cellular automaton
    Maerivoet, S
    De Moor, B
    [J]. EUROPEAN PHYSICAL JOURNAL B, 2004, 42 (01): : 131 - 140
  • [43] Improved Portfolio Optimization with Non-convex and Non-concave Cost Using Genetic Algorithms
    Lu, Zhang
    Wang, Xiaoli
    [J]. PROCEEDINGS 2013 INTERNATIONAL CONFERENCE ON MECHATRONIC SCIENCES, ELECTRIC ENGINEERING AND COMPUTER (MEC), 2013, : 2567 - 2570
  • [44] Pattern Classification Using a Penalized Likelihood Method
    Al-Ani, Ahmed
    Atiya, Amir F.
    [J]. ARTIFICIAL NEURAL NETWORKS IN PATTERN RECOGNITION, PROCEEDINGS, 2010, 5998 : 1 - +
  • [45] A New Multidimensional Penalized Likelihood Regression Method
    Hassan, Mostafa A.
    Atiya, Amir F.
    El-Fouly, Raafat
    [J]. 2008 IEEE INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-8, 2008, : 933 - 938
  • [46] A PENALIZED EMPIRICAL LIKELIHOOD METHOD IN HIGH DIMENSIONS
    Lahiri, Soumendra N.
    Mukhopadhyay, Subhadeep
    [J]. ANNALS OF STATISTICS, 2012, 40 (05): : 2511 - 2540
  • [47] A Penalized Likelihood Method for Structural Equation Modeling
    Huang, Po-Hsien
    Chen, Hung
    Weng, Li-Jen
    [J]. PSYCHOMETRIKA, 2017, 82 (02) : 329 - 354
  • [48] A Penalized Likelihood Method for Structural Equation Modeling
    Po-Hsien Huang
    Hung Chen
    Li-Jen Weng
    [J]. Psychometrika, 2017, 82 : 329 - 354
  • [49] Non-concave fundamental diagrams and phase transitions in a stochastic traffic cellular automaton
    S. Maerivoet
    B. De Moor
    [J]. The European Physical Journal B - Condensed Matter and Complex Systems, 2004, 42 : 131 - 140
  • [50] Penalized maximum likelihood estimation with symmetric log-concave errors and LASSO penalty
    Park, Seo-Young
    Kim, Sunyul
    Seo, Byungtae
    [J]. COMMUNICATIONS FOR STATISTICAL APPLICATIONS AND METHODS, 2022, 29 (06) : 641 - 654