A literature survey of low‐rank tensor approximation techniques
By Lars Grasedyck, Daniel Kressner, Christine Tobler. 2013
719 citations recorded by the source corpus.
During the last years, low‐rank tensor approximation has been established as a new tool in scientific computing to address large‐scale linear and multilinear algebra problems, which would be intractable by classical techniques. This survey attempts to give a literature overview of current developments in this area, with an emphasis on function‐related tensors. (© 2013 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Subfields: Computational Mathematics, Computational Theory and Mathematics, Mathematical Optimization, Numerical Methods & Scientific Computing
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mathematics
- Andrzej S. Cichocki
- Ivan V. Oseledets
- Dmitry V. Savostyanov
- Qibin Zhao
- Boris N. Khoromskij
- Anh Huy Phan
- Christine Tobler
- Daniel Kressner
In Computational Theory and Mathematics
- Dmitry V. Savostyanov
- Andrzej S. Cichocki
- Ivan V. Oseledets
- V. Dolgov
- Boris N. Khoromskij
- Qibin Zhao
- Anh Huy Phan
- Bart Vandereycken
In Mathematical Optimization
- Dmitry V. Savostyanov
- Daniel Kressner
- Zeyuan Allen-Zhu
- Bart Vandereycken
- V. Dolgov
- Qibin Zhao
- Andrzej S. Cichocki
- Guoxu Zhou
In Numerical Methods & Scientific Computing
- Dmitry V. Savostyanov
- Ivan V. Oseledets
- Andrzej S. Cichocki
- V. Dolgov
- Jimeng Sun
- Bart Vandereycken
- Qibin Zhao
- Daniel Kressner
Citations in the corpus
- LoRA: Low-Rank Adaptation of Large Language Models (2021, background): “A lot of machine learning problems have certain intrinsic low-rank structure [7, 13, 23, 24].”
- Tensorial Neural Networks: Generalization of Neural Networks and Application to Model Compression (2018, methodology): “Different from existing tensor networks, (1) our TNNs have nonlinearity on the edges between the tensors; and (2) TNNs are constructed as deep compositions of interleaving generalized tensor operations and nonlinear transformations, similar to feedforward neural networks.”
- Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions (2013, neutral): “Tensor product methods [36, 33, 19, 18] are promising for the problems of high dimension.”
- Broad Learning System: An Effective and Efficient Incremental Learning System Without the Need for Deep Architecture (2018, background): “In [33] and [34], comprehensive exposition of the theory, algorithms, and applications of structured low-rank approximations are presented.”
- ALTERNATING MINIMAL ENERGY METHODS FOR LINEAR SYSTEMS IN HIGHER DIMENSIONS∗ (2014, methodology): “Tensor product methods [36, 33, 19, 18] are promising for the problems of high dimension.”
- Approximation rates for the hierarchical tensor format in periodic Sobolev spaces (2014, neutral): “For a literature survey see [16].”
- DeepMon: Mobile GPU-based Deep Learning Framework for Continuous Vision Applications (2017, methodology): “Restructuring DNN models has been widely studied to reduce the size of the model and accelerate the inference speed [18, 23, 29, 32, 34, 45].”
- Low-rank tensor completion by Riemannian optimization (2014, background): “Manifold structure for low-rank tensors has recently been exploited in a number of works targeting applications in numerical analysis and computational physics, see [12] for an overview.”
- T-Basis: a Compact Representation for Neural Networks (2020, background): “Tensor Networks (TNs) with various network structures, like MPS, PEPS and MERA, have been proposed in the literature – we refer the reader to (Orús, 2019; Grasedyck et al., 2013) for an overview.”
- Tensors for Data Mining and Data Fusion (2016, neutral): “Subsequently, more survey papers have been published, some of them focusing on the applications [Acar and Yener 2009] and some on the algorithms [Cichocki et al. 2009; Lu et al. 2011; Grasedyck et al. 2013; Cichocki et al. 2015].”
- TensorLy: Tensor Learning in Python (2016, background): “The interested reader is referred to several surveys in the topic, which focus range from basics of multilinear (tensor) algebra and overview of different established tensor decompositions [17, 29], to algorithmic advances [7, 19, 10, 6, 26] and applications [1].”
- Tensor Decompositions for Signal Processing Applications: From two-way to multiway component analysis (2014, background): “…data into easy to interpret components (i.e., the rank-1 terms), while the goal of unconstrained Tucker decompositions is most often to compress data into a tensor of smaller size (i.e., the core tensor) or to find the subspaces spanned by the fibers (i.e., the column spaces of the factor matrices).”
- HiCOO: Hierarchical Storage of Sparse Tensors (2018, background): “These factors may then be interpreted to discover some property of the underlying data, or perhaps exploit it for some task (such as compression [26, 27]).”
- Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives (2017, background): “The related optimization problems often involve structured matrices and vectors with over a billion entries (see (Grasedyck et al., 2013; Dolgov, 2014; Garreis and Ulbrich, 2017; Stoudenmire and Schwab, 2016; Hubig et al., 2017) and references therein).”
- Low-rank solvers for unsteady Stokes–Brinkman optimal control problem with random data (2016, neutral): “Hence, a convenient way to characterize the uncertainty in the problem consists in incorporating9 the uncertain parameters as random variables or space- and/or time-varying random fields.10 In fluid mechanics, for example, the cost functionals in optimization problems are expressed in terms11 of…”