Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format (2309.02877v2)

Published 6 Sep 2023 in math.NA and cs.NA

Abstract: The Nystr\"om method offers an effective way to obtain low-rank approximation of SPD matrices, and has been recently extended and analyzed to nonsymmetric matrices (leading to the generalized Nystr\"om method). It is a randomized, single-pass, streamable, cost-effective, and accurate alternative to the randomized SVD, and it facilitates the computation of several matrix low-rank factorizations. In this paper, we take these advancements a step further by introducing a higher-order variant of Nystr\"om's methodology tailored to approximating low-rank tensors in the Tucker format: the multilinear Nystr\"om technique. We show that, by introducing appropriate small modifications in the formulation of the higher-order method, strong stability properties can be obtained. This algorithm retains the key attributes of the generalized Nystr\"om method, positioning it as a viable substitute for the randomized higher-order SVD algorithm.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Alberto Bucci (5 papers)
  2. Leonardo Robol (40 papers)
Citations (3)