Entrywise tensor-train approximation of large tensors via random embeddings
<|reference_start|>Entrywise tensor-train approximation of large tensors via random embeddings: The theory of low-rank tensor-train approximation is well-understood when the approximation error is measured in the Frobenius norm. The entrywise maximum norm is equally important but is significantly weaker for large tensors, making the estimates obtained via the Frobenius norm and norm equivalence pessimistic or even meaningless. In this article, we derive a direct estimate of the entrywise approximation error that is applicable in some of these cases. The estimate is given in terms of the higher-order generalization of the matrix factorization norm, and its proof is based on the tensor-structured Hanson-Wright inequality. The theoretical results are accompanied with numerical experiments carried out with the method of alternating projections.<|reference_end|>
@article{budzinskiy2024entrywise,
    title={Entrywise tensor-train approximation of large tensors via random
  embeddings},
    author={Stanislav Budzinskiy},
    journal={arXiv preprint arXiv:2403.11768},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.11768},
    primaryClass={math.NA cs.NA math.PR}
}