IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v25y2025i4d10.1007_s11067-025-09692-0.html
   My bibliography  Save this article

Robust Variable Selection Method with Prior Information for Spatial Quantile Autoregressive Model

Author

Listed:
  • Yunquan Song

    (China University of Petroleum, College of Science)

  • Rui Yang

    (China University of Petroleum, College of Science)

  • Dongmei He

    (China University of Petroleum, College of Science)

Abstract

In the analysis of high-dimensional spatial data, developing an effective and robust method for variable selection remains a significant challenge. This study addresses this challenge by proposing a generalized $$\ell _{1}$$ -penalized spatial quantile autoregressive model with linear constraints on the parameters. The linear constraints incorporate prior information, while the flexibility to choose different penalty functions is achieved by adjusting the weight matrix of the generalized $$\ell _{1}$$ -penalty. To resolve the endogeneity problem inherent in the model, we employ the two-stage quantile regression method. Subsequently, we derive the Karush-Kuhn-Tucker (KKT) conditions based on the optimized non-endogeneity problem and propose a solution path algorithm that depends on the KKT conditions and the tuning parameter $$\lambda$$ . To facilitate model selection, we construct three information criteria using the derived formula for the degrees of freedom, enabling the selection of the optimal tuning parameter $$\lambda$$ . Finally, we validate the effectiveness of our proposed approach through comprehensive numerical experiments and a real-world data analysis.

Suggested Citation

  • Yunquan Song & Rui Yang & Dongmei He, 2025. "Robust Variable Selection Method with Prior Information for Spatial Quantile Autoregressive Model," Networks and Spatial Economics, Springer, vol. 25(4), pages 985-1011, December.
  • Handle: RePEc:kap:netspa:v:25:y:2025:i:4:d:10.1007_s11067-025-09692-0
    DOI: 10.1007/s11067-025-09692-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-025-09692-0
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s11067-025-09692-0?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:kap:netspa:v:25:y:2025:i:4:d:10.1007_s11067-025-09692-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.