Uniform Race: Parameter-Free Approximate Rejection Sampling
Read the original on arXiv Machine Learning →The paper introduces Uniform Race (UR), a parameter‑free algorithm for approximate rejection sampling that selects a sample by maximizing the ratio of its importance weight to an independent uniform random variable. UR achieves the same total variation error bound as the optimal rejection sampler that requires knowledge of the best acceptance threshold, and it outperforms both the budget‑calibrated rejection sampler and sampling importance resampling in certain settings. The authors also provide theoretical conditions under which UR’s selection probabilities are uniquely optimal and validate the method on large‑language‑model reasoning tasks.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.