AI & ML
Adjusting SPRT for an Asymptotically Efficient Procedure with Finite Number of Applications of Less Effective Treatment
arXiv stat.TH0 views
arXiv:2511.20061v3 Announce Type: replace Abstract: We propose an adaptive Sequential Probability Ratio Test (SPRT) with a finite expected number of allocations to the less effective treatment. In the classical SPRT framework, patients are assigned to the two competing treatments one-by-one until a stopping criterion, based on breaching the boundary values which are pre-determined using the Type-I and Type-II error probabilities, is met. This controls the errors at the cost of ethical efficiency as the exposure to the less effective treatment is large. For testing two simple hypotheses, our proposed procedure employs a likelihood ratio-driven adaptive allocation rule, dynamically concentrating sampling effort on the superior population while preserving asymptotic efficiency (in terms of average sample number) comparable to the classical SPRT. We show that at each step, the allocated observations remain independent despite the data-dependent allocation, prove that the expected number of allocations to the inferior treatment remains finite, with an explicit upper bound, and derive a closed-form approximation to it. Extensive simulation studies and data-calibrated case studies substantiate the theoretical results, evincing a significant reduction in inferior allocations compared to the classical SPRT. The proposed design thus offers a balanced method between statistical precision and ethical responsibility, aligning inferential reliability with patient safety.
Source:https://arxiv.org/abs/2511.20061PreviousCausal Effect Estimation Under Uncertain Statistical SurrogacyNextAt least seven modes in a heteroscedastic three-component bivariate Gaussian mixture
Related posts
More of the AI in Your Product May Run on the User's Own Device
0dev.to

So sicherst du einen MCP-Server mit codex sandbox ab
0dev.to

Perfiles de permisos de Codex: ejemplos de config.toml para ejecuciones seguras de agentes
0dev.to

GPTBot vs OAI-SearchBot: How to Configure robots.txt for AI Crawlers
0dev.to

ملفات تعريف أذونات Codex: أمثلة config.toml لتشغيل الوكلاء بأمان
0dev.to

Write a cover letter with AI and keep every fact yours: a nine-step loop
0dev.to