Talks
Fall 2021
![](https://old.simons.berkeley.edu/sites/default/files/styles/workshop_main/public/computational_complexity_of_statistical_inference.png?itok=OwVi7LzF)
How Close To Optimal Sample Complexity Does Gradient Descent Get In Phase Retrieval?
Tuesday, October 12th, 2021, 9:00 am–9:45 am
Speaker:
Lenka Zdeborová (École polytechnique fédérale de Lausanne)
Location:
Calvin Lab Auditorium