IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i2p847-877.html
   My bibliography  Save this article

Proportional Volume Sampling and Approximation Algorithms for A -Optimal Design

Author

Listed:
  • Aleksandar Nikolov

    (Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada)

  • Mohit Singh

    (H. Milton Stewart School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

  • Uthaipon (Tao) Tantipongpipat

    (H. Milton Stewart School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

Abstract

We study optimal design problems in which the goal is to choose a set of linear measurements to obtain the most accurate estimate of an unknown vector. We study the A -optimal design variant where the objective is to minimize the average variance of the error in the maximum likelihood estimate of the vector being measured. We introduce the proportional volume sampling algorithm to obtain nearly optimal bounds in the asymptotic regime when the number k of measurements made is significantly larger than the dimension d and obtain the first approximation algorithms whose approximation factor does not degrade with the number of possible measurements when k is small. The algorithm also gives approximation guarantees for other optimal design objectives such as D -optimality and the generalized ratio objective, matching or improving the previously best-known results. We further show that bounds similar to ours cannot be obtained for E -optimal design and that A -optimal design is NP-hard to approximate within a fixed constant when k = d .

Suggested Citation

  • Aleksandar Nikolov & Mohit Singh & Uthaipon (Tao) Tantipongpipat, 2022. "Proportional Volume Sampling and Approximation Algorithms for A -Optimal Design," Mathematics of Operations Research, INFORMS, vol. 47(2), pages 847-877, May.
    • Handle: RePEc:inm:ormoor:v:47:y:2022:i:2:p:847-877
    DOI: 10.1287/moor.2021.1129
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1129
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2021.1129?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
    ---><---

    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:inm:ormoor:v:47:y:2022:i:2:p:847-877. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.