On variable splitting for Markov chain Monte Carlo - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

On variable splitting for Markov chain Monte Carlo


Variable splitting is an old but widely used technique whichaims at dividing an initial complicated optimization problem into simplersub-problems. In this work, we take inspiration from this variable splitting idea in order to build efficient Markov chain Monte Carlo(MCMC) algorithms. Starting from an initial complex target distribution,auxiliary variables are introduced such that the marginal distributionof interest matches the initial one asymptotically. In addition to havetheoretical guarantees, the benefits of such an asymptotically exact dataaugmentation (AXDA) are fourfold: (i) easier-to-sample full conditionaldistributions, (ii) possibility to embed while accelerating state-of-the-artMCMC approaches, (iii) possibility to distribute the inference and (iv)to respect data privacy issues. The proposed approach is illustrated onclassical image processing and statistical learning problems.
Fichier principal
Vignette du fichier
vono_24984.pdf (186.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02419442 , version 1 (19-12-2019)


  • HAL Id : hal-02419442 , version 1
  • OATAO : 24984


Maxime Vono, Nicolas Dobigeon, Pierre Chainais. On variable splitting for Markov chain Monte Carlo. Workshop on Signal Processing with Adaptative Sparse Structured Representations (SPARS 2019), Apr 2019, Toulouse, France. pp.1-2. ⟨hal-02419442⟩
50 View
55 Download


Gmail Facebook Twitter LinkedIn More