Papers › PolytopeWalk: Sparse MCMC Sampling over Polytopes

PolytopeWalk: Sparse MCMC Sampling over Polytopes

9 Dec 2024arXiv:2412.06629archive 2025-07-28

Benny Sun, Yuansi Chen

High dimensional sampling is an important computational tool in statistics and other computational disciplines, with applications ranging from Bayesian statistical uncertainty quantification, metabolic modeling in systems biology to volume computation. We present PolytopeWalk, a new scalable Python library designed for uniform sampling over polytopes. The library provides an end-to-end solution, which includes preprocessing algorithms such as facial reduction and initialization methods. Six state-of-the-art MCMC algorithms on polytopes are implemented, including the Dikin, Vaidya, and John Walk. Additionally, we introduce novel sparse constrained formulations of these algorithms, enabling efficient sampling from sparse polytopes of the form K₂ = {x ∈ℝᵈ | Ax = b, x ≽ₖ 0}. This implementation maintains sparsity in A, ensuring scalability to high dimensional settings (d > 10⁵). We demonstrate the improved sampling efficiency and per-iteration cost on both Netlib datasets and structured polytopes. PolytopeWalk is available at github.com/ethz-randomwalk/polytopewalk with documentation at polytopewalk.readthedocs.io .

PaperPDFCode

Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.

Code

ethz-randomwalk/polytopewalk officialmentioned in papermentioned on GitHubMITSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Uncertainty Quantification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections