arXiv Computer Vision By Vincent Corlay, Andriy Enttsel

How Many Posterior Samples? Calibrated Stopping for Adaptive Sensing

Read the original on arXiv Computer Vision →

The paper investigates how to decide when to stop collecting posterior samples in classification‑oriented adaptive sensing. It shows that a simple threshold‑based plug‑in rule does not guarantee the desired confidence level, and proposes calibrated fixed‑sample and finite‑horizon sequential stopping rules that control the false‑declaration probability. Experiments on MNIST demonstrate that the sequential rule can reduce sensing cost the most, and that a curtailment strategy can save up to 62% of posterior samples while maintaining accuracy.

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 Computer Vision.

arXiv Computer Vision
Sep 21

Classification-oriented adaptive sensing via posterior sampling

The paper proposes a classification-oriented adaptive sensing method that uses posterior sampling from diffusion models. It leverages the closed-form posterior covariance of a class-conditional Gaussian mixture model to separate within-class and between-class uncertainty, estimating these terms from diffusion posterior samples via calibrated soft classifier outputs. Experiments on MNIST and CIFAR-10 demonstrate that this approach can achieve better classification accuracy for a given measurement cost compared to reconstruction-oriented methods, while also quantifying the associated reconstruction quality.

By Andriy Enttsel, Maxime Rousselot, Vincent Corlay
arXiv AI
2d ago

From Discovery to Decision: Finite-Budget Recoverability in LLM Voting

The paper studies how voting over multiple large language model (LLM) responses can be optimized under a fixed call budget. It introduces a recoverability threshold that quantifies the gap between discovering a correct answer and ensuring it wins the plurality vote, showing that the candidate set can only grow while the set of reachable winners can only shrink. The authors also present a gold‑free locking certificate that identifies the earliest prefix where all remaining continuations produce the same fixed‑budget output, and demonstrate empirical gains in accuracy and call efficiency through input permutation and exact locking.

By Shaoang Li, Jian Li