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.
By Vincent Corlay, Andriy Enttsel
arXiv:2607. 19333v1 Announce Type: cross Abstract: Diffusion-based methods have achieved remarkable empirical success in solving inverse problems.
By Yuchen Jiao, Na Li, Changxiao Cai, Yuxin Chen, Gen Li
arXiv:2608.23960v1 Announce Type: cross
Abstract: Missing labels are usually regarded as a source of information loss in classification. We study a semi-supervised setting in which the probability of...
By You-Gan Wang, Jinran Wu, Geoffrey J. McLachlan
arXiv:2602. 01477v2 Announce Type: replace-cross Abstract: Evidential Deep Learning (EDL) is a popular framework for uncertainty-aware classification that models predictive uncertainty via Dirichlet distributions parameterized by neural networks.
By Pietro Carlotti, Nevena Gligi\'c, Arya Farahi
arXiv:2602. 10792v2 Announce Type: replace-cross Abstract: In signal processing, the data collected from sensing devices is often a noisy linear superposition of multiple components, and the estimation of components of interest constitutes a crucial pre-processing step.
By Yi Zhang, Rui Guo, Yonina C. Eldar
arXiv:2511. 17038v4 Announce Type: replace Abstract: From a Bayesian perspective, score-based diffusion solves inverse problems through joint inference, embedding the likelihood with the prior to guide the sampling process.
By Hao Chen, Renzheng Zhang, Scott S. Howard