The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
Abstract
Recent achievements in the field of tensor product approximation provide promising new formats for the representation of tensors in form of tree tensor networks. In contrast to the canonical r-term representation (CANDECOMP, PARAFAC), these new formats provide stable representations, while the amount of required data is only slightly larger. The tensor train (TT) format [SIAM J. Sci. Comput., 33 (2011), pp. 2295–2317], a simple special case of the hierarchical Tucker format [J. Fourier Anal. Appl., 5 (2009), p. 706], is a useful prototype for practical low-rank tensor representation. In this article, we show how optimization tasks can be treated in the TT format by a generalization of the well-known alternating least squares (ALS) algorithm and by a modified approach (MALS) that enables dynamical rank adaptation. A formulation of the component equations in terms of so-called retraction operators helps to show that many structural properties of the original problems transfer to the micro-iterations, giving what is to our knowledge the first stable generic algorithm for the treatment of optimization tasks in the tensor format. For the examples of linear equations and eigenvalue equations, we derive concrete working equations for the micro-iteration steps; numerical examples confirm the theoretical results concerning the stability of the TT decomposition and of ALS and MALS but also show that in some cases, high TT ranks are required during the iterative approximation of low-rank tensors, showing some potential of improvement.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Density matrix formulation for quantum renormalization groups
White, S. R. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2863 · Cited by 7,702
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
Some Mathematical Notes on Three-Mode Factor Analysis
Tucker, L. R. (1966) · Psychometrika · doi:10.1007/bf02289464 · Cited by 3,492
The density-matrix renormalization group
Schollwöck, U. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.259 · Cited by 3,323
Oseledets, I. V. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090752286 · Cited by 2,636
The multi-configurational time-dependent Hartree approach
Meyer, H.-D., Manthe, U., & Cederbaum, L. S. (1990) · Chemical Physics Letters · doi:10.1016/0009-2614(90)87014-i · Cited by 2,013
Schmidt, E. (1907) · Mathematische Annalen · doi:10.1007/bf01449770 · Cited by 973
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
de Silva, V., & Lim, L.-H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/06066518x · Cited by 927
Principal Component Analysis of Three-Mode Data by Means of Alternating Least Squares Algorithms
Kroonenberg, P. M., & de Leeuw, J. (1980) · Psychometrika · doi:10.1007/bf02293599 · Cited by 724
Hierarchical Singular Value Decomposition of Tensors
Grasedyck, L. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090764189 · Cited by 508
A New Scheme for the Tensor Representation
Hackbusch, W., & Kühn, S. (2009) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-009-9094-9 · Cited by 453
Algorithms for Numerical Analysis in High Dimensions
Beylkin, G., & Mohlenkamp, M. J. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/040604959 · Cited by 352
Dynamical Tensor Approximation
Koch, O., & Lubich, C. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/09076578x · Cited by 131
Complete-graph tensor network states: A new fermionic wave function ansatz for molecules
Marti, K. H., Bauer, B., Reiher, M., Troyer, M., & Verstraete, F. (2010) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000159263 · Cited by 93
Complete-graph tensor network states: a new fermionic wave function ansatz for molecules
Marti, K. H., Bauer, B., Reiher, M., Troyer, M., & Verstraete, F. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/10/103008 · Cited by 87
An error analysis of the multi-configuration time-dependent Hartree method of quantum dynamics
Conte, D., & Lubich, C. (2010) · ESAIM Mathematical Modelling and Numerical Analysis · doi:10.1051/m2an/2010018 · Cited by 48
Cited by
A literature survey of low‐rank tensor approximation techniques
Grasedyck, L., Kressner, D., & Tobler, C. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310004 · Cited by 577
Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
Bengua, J. A., Phien, H. N., Tuan, H. D., & Do, M. N. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2672439 · Cited by 461
Tensor product methods and entanglement optimization for ab initio quantum chemistry
Szalay, S., Pfeffer, M., Murg, V., Barcza, G., Verstraete, F., Schneider, R., & Legeza, Ö. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24898 · Cited by 314
Self-citationBaiardi, A., & Reiher, M. (2020) · The Journal of Chemical Physics · doi:10.1063/1.5129672 · Cited by 306
Zhao, Q., Zhou, G., Xie, S., Zhang, L., & Cichocki, A. S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.05535 · Cited by 284
Metadata
- Authors
- Holtz, S., Rohwedder, T., & Schneider, R.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2012-01
- Volume
- 34
- Issue
- 2
- Pages
- A683-A713
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2031216664
- Cited by
- 337
- References
- 17
- FWCI
- 7.82
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.