English
Related papers

Related papers: On the Optimal Configuration of a Square Array Gro…

200 papers

Group testing is concerned with identifying $t$ defective items in a set of $m$ items, where each test reports whether a specific subset of items contains at least one defective. In non-adaptive group testing, the subsets to be tested are…

Computational Geometry · Computer Science 2020-12-03 Benjamin Aram Berendsohn , László Kozma

Recently, we proposed to combine time sharing with hierarchical modulation to increase the transmission rate of broadcast systems. Our proposal involves to group the receivers in pairs in order to transmit with hierarchical modulation. We…

Networking and Internet Architecture · Computer Science 2014-06-18 Hugo Meric , José Piquer , Jérôme Lacan

This paper provides a least squares formulation for the training of a 2-layer convolutional neural network using quadratic activation functions, a 2-norm loss function, and no regularization term. Using this method, an analytic expression…

Machine Learning · Computer Science 2024-11-18 Zachary Yetman Van Egmond , Luis Rodrigues

This paper proposes a technique to help choose the best formal specification candidate among a set of alternatives. Given a set of specifications, our technique generates a suite of test cases that, once classified by the user as desirable…

Software Engineering · Computer Science 2025-11-25 Alcino Cunha , Nuno Macedo

Group testing is an efficient method for testing a large population to detect infected individuals. In this paper, we consider an efficient adaptive two stage group testing scheme. Using a straightforward analysis, we characterize the…

Methodology · Statistics 2020-08-26 Arjun Kodialam

In this work, we study Bayesian quantum parameter estimation given a finite number of uses of the process encoding one or more unknown physical quantities. For multiple uses, it is conventional to classify quantum metrological protocols as…

Quantum Physics · Physics 2026-02-11 Erik L. André , Jessica Bavaresco , Mohammad Mehboudi

We prove the tightest-known upper bounds on the sample complexity of multi-group learning. Our algorithm extends the one-inclusion graph prediction strategy using a generalization of bipartite $b$-matching. In the group-realizable setting,…

Machine Learning · Computer Science 2026-04-10 Noah Bergam , Samuel Deng , Daniel Hsu

The motivation for this paper comes from the ongoing SARS-CoV-2 Pandemic. Its goal is to present a previously neglected approach to non-adaptive group testing and describes it in terms of residuated pairs on partially ordered sets. Our…

Other Statistics · Statistics 2022-02-15 Marcus Greferath , Cornelia Roessing

\emph{Group Testing} (GT) addresses the problem of identifying a small subset of defective items from a large population, by grouping items into as few test pools as possible. In \emph{Adaptive GT} (AGT), outcomes of previous tests can…

Information Theory · Computer Science 2020-08-17 Alejandro Cohen , Asaf Cohen , Omer Gurewitz

Batch policy optimization considers leveraging existing data for policy construction before interacting with an environment. Although interest in this problem has grown significantly in recent years, its theoretical foundations remain…

Machine Learning · Computer Science 2021-04-07 Chenjun Xiao , Yifan Wu , Tor Lattimore , Bo Dai , Jincheng Mei , Lihong Li , Csaba Szepesvari , Dale Schuurmans

In adaptive data analysis, the user makes a sequence of queries on the data, where at each step the choice of query may depend on the results in previous steps. The releases are often randomized in order to reduce overfitting for such…

Machine Learning · Statistics 2016-02-16 Yu-Xiang Wang , Jing Lei , Stephen E. Fienberg

We explore the role of group symmetries in binary classification tasks, presenting a novel framework that leverages the principles of Neyman-Pearson optimality. Contrary to the common intuition that larger symmetry groups lead to improved…

Machine Learning · Computer Science 2024-08-19 Vishal S. Ngairangbam , Michael Spannowsky

In combinatorial group testing (CGT), the objective is to identify the set of at most $d$ defective items from a pool of $n$ items using as few tests as possible. The celebrated result for the CGT problem is that the number of tests $t$ can…

Information Theory · Computer Science 2019-01-29 Huseyin A. Inan , Peter Kairouz , Ayfer Ozgur

Modern software systems often consist of many different components, each with a number of options. Although unit tests may reveal faulty options for individual components, functionally correct components may interact in unforeseen ways to…

Data Structures and Algorithms · Computer Science 2016-06-23 Kaushik Sarkar , Charles J. Colbourn

The implementation of adaptive genetic algorithms (AGA) for optimization problems has proven to be superior than many other methods due to its nature of producing more robust and high quality solutions. Considering the complexity involved…

Computational Physics · Physics 2024-11-28 Brandon Willnecker , Mervlyn Moodley

Purpose: To develop a multi-criteria optimization framework for image guided radiotherapy. Methods: An algorithm is proposed for a multi-criteria framework for the purpose of patient setup verification decision processes. Optimal patient…

Medical Physics · Physics 2011-08-16 Brian Winey , James Balter

We consider the quantitative group testing problem where the objective is to identify defective items in a given population based on results of tests performed on subsets of the population. Under the quantitative group testing model, the…

Information Theory · Computer Science 2017-10-24 Chao Wang , Qing Zhao , Chen-Nee Chuah

Studies have shown that each person is more inclined to enjoy a group activity when 1) she is interested in the activity, and 2) many friends with the same interest join it as well. Nevertheless, even with the interest and social tightness…

Social and Information Networks · Computer Science 2015-03-16 Hong-Han Shuai , De-Nian Yang , Philip S. Yu , Ming-Syan Chen

Group zero-attracting LMS and its reweighted form have been proposed for addressing system identification problems with structural group sparsity in the parameters to estimate. Both algorithms however suffer from a trade-off between…

Signal Processing · Electrical Eng. & Systems 2018-04-02 Danqi Jin , Jie Chen , Cedric Richard , Jingdong Chen

We study the problem of identifying defective units in a finite population of \( n \) units, where each unit \( i \) is independently defective with known probability \( p_i \). This setting is referred to as the \emph{Generalized Group…

Statistics Theory · Mathematics 2025-06-23 Yaakov Malinovsky , Viktor Skorniakov