Metraipolis › archive › dc_5564176fb3db

On skew-symmetric distributions and their use in Monte Carlo sampling algorithms: coordinate-free, Gibbs-style and manifold versions of the Barker proposal — arXiv:2610.01448

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.01448
License (as archived)
CC0-1.0
Archived
2026-10-06T15:33:50.353Z
SHA-256 of the archived text
66cbb6d3809ae1909b3b7d3488235963a6f9ff8d7383db7fd9596be9d67e1ac5
Stable URL of this page
https://metraipolis.com/documento/dc_5564176fb3db

How to cite

On skew-symmetric distributions and their use in Monte Carlo sampling algorithms: coordinate-free, Gibbs-style and manifold versions of the Barker proposal — arXiv:2610.01448 — arXiv (en), https://arxiv.org/abs/2610.01448 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5564176fb3db (Metraipolis archive dc_5564176fb3db, sha256 66cbb6d3809ae1909b3b7d3488235963a6f9ff8d7383db7fd9596be9d67e1ac5)
BibTeX
@misc{dc5564176fb3db,
  title = {On skew-symmetric distributions and their use in Monte Carlo sampling algorithms: coordinate-free, Gibbs-style and manifold versions of the Barker proposal — arXiv:2610.01448},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.01448},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5564176fb3db; sha256 66cbb6d3809ae1909b3b7d3488235963a6f9ff8d7383db7fd9596be9d67e1ac5},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01448. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Skew-symmetric probability distributions provide a principled mechanism for incorporating gradient information into Markov chain Monte Carlo algorithms. Here we review the (preconditioned) Barker proposal, a Metropolis--Hastings algorithm built on skew-symmetric distributions, and motivate its design. We then introduce three natural extensions. First, we propose coordinate-free variants of the Barker algorithm. Second, we introduce a Gibbs-style Barker algorithm that re-evaluates the gradient at each partially updated coordinate. Third, we derive a simplified manifold Barker algorithm, producing a manifold sampler with enhanced robustness compared to natural comparators. Numerical experiments demonstrate that the Gibbs-style variant improves raw sampling efficiency on correlated targets, that the coordinate-free variants offer limited practical advantage over the standard Barker proposal once computational costs are accounted for, and that the simplified manifold Barker algorithm can achieve significant advantages over simplified manifold MALA when the local geometric structure of the target is irregular or unreliable.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-10-02 in stat.ML).
Categorie arXiv: Computation (stat.CO) ; Methodology (stat.ME); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2610.01448 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T15:12:55.902Z dalla pagina https://arxiv.org/catchup/stat.ML/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).