IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v40y2025i6d10.1007_s00180-023-01411-y.html
   My bibliography  Save this article

Novel matrix hit and run for sampling polytopes and its GPU implementation

Author

Listed:
  • Mario Vazquez Corte

    (Instituto Tecnológico Autónomo de México - ITAM)

  • Luis V. Montiel

    (Universidad Nacional Auntónoma de México - UNAM, Ciudad Universitaria)

Abstract

We propose and analyze a new Markov Chain Monte Carlo algorithm that generates a uniform sample over full and non-full-dimensional polytopes. This algorithm, termed “Matrix Hit and Run” (MHAR), is a modification of the Hit and Run framework. For a polytope in $$\mathbb {R}^n$$ R n defined by m linear constraints, the regime $$n^{1+\frac{1}{3}} \ll m$$ n 1 + 1 3 ≪ m has a lower asymptotic cost per sample in terms of soft-O notation ( $$\mathcal {O}^*$$ O ∗ ) than do existing sampling algorithms after a warm start. MHAR is designed to take advantage of matrix multiplication routines that require less computational and memory resources. Our tests show this implementation to be substantially faster than the hitandrun R package, especially for higher dimensions. Finally, we provide a python library based on PyTorch and a Colab notebook with the implementation ready for deployment in architectures with GPU or just CPU.

Suggested Citation

  • Mario Vazquez Corte & Luis V. Montiel, 2025. "Novel matrix hit and run for sampling polytopes and its GPU implementation," Computational Statistics, Springer, vol. 40(6), pages 3067-3104, July.
    • Handle: RePEc:spr:compst:v:40:y:2025:i:6:d:10.1007_s00180-023-01411-y
    DOI: 10.1007/s00180-023-01411-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-023-01411-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00180-023-01411-y?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:spr:compst:v:40:y:2025:i:6:d:10.1007_s00180-023-01411-y. 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.