University of Cambridge > Talks.cam > Statistics > On combinatorial testing problems

On combinatorial testing problems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact rbg24.

In this joint work with Luc Devroye, Louigi Addario-Berry and Nicolas Broutin, we study a class of hypothesis testing problems in which, upon observing the realization of an n-dimensional Gaussian vector, one has to decide whether the vector was drawn from a standard normal distribution or, alternatively, whether there is a subset of the components belonging to a certain given class of sets whose elements have been ?contaminated,? that is, have a mean different from zero. We establish some general conditions under which testing is possible and others under which testing is hopeless with a small risk. The combinatorial and geometric structure of the class of sets is shown to play a crucial role. The bounds are illustrated on various examples.

http://www.barcelonagse.eu/Faculty.php?id=129

This talk is part of the Statistics series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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