Efficient computation of the volume of a polytope in high-dimensions using Piecewise Deterministic Markov Processes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Efficient computation of the volume of a polytope in high-dimensions using Piecewise Deterministic Markov Processes

Abstract

Computing the volume of a polytope in high dimensions is computationally challenging but has wide applications. Current state-of-the-art algorithms to compute such volumes rely on efficient sampling of a Gaussian distribution restricted to the polytope, using e.g. Hamiltonian Monte Carlo. We present a new sampling strategy that uses a Piecewise Deterministic Markov Process. Like Hamiltonian Monte Carlo, this new method involves simulating trajectories of a non-reversible process and inherits similar good mixing properties. However, importantly, the process can be simulated more easily due to its piecewise linear trajectories-and this leads to a reduction of the computational cost by a factor of the dimension of the space. Our experiments indicate that our method is numerically robust and is one order of magnitude faster (or better) than existing methods using Hamiltonian Monte Carlo. On a single core processor, we report computational time of a few minutes up to dimension 500.
Fichier principal
Vignette du fichier
aistats.pdf (588.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03918039 , version 1 (02-01-2023)

Identifiers

  • HAL Id : hal-03918039 , version 1

Cite

Augustin Chevallier, Frédéric Cazals, Paul Fearnhead. Efficient computation of the volume of a polytope in high-dimensions using Piecewise Deterministic Markov Processes. AISTATS 2022 - 25th International Conference on Artificial Intelligence and Statistics, Mar 2022, Virtual, France. ⟨hal-03918039⟩
14 View
8 Download

Share

Gmail Facebook Twitter LinkedIn More