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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹ️ Information

On combinatorial testing problems

Download to your calendar using vCal

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

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lecture Theatre 1, Department of Chemical Engineering and Biotechnology, West Cambridge Site West Cafe, 3 Charles Babbage Road, Cambridge, CB3 0GT McGrath Centre, St Catharine’s College & online

Other talks

EVERSE Research Software Quality Kit title abstract tba Strange New Worlds The Importance of Teaching about Science and Religion in a Time of Global Uncertainty Max Perutz Lecture - Title TBC Synthesizing Diverse Policies for Multi-Agent Coordination
 

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