Kareem Aggour

Adaptive Sketching for Fast and Convergent Canonical Polyadic Decomposition

This work considers the canonical polyadic decomposition (CPD) of tensors using proximally regularized sketched alternating least squares algorithms. First, it establishes a sublinear rate of convergence for proximally regularized sketched CPD algorithms under two natural conditions that are known t…