Metraipolis › archive › dc_2d90eee5c173
Worst-Case Completion of Tensors with Approximately Few ANOVA Terms — arXiv:2609.38749
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.38749
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T14:17:01.540Z
- SHA-256 of the archived text
09491554ee1cdb84c7e93b262874a07bd481bc2e7c0fe843ec30c3fecd3ec87a- Stable URL of this page
https://metraipolis.com/documento/dc_2d90eee5c173
How to cite
Worst-Case Completion of Tensors with Approximately Few ANOVA Terms — arXiv:2609.38749 — arXiv (en), https://arxiv.org/abs/2609.38749 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2d90eee5c173 (Metraipolis archive dc_2d90eee5c173, sha256 09491554ee1cdb84c7e93b262874a07bd481bc2e7c0fe843ec30c3fecd3ec87a)
BibTeX
@misc{dc2d90eee5c173,
title = {Worst-Case Completion of Tensors with Approximately Few ANOVA Terms — arXiv:2609.38749},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.38749},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2d90eee5c173; sha256 09491554ee1cdb84c7e93b262874a07bd481bc2e7c0fe843ec30c3fecd3ec87a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38749. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this article, the problem of completing a tensor from some incomplete knowledge of its entries is treated by adopting a worst-case perspective, given the realistic assumption that the tensor's low-order ANOVA terms are dominant. We survey and leverage some recent all-purpose results from the field of Optimal Recovery to provide solutions on a theoretical level. But the accompanying constructions of optimal completion procedures, which often feature semidefinite programs, are not directly applicable in the tensor case due to the huge dimensions involved. To resolve the issue, we put forward a storage-friendly way to produce low-order ANOVA projections based on the fast Fourier transform (FFT), while exploiting the specificities of the completion problem to efficiently compute regularizers and extremal eigenvalues. Numerical experiments on synthetic tensors and real-world datasets demonstrate the accuracy and scalability of our FFT-based method. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.NA). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2609.38749 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T14:04:46.015Z dalla pagina https://arxiv.org/catchup/math.NA/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).