arXiv (All)
open access
Uniform Race: Parameter-Free Approximate Rejection Sampling
We study approximate sampling: given $N$ independent samples from a proposal distribution $μ$, the goal is to select one whose distribution is close to a target $π$ specified only up to a normalizing constant. Block and Polyanskiy (2023) provide finite budget error bounds for approximate rejection s
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
- Coherent and robust Bayesian inference under informative sampling via sample-level weight models#1039191
- Efficient Rejection Sampling in the Entropy-Optimal Range#173267
- Uniform Estimates for Integers with a Large Smooth Part#1141829
- Sampling Techniques#10866
- The Price of Privacy For Approximating Max-CSP#1109784
Record · ID 1128901
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