Skip to content
DraconiticResearch
Search Sources API
186,625 studies31 sourcesUpdated 26 min ago
PreprintCC BY 4.0arXiv

Quenched Ensemble Sampling

Abstract

Some of the sharpest challenges in sampling from the energy functions of physical systems arise at phase transitions, where the density of states changes abruptly and many sampling algorithms stall. Nested sampling is a particle method that traverses the density of states under a hard energy constraint and is known to be robust to such transitions, but its application in high dimension is limited by the difficulty of sampling under that constraint. In this work we introduce Quenched Ensemble Sampling, which generalises the hard constraint to a family of repulsive potentials at the energy boundary. This preserves the quenched path of monotonically decreasing energy while making the constrained target amenable to scalable gradient-based kernels. We demonstrate on synthetic models of phase transitions that our method estimates the marginal likelihood and draws posterior samples across a first-order transition where popular alternatives such as tempering fail. We apply the procedure to marginal likelihood estimation in Bayesian neural networks, enabling model comparison between network architectures. Finally, in a high-dimensional continuous lattice field theory, we show that this method traverses a first-order transition and estimates the partition function.

Related

  1. Linear Ensemble Sampling with Smaller Ensembles
    Taehyun Hwang, Min-hwan Oh
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Quenched functional central limit theorem for the random conductance model under minimal moments
    Leonid Kolesnikov, Yannic Steenbeck
    arXivPreprintCC BY-NC-SA 4.0Full textProbabilityarXiv
  3. Annealed correlation and quenched noise sensitivity in biased deep neural networks
    Johan Jonasson
    arXivPreprintarXiv licenceFull textProbabilityStatisticsarXiv
  4. A second-moment proof of quenched equals annealed for the Potts model on random regular graphs
    Remco van der Hofstad, Kai-Chun Huang, Noela Müller +1
    arXivPreprintCC BY-NC-SA 4.0Full textProbabilityarXiv
  5. Quenched Growth of Normal Matrices and Harmonic Measure
    Oleg Alekseev
    arXivPreprintCC BY 4.0Full textMathematical physicsProbabilityarXiv
BibTeX
@misc{yallup2026quenched,
  title = {{Quenched Ensemble Sampling}},
  author = {David Yallup},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.15894},
  eprint = {2609.15894},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.15894},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Quenched Ensemble Sampling
AU  - David Yallup
PY  - 2026
DA  - 2026/09/14
PB  - arXiv
DO  - 10.48550/arxiv.2609.15894
UR  - https://arxiv.org/abs/2609.15894
AB  - Some of the sharpest challenges in sampling from the energy functions of physical systems arise at phase transitions, where the density of states changes abruptly and many sampling algorithms stall. Nested sampling is a particle method that traverses the density of states under a hard energy constraint and is known to be robust to such transitions, but its application in high dimension is limited by the difficulty of sampling under that constraint. In this work we introduce Quenched Ensemble Sampling, which generalises the hard constraint to a family of repulsive potentials at the energy boundary. This preserves the quenched path of monotonically decreasing energy while making the constrained target amenable to scalable gradient-based kernels. We demonstrate on synthetic models of phase transitions that our method estimates the marginal likelihood and draws posterior samples across a first-order transition where popular alternatives such as tempering fail. We apply the procedure to marginal likelihood estimation in Bayesian neural networks, enabling model comparison between network architectures. Finally, in a high-dimensional continuous lattice field theory, we show that this method traverses a first-order transition and estimates the partition function.
ER  -