IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v50y2021i13p3198-3213.html
   My bibliography  Save this article

Blockwise AICc and its consistency properties in model selection

Author

Listed:
  • Guofeng Song
  • Lixun Zhu
  • Ai Gao
  • Lingzhu Kong

Abstract

Akaike information criterion (AIC) and corrected Akaike information criterion (AICc) are two widely used information criteria. It is well known that neither of them is consistent because there is a positive probability to select an over-specified candidate model. In this paper, with the assumption that the sample size tends to be infinite, we derive the probability of the true model’s AICc (AIC) value less than an over-specified model’s AICc (AIC) value, and we also derive the lower bound of probability of selecting the true model using AICc (AIC) when the candidate model set includes all possible candidate models. We also prove that blockwise AICc, a new information criterion, is a consistent information criterion if the number of blocks and sample size both tend to be infinite. Furthermore, compared with the other popular information criteria, simulations and real data analysis also show that bAICc performs well for moderate and large sample sizes.

Suggested Citation

  • Guofeng Song & Lixun Zhu & Ai Gao & Lingzhu Kong, 2021. "Blockwise AICc and its consistency properties in model selection," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 50(13), pages 3198-3213, July.
    • Handle: RePEc:taf:lstaxx:v:50:y:2021:i:13:p:3198-3213
    DOI: 10.1080/03610926.2019.1691734
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2019.1691734
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2019.1691734?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:50:y:2021:i:13:p:3198-3213. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.