IDEAS home Printed from https://ideas.repec.org/a/taf/tstfxx/v4y2020i2p190-201.html
   My bibliography  Save this article

A class of admissible estimators of multiple regression coefficient with an unknown variance

Author

Listed:
  • Chengyuan Song
  • Dongchu Sun

Abstract

Suppose that we observe ${\boldsymbol y} \mid {\boldsymbol \theta },\ \tau \sim N_p({\boldsymbol X}{\boldsymbol \theta },\tau ^{-1}{\boldsymbol I}_p) $y∣θ, τ∼Np(Xθ,τ−1Ip), where ${\boldsymbol \theta } $θ is an unknown vector with unknown precision τ. Estimating the regression coefficient ${\boldsymbol \theta } $θ with known τ has been well studied. However, statistical properties such as admissibility in estimating ${\boldsymbol \theta } $θ with unknown τ are not well studied. Han [(2009). Topics in shrinkage estimation and in causal inference (PhD thesis). Warton School, University of Pennsylvania] appears to be the first to consider the problem, developing sufficient conditions for the admissibility of estimating means of multivariate normal distributions with unknown variance. We generalise the sufficient conditions for admissibility and apply these results to the normal linear regression model. 2-level and 3-level hierarchical models with unknown precision τ are investigated when a standard class of hierarchical priors leads to admissible estimators of ${\boldsymbol \theta } $θ under the normalised squared error loss. One reason to consider this problem is the importance of admissibility in the hierarchical prior selection, and we expect that our study could be helpful in providing some reference for choosing hierarchical priors.

Suggested Citation

  • Chengyuan Song & Dongchu Sun, 2020. "A class of admissible estimators of multiple regression coefficient with an unknown variance," Statistical Theory and Related Fields, Taylor & Francis Journals, vol. 4(2), pages 190-201, July.
  • Handle: RePEc:taf:tstfxx:v:4:y:2020:i:2:p:190-201
    DOI: 10.1080/24754269.2019.1653160
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24754269.2019.1653160
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24754269.2019.1653160?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:tstfxx:v:4:y:2020:i:2:p:190-201. 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/tstf .

    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.