IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v54y2022i7p699-712.html
   My bibliography  Save this article

Variable selection for Gaussian process regression through a sparse projection

Author

Listed:
  • Chiwoo Park
  • David J. Borth
  • Nicholas S. Wilson
  • Chad N. Hunter

Abstract

This article presents a new variable selection approach integrated with Gaussian process regression. We consider a sparse projection of input variables and a general stationary covariance model that depends on the Euclidean distance between the projected features. The sparse projection matrix is considered as an unknown parameter. We propose a forward stagewise approach with embedded gradient descent steps to co-optimize the parameter with other covariance parameters based on the maximization of a non-convex marginal likelihood function with a concave sparsity penalty, and some convergence properties of the algorithm are provided. The proposed model covers a broader class of stationary covariance functions than the existing automatic relevance determination approaches, and the solution approach is more computationally feasible than the existing Markov chain Monte Carlo sampling procedures for the automatic relevance parameter estimation with a sparsity prior. The approach is evaluated for a large number of simulated scenarios. The choice of tuning parameters and the accuracy of the parameter estimation are evaluated with the simulation study. In comparison to some chosen benchmark approaches, the proposed approach has demonstrated improved accuracy in the variable selection. It is applied to an important problem of identifying environmental factors that affect atmospheric corrosion of metal alloys.

Suggested Citation

  • Chiwoo Park & David J. Borth & Nicholas S. Wilson & Chad N. Hunter, 2022. "Variable selection for Gaussian process regression through a sparse projection," IISE Transactions, Taylor & Francis Journals, vol. 54(7), pages 699-712, July.
  • Handle: RePEc:taf:uiiexx:v:54:y:2022:i:7:p:699-712
    DOI: 10.1080/24725854.2021.1959965
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/24725854.2021.1959965?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:uiiexx:v:54:y:2022:i:7:p:699-712. 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/uiie .

    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.