activity
20202026
most citedRobust approximation of tensor networks: application to grid-free tensor factorization of the Coulomb interaction

27 citations · 38 across the 6 of their papers we have counts for

collaborators
Showing math.NAShow all

1 paper · 1 filter

math.NA2026

Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition

Israa Fakih, Laura Grigori, Karl Pierce

We present a novel leverage score-based sampling strategy for the randomized alternating least squares optimization (ALS) of the canonical polyadic decomposition (CPD-ALS). Unlike…