Computationally Efficient Nonparametric Testing

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

• Guang Cheng (Purdue)
• Friday 26 May 2017, 16:00-17:00
• MR12, Centre for Mathematical Sciences, Wilberforce Road, Cambridge..

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge talks
• Chris Davis' list
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Guy Emerson's list
• Hanchen DaDaDash
• Interested Talks
• MR12, Centre for Mathematical Sciences, Wilberforce Road, Cambridge.
• Machine Learning
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Statistics
• Statistics Group
• bld31
• custom
• rp587

Note that ex-directory lists are not shown.