In this talk we will see recent optimization based algorithms for the null-cone problem and the orbit closure intersection problem for the left-right action, and how these problems from invariant theory relate to a Polynomial Identity Testing for a restricted class of arithmetic circuits.
Joint work with Zeyuan-Allen Zhu, Ankit Garg, Yuanzhi Li and Avi Wigderson.
This video was produced by the International Centre for Physical Sciences, forming part of the Workshop on Algebraic Complexity Theory.
