Polynomial-Time Power-Sum Decomposition of Polynomials - Efficient Algorithms and Applications

Polynomial-Time Power-Sum Decomposition of Polynomials - Efficient Algorithms and Applications

Centre de recherches mathématiques - CRM via YouTube Direct link

Main Prior Works

5 of 18

5 of 18

Main Prior Works

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Polynomial-Time Power-Sum Decomposition of Polynomials - Efficient Algorithms and Applications

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Why Study Power Sums?
  3. 3 Tensor Decomposition with Symmetries
  4. 4 Decomposing Generic Polynomials
  5. 5 Main Prior Works
  6. 6 Application: Mixture of Gaussians
  7. 7 GHK Approach
  8. 8 Algorithm Outline
  9. 9 Span Finding
  10. 10 Outline of Algorithm
  11. 11 Noise Resilience
  12. 12 Rest of the talk
  13. 13 Linear Dependencies of V
  14. 14 Singular Value Lower Bounds
  15. 15 Trace Moment Method
  16. 16 Example: Gaussian Matrix
  17. 17 Graph Matrices
  18. 18 Summary of the talk

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.