Tensor Decomposition Algorithms via Algebraic Complexity
Centre de recherches mathématiques - CRM via YouTube
Become an AI & ML Engineer with Cal Poly EPaCE — IBM-Certified Training
Python, Prompt Engineering, Data Science — Build the Skills Employers Want Now
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore tensor decomposition algorithms through the lens of algebraic complexity in this 52-minute lecture by Vishwas Bhargava. Delve into the fundamental connections between tensors and special depth 3 arithmetic circuits. Examine both worst-case and average-case algorithms for tensor decomposition, with a focus on a worst-case algorithm for decomposing low-rank tensors and an algebraic adaptation of the classic Jennrich's algorithm. Gain insights from this presentation, part of the Workshop on Tensors: Quantum Information, Complexity and Combinatorics held at the Centre de recherches mathématiques (CRM) in November 2022.
Syllabus
Vishwas Bhargava: Tensor decomposition algorithms via algebraic complexity
Taught by
Centre de recherches mathématiques - CRM