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

Mario Vazquez Corte () and Luis V. Montiel ()
Additional contact information
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

Computational Statistics, 2025, vol. 40, issue 6, No 10, 3067-3104

Abstract: 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.

Keywords: Vector simulation; Random walk; MCMC; PyTorch; Parallel processing; Graphics processing unit (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00180-023-01411-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:compst:v:40:y:2025:i:6:d:10.1007_s00180-023-01411-y

Ordering information: This journal article can be ordered from
http://www.springer.com/statistics/journal/180/PS2

DOI: 10.1007/s00180-023-01411-y

Access Statistics for this article

Computational Statistics is currently edited by Wataru Sakamoto, Ricardo Cao and Jürgen Symanzik

More articles in Computational Statistics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().