BARC talk by Yuval Efron
Wednesday, 1 September 2021, Yuval Efron, Ph.D. student at the University of Toronto in Canada, will give a talk on "Hardness of Distributed Optimization".
Hardness of Distributed Optimization
Finding exact solutions to many fundamental optimization problems is known to be a hard task in the distributed CONGEST model of computation. A natural relaxation then is to look for approximate solutions. In this talk, he will present recent works from PODC19 and PODC20 regarding distributed lower bounds in the CONGEST model. Along the way, Ihe will present the main and standard framework for proving CONGEST lower bounds via communication complexity. No prior background in distributed computing is assumed.
Based on joint works with Nir Bachrach, Keren Censor-Hillel, Michal Dory, Ofer Grossman, Seri Khoury, Dean Leitersdorf and Ami Paz.
Yuval Efron is a Ph.D. student at the University of Toronto, moving soon to Columbia University with my advisor, Prof. Toni Pitassi. He did both B.Sc. and M.Sc. at the Technion-Israel Institute of Technology, under the supervision of Prof. Keren Censor-Hillel.