arXiv (OAI Expanded)
open access
Iterated sampling importance resampling with adaptive number of proposals
Iterated sampling importance resampling (i-SIR) is a Markov chain Monte Carlo (MCMC) algorithm which is based on $N$ independent proposals. As $N$ grows, its samples become nearly independent, but with an increased computational cost. We discuss a method which finds an approximately optimal number o
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
- Iterated sampling importance resampling with adaptive number of proposals#785094
- Optimal sampling strategies in event-chain Monte Carlo#1156930
- Optimal Scaling of Langevin Proposals with Generalized Acceptance Rules#1123351
- Near-Linear Accuracy Bounds for Moreau--Yosida Unadjusted Langevin Sampling#1154457
- Near-Linear Accuracy Bounds for Moreau--Yosida Unadjusted Langevin Sampling#1136823
Record · ID 783504
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