Metraipolis › archive › dc_3b05747ca511

An Efficient Randomized Hierarchical Tucker Decomposition — arXiv:2610.41554

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41554
License (as archived)
CC0-1.0
Archived
2026-11-02T04:59:28.632Z
SHA-256 of the archived text
812662f715b11b6e8867c460a5605a1089790fa63691b2b63869502d269d6a5c
Stable URL of this page
https://metraipolis.com/documento/dc_3b05747ca511

How to cite

An Efficient Randomized Hierarchical Tucker Decomposition — arXiv:2610.41554 — arXiv (en), https://arxiv.org/abs/2610.41554 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3b05747ca511 (Metraipolis archive dc_3b05747ca511, sha256 812662f715b11b6e8867c460a5605a1089790fa63691b2b63869502d269d6a5c)
BibTeX
@misc{dc3b05747ca511,
  title = {An Efficient Randomized Hierarchical Tucker Decomposition — arXiv:2610.41554},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41554},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3b05747ca511; sha256 812662f715b11b6e8867c460a5605a1089790fa63691b2b63869502d269d6a5c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41554. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We introduce randomized algorithms for computing the hierarchical Tucker decomposition of high-order tensors. Unlike traditional algorithms performed in a sequential leaves-to-root direction, our algorithms traverse the dimension tree in a root-to-leaves direction, leveraging randomized sequential projections to accelerate the computation of intermediate subspaces. This strategy can reduce the computation time by an order of magnitude relative to prior randomized algorithms using the leaves-to-root direction, while guaranteeing quasi-optimal approximation. Although the theoretical error bound is slightly larger than for leaves-to-root methods, in all our experiments the practical error adheres to the classic bound. Our results highlight the method's potential for scalable tensor decompositions in high-dimensional data analysis.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2610.41554 — 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-11-02T04:47:42.616Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).