Jakub Konecny (s1355001)
Mon 21 Sep 2015, 12:15 - 13:30
JCMB 6311

If you have a question about this talk, please contact: Jakub Konecny (s1355001)

We study the fundamental limits to communication-efficient distributed methods for convex learning and optimization, under different assumptions on the information available to individual machines, and the types of functions considered. We identify cases where existing algorithms are already worst-case optimal, as well as cases where room for further improvement is still possible. Among other things, our results indicate that without similarity between the local objective functions (due to statistical data similarity or otherwise) many communication rounds may be required, even if the machines have unbounded computational power.