48,545 research outputs found
A Survey of Constrained Combinatorial Testing
Combinatorial Testing (CT) is a potentially powerful testing technique,
whereas its failure revealing ability might be dramatically reduced if it fails
to handle constraints in an adequate and efficient manner. To ensure the wider
applicability of CT in the presence of constrained problem domains, large and
diverse efforts have been invested towards the techniques and applications of
constrained combinatorial testing. In this paper, we provide a comprehensive
survey of representations, influences, and techniques that pertain to
constraints in CT, covering 129 papers published between 1987 and 2018. This
survey not only categorises the various constraint handling techniques, but
also reviews comparatively less well-studied, yet potentially important,
constraint identification and maintenance techniques. Since real-world programs
are usually constrained, this survey can be of interest to researchers and
practitioners who are looking to use and study constrained combinatorial
testing techniques
Coding-Theoretic Methods for Sparse Recovery
We review connections between coding-theoretic objects and sparse learning
problems. In particular, we show how seemingly different combinatorial objects
such as error-correcting codes, combinatorial designs, spherical codes,
compressed sensing matrices and group testing designs can be obtained from one
another. The reductions enable one to translate upper and lower bounds on the
parameters attainable by one object to another. We survey some of the
well-known reductions in a unified presentation, and bring some existing gaps
to attention. New reductions are also introduced; in particular, we bring up
the notion of minimum "L-wise distance" of codes and show that this notion
closely captures the combinatorial structure of RIP-2 matrices. Moreover, we
show how this weaker variation of the minimum distance is related to
combinatorial list-decoding properties of codes.Comment: Added Lemma 34 in the first revision. Original version in Proceedings
of the Allerton Conference on Communication, Control and Computing, September
201
Group testing:an information theory perspective
The group testing problem concerns discovering a small number of defective
items within a large population by performing tests on pools of items. A test
is positive if the pool contains at least one defective, and negative if it
contains no defectives. This is a sparse inference problem with a combinatorial
flavour, with applications in medical testing, biology, telecommunications,
information technology, data science, and more. In this monograph, we survey
recent developments in the group testing problem from an information-theoretic
perspective. We cover several related developments: efficient algorithms with
practical storage and computation requirements, achievability bounds for
optimal decoding methods, and algorithm-independent converse bounds. We assess
the theoretical guarantees not only in terms of scaling laws, but also in terms
of the constant factors, leading to the notion of the {\em rate} of group
testing, indicating the amount of information learned per test. Considering
both noiseless and noisy settings, we identify several regimes where existing
algorithms are provably optimal or near-optimal, as well as regimes where there
remains greater potential for improvement. In addition, we survey results
concerning a number of variations on the standard group testing problem,
including partial recovery criteria, adaptive algorithms with a limited number
of stages, constrained test designs, and sublinear-time algorithms.Comment: Survey paper, 140 pages, 19 figures. To be published in Foundations
and Trends in Communications and Information Theor
- …