University of Cambridge > Talks.cam > Probabilistic Systems, Information, and Inference Group Seminars > Algorithms and bounds for group testing

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Algorithms and bounds for group testing

Download to your calendar using vCal

If you have a question about this talk, please contact Prof. Ramji Venkataramanan .

Group testing was introduced by Dorfman in the 1940s, and gives a model for isolating a small number of infected members of a larger population. I will review recent work on this problem, and explain some new algorithms which can be proved to perform well in certain sparsity regimes. To complement this, I will explain how a channel coding argument of Polyanskiy, Poor and Verdu gives an upper bound on the success rate that can be achieved by any non-adaptive algorithm, by a comparison with a certain statistical hypothesis test. This argument can be modified in the adaptive case, using ideas from directed information theory, corresponding to channel coding with feedback.

This talk is part of the Probabilistic Systems, Information, and Inference Group Seminars series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Microsoft Research PhD Scholars SG1/2, Alison Richard Building, Cambridge, CB3 9DT Webinar & FW11, Computer Laboratory, William Gates Building.

Other talks

Morning Break Morning Tea and Coffee Group Work Group Work Title abstract tbc Tea and Coffee Break
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity