arXiv (All)
open access
Cost Comparisons for Random and Deterministic Scans in Component-Wise Markov Chains
Gibbs samplers, and more generally component-wise Markov chain Monte Carlo algorithms such as Metropolis-within-Gibbs, can be implemented using either random-scan or deterministic-scan updates. How much convergence can depend on this choice of scanning rule has been a longstanding question. We study
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Non-Uniform Random Scans in Gibbs Sampling and CAVI#819856
- Non-Uniform Random Scans in Gibbs Sampling and CAVI#809860
- Minimizing the Age of Incorrect Information for Unknown Markovian Source#150677
- Gaps and Augmentations in Bayesian Scheduling#1118186
- Diffusion-Based Posterior Sampling: A Feynman-Kac Analysis of Bias and Stability#168340
Record · ID 1156056
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive