activity
20112026
most citedGroup Testing: An Information Theory Perspective

133 citations · 803 across the 68 of their papers we have counts for

collaborators
Showing 2016Show all

9 papers · 1 filter

cs.IT2016★ 56 cited

Performance of group testing algorithms with near-constant tests-per-item

Oliver Johnson, Matthew Aldridge, Jonathan Scarlett

We consider the nonadaptive group testing with N items, of which are defective. We study a test design in which each item appears in nearly the same number of tests. F…

cs.IT2016

Mismatched Multi-Letter Successive Decoding for the Multiple-Access Channel

Jonathan Scarlett, Alfonso Martinez, Albert Guillén i Fàbregas

This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depe…

stat.ML2016★ 34 cited

Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimation

Ilija Bogunovic, Jonathan Scarlett, Andreas Krause +1

We present a new algorithm, truncated variance reduction (TruVaR), that treats Bayesian optimization (BO) and level-set estimation (LSE) with Gaussian processes in a unified fashio…

cs.IT2016★ 5 cited

Lower Bounds on Active Learning for Graphical Model Selection

Jonathan Scarlett, Volkan Cevher

We consider the problem of estimating the underlying graph associated with a Markov random field, with the added twist that the decoding algorithm can iteratively choose which subs…

cs.IT2016

On the Difficulty of Selecting Ising Models with Approximate Recovery

Jonathan Scarlett, Volkan Cevher

In this paper, we consider the problem of estimating the underlying graph associated with an Ising model given a number of independent and identically distributed samples. We adopt…

cs.IT2016★ 16 cited

Improved group testing rates with constant column weight designs

Matthew Aldridge, Oliver Johnson, Jonathan Scarlett

We consider nonadaptive group testing where each item is placed in a constant number of tests. The tests are chosen uniformly at random with replacement, so the testing matrix has…

cs.IT2016

Partial Recovery Bounds for the Sparse Stochastic Block Model

Jonathan Scarlett, Volkan Cevher

In this paper, we study the information-theoretic limits of community detection in the symmetric two-community stochastic block model, with intra-community and inter-community edge…

cs.IT2016★ 1 cited

Converse Bounds for Noisy Group Testing with Arbitrary Measurement Matrices

Jonathan Scarlett, Volkan Cevher

We consider the group testing problem, in which one seeks to identify a subset of defective items within a larger set of items based on a number of noisy tests. While matching achi…

stat.ML2016★ 35 cited

Time-Varying Gaussian Process Bandit Optimization

Ilija Bogunovic, Jonathan Scarlett, Volkan Cevher

We consider the sequential Bayesian optimization problem with bandit feedback, adopting a formulation that allows for the reward function to vary with time. We model the reward fun…