In this lecture, we introduce and motivate the main characters in this plot:
- Singularity of symbolic matrices: a basic problem in both computational complexity.
- Alternating Minimization: a basic heuristic in non-convex optimization.
I will explain how variants of this algorithm are applied to variants of this problem, how they are analyzed, and how the analysis gives rise to problems in quantum information theory, non-commutative algebra and invariant theory.
Speaker: Avi Wigderson, UC Berkeley
Contact:Website: Click to Visit
Save this Event:iCalendar
Windows Live Calendar