On optimal policy in the group testing with incomplete identification

Yaakov Malinovsky

Home/Archive/arXiv

arXiv · 1712.03168

On optimal policy in the group testing with incomplete identification

Yaakov Malinovsky

View original source ↗Read source document ↗Export metadata ↓

Abstract

Consider a very large (infinite) population of items, where each item independent from the others is defective with probability p, or good with probability q=1-p. The goal is to identify N good items as quickly as possible. The following group testing policy (policy A) is considered: test items together in the groups, if the test outcome of group i of size n_i is negative, then accept all items in this group as good, otherwise discard the group. Then, move to the next group and continue until exact N good items are found. The goal is to find an optimal testing configuration, i.e., group sizes, under policy A, such that the expected waiting time to obtain N good items is minimal. Recently, Gusev (2012) found an optimal group testing configuration under the assumptions of constant group size and N=\infty. In this note, an optimal solution under policy A for finite N is provided. Keywords: Dynamic programming; Optimal design; Partition problem; Shur-convexity

Explore related subjects

stat.OT

Keep this discovery

BibTeX RIS

Yaakov Malinovsky. 2017-12-08. On optimal policy in the group testing with incomplete identification. https://arxiv.org/abs/1712.03168

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Design and Implementation of a Virtual Statistical Computing Lab to Teach R Coding to Introductory Statistics Students

Motivated by national calls for computationally enriched, data-centric instruction across the statistics curriculum, this study investigates the design, implementation, and impact of a Virtual Statistical Computing Lab (VSCL) integrated into an introductory statistics course at a medium-sized minority-serving university in the USA. The redesigned course embedded R-based coding through two virtual lab formats: Design I (a static Posit Cloud environment) and Design II (an interactive learnr-based interface). Using a quasi-experimental design across three instructional formats, traditional (no lab), Design I, and Design II, we evaluated students' conceptual learning gains, levels of data science (DS) readiness, and DS aspirations. The results indicated significant learning gains across all groups, with the highest gains observed in Design II. Students in both VSCL formats achieved greater gains in DS readiness than the traditional group, with Design II again yielding the largest gains across the demographic subgroups. Conversely, DS aspirations remained low or declined, suggesting a gap between skill acquisition and long-term interest. These findings highlight the value of structured, interactive computing environments in supporting statistical reasoning and building confidence in modern data tools. They also point to the need for intentional curricular bridges and career mentoring to help students translate early computing exposure into sustained academic and professional pathways in statistics and data science.

stat.OT↗

arXiv2026

Statistical Theory in the Age of Machine-Assisted Mathematics: Rethinking How Theory Is Made and Taught

The computational revolution is advancing at an unprecedented pace. The combination of proof-assistant technologies and generative AI tools has recently enabled the solution of complex problems in pure mathematics at a scale that seemed unattainable only a few years ago. However, these technologies have not yet become standard tools in the development of statistical theory. In this paper, we do not present new theoretical results. Instead, we discuss five case studies involving classical problems in statistics and describe how they can be analyzed using a machine proof-checking. Our goal is not to propose a definitive workflow, but to stimulate reflection on how these technologies may transform theoretical research and advanced statistical education. We focus on two main aspects. First, statistical theory often compresses substantial mathematical content into expressions such as "under the usual regularity conditions". Formalization in a machine-verifiable language forces each assumption to be explicit, reveal hidden dependencies, and provide a deeper understanding of the formalized objects. Second, we argue that the statistical community could benefit from a collaborative effort to build repositories of formalized axioms, definitions, and theorems, supporting more precise and reliable theoretical developments. Finally, we discuss the role of these tools in graduate education. Just as high-level programming languages revolutionized empirical research by enabling rapid experimentation and prototyping, machine-assisted formalization may introduce a new paradigm for the development, verification, and communication of statistical theory.

stat.OT↗

arXiv2026

Statistical Leadership of What? Statistics After AI

Statisticians have spent over a century arguing that we are more than calculators, usually by pointing to what else we know. AI is making that defense harder, since the list of what only statisticians can do grows shorter with each model release. AI makes claims cheap to generate and may eventually make the statistics behind them cheap too. However, a model cannot be answerable in the way that statistical practice requires. Statistical leadership then becomes a question of which claims we are there to answer for, including the ones we answer for in advance by building judgment into systems.

stat.OT↗