9 citations · 10 across the 7 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
Simple and Nearly-Optimal Sampling for Rank-1 Tensor Completion via Gauss-Jordan
Alejandro Gomez-Leos, Oscar López
We revisit the sample and computational complexity of completing a rank-1 tensor in , given a uniformly sampled subset of its entries. We present…
cs.IT2024
The Average Spectrum Norm and Near-Optimal Tensor Completion
Oscar López, Richard Lehoucq, Carlos Llosa-Vite +2
We introduce a new tensor norm, the average spectrum norm, to study sample complexity of tensor completion problems based on the canonical polyadic decomposition (CPD). Properties…