University of Cambridge > Talks.cam > Statistics > Computationally Efficient Nonparametric Testing

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

Computationally Efficient Nonparametric Testing

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

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

A recent trend of big data problems is to develop computationally efficient inferential methods that embed computational thinking into uncertainty quantification. In this talk I will introduce two new classes of nonparametric testing that scale well with large datasets. One class is based on randomized sketches which can be implemented in one computer, while the other class requires parallel computing. Our theoretical contribution is to characterize the minimal computational cost that is needed to achieve testing optimality. The proposed methods are examined by simulated and real datasets.

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.

Other lists

machine learning Cambridge Area Sequencing Informatics Meeting VI (2014) talks Perspectives from Cambridge Assessment Clare Hall Colloquium

Other talks

Rhys Jones: Temporal Claustrophobia at the Continental Congress, 1774-1776 Calcium signalling in bipolar disorder - new twists to an old story A unifying theory of branching morphogenesis Surface meltwater ponding and drainage causes ice-shelf flexure
 

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