Extrapolated Alternating Algorithms For Approximate Canonical Polyadic Decomposition

This video program is a part of the Premium package:

Extrapolated Alternating Algorithms For Approximate Canonical Polyadic Decomposition


  • IEEE MemberUS $11.00
  • Society MemberUS $0.00
  • IEEE Student MemberUS $11.00
  • Non-IEEE MemberUS $15.00
Purchase

Extrapolated Alternating Algorithms For Approximate Canonical Polyadic Decomposition

0 views
  • Share
Create Account or Sign In to post comments
Tensor decompositions have become a central tool in machine learning to extract interpretable patterns from multiway arrays of data. However, computing the approximate Canonical Polyadic Decomposition (aCPD), one of the most important tensor decomposition
Tensor decompositions have become a central tool in machine learning to extract interpretable patterns from multiway arrays of data. However, computing the approximate Canonical Polyadic Decomposition (aCPD), one of the most important tensor decomposition