IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v192y2024ics0167947323002037.html
   My bibliography  Save this article

Efficient and robust optimal design for quantile regression based on linear programming

Author

Listed:
  • Peng, Cheng
  • Kouri, Drew P.
  • Uryasev, Stan

Abstract

When informing decisions with experimental data, it is often necessary to quantify the distribution tails of uncertain system responses using limited data. To maximize the information content of the data, one is naturally led to use experimental design. However, common design techniques minimize global statistics such as the average estimation or prediction variance. Novel methods for optimal experimental design that target distribution tails are developed. To achieve this, pre-asymptotic estimates of the data uncertainty are produced via an upper bound on a prescribed quantile, computed using quantile regression. Two optimal design problems are formulated: (i) Minimize the variance of the upper bound; and (ii) Minimize the Conditional Value-at-Risk of the upper bound. Additionally, each design problem is augmented with an added cardinality constraint to bound the number of experiments. These optimal design problems are reduced to continuous and mixed-integer linear programming problems. Consequently, the proposed methods are extremely efficient, even when applied to large datasets. The application of the proposed design formulation is demonstrated through a sensor placement problem in direct field acoustic testing.

Suggested Citation

  • Peng, Cheng & Kouri, Drew P. & Uryasev, Stan, 2024. "Efficient and robust optimal design for quantile regression based on linear programming," Computational Statistics & Data Analysis, Elsevier, vol. 192(C).
  • Handle: RePEc:eee:csdana:v:192:y:2024:i:c:s0167947323002037
    DOI: 10.1016/j.csda.2023.107892
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947323002037
    Download Restriction: Full text for ScienceDirect subscribers only.

    File URL: https://libkey.io/10.1016/j.csda.2023.107892?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.

    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:eee:csdana:v:192:y:2024:i:c:s0167947323002037. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.