arXiv (OAI Expanded)
open access
Non-Uniform Random Scans in Gibbs Sampling and CAVI
Gibbs sampling and coordinate ascent variational inference (CAVI) are two basic coordinate-wise methods for statistical computation. Recent analyses under strong log-concavity establish convergence rates for versions of these algorithms that update one uniformly selected block at each step. We exten
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
- Cost Comparisons for Random and Deterministic Scans in Component-Wise Markov Chains#1156056
- Convex Optimization Is Free When Accuracy Is Expensive#1130006
- Accelerated Sampling with the Inertial Langevin Algorithm#972393
- Heavy-Ball Method under Randomized Schedules#996568
Record · ID 809860
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