On the fundamental understanding of distributed computation

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

• Botond Szabó, University of Leiden
• Friday 15 February 2019, 16:00-17:00
• MR12.

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

In recent years, the amount of available information has become so vast in certain fields of applications that it is infeasible or undesirable to carry out all the computations on a single server. This has motivated the design and study of distributed statistical or learning approaches. In distributed methods, the data is split amongst different administrative units and computations are carried out locally in parallel to each other. The outcome of the local computations are then aggregated into a final result on a central machine.

In this talk we will consider the limitations and guarantees of distributed methods under communication constraints (i.e. only limited amount of bits are allowed to be transmitted between the machines) in context of the random design regression model. We derive minimax lower bounds, matching upper bounds and provide adaptive estimators reaching these limits.

This is a joint work with Harry van Zanten.

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
• Machine Learning
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Statistics
• Statistics Group
• bld31
• custom
• rp587

Note that ex-directory lists are not shown.