Skip to Main content Skip to Navigation
Conference papers

On variable splitting for Markov chain Monte Carlo

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02419442
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Thursday, December 19, 2019 - 2:45:07 PM
Last modification on : Friday, December 11, 2020 - 6:44:05 PM
Long-term archiving on: : Friday, March 20, 2020 - 6:13:28 PM

File

vono_24984.pdf
Files produced by the author(s)

Identifiers

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

Citation

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⟩

Share

Metrics

Record views

61

Files downloads

59