Deterministic tensor completion using hypergraph expanders with linear sample complexity.
problem Low-rank tensor recovery with minimal samples.
method Minimizing max-quasinorm of tensors using hypergraph expanders.
result Deterministic analysis shows linear sample complexity for tensor recovery.