arXiv (All)
open access
Adaptive Pseudo-Marginal Algorithm
The Pseudo-Marginal (PM) algorithm is a popular Markov chain Monte Carlo (MCMC) method used to sample from a target distribution when its density is inaccessible, but can be estimated with a non-negative unbiased estimator. Its performance depends on a key parameter, N, the number of iterations (or
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
- Exact Global MCMC with Denoising Diffusion#819735
- Exact Global MCMC with Denoising Diffusion#809739
- Convex Optimization Is Free When Accuracy Is Expensive#1130006
- Empirical Bayes for compound adaptive experiments#1123545
- Correcting Boundary Bias and Observation Independence in Bayesian Experimental Design#1012114
Record · ID 1115482
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