Fetching the paper…
Reading the bibliography…
We propose a novel rank-adaptive higher-order orthogonal iteration (HOOI) algorithm to compute the truncated Tucker decomposition of higher-order tensors with a given error tolerance, and prove that the method is locally optimal and monotonically convergent.
Psychometrika 1
Eckart, C., Young, G.: The approximation of one matrix by another of lower rank · 1936
Earlier work this paper cites.
Psychometrika 31
Tucker, L.R.: Some mathematical notes on three-mode factor analysis · 1966
Earlier work this paper cites.
Psychometrika 45
Kroonenberg, P.M., De Leeuw., J.: Principal component analysis of three-mode data by means of alternating least squares algorithms · 1980
Earlier work this paper cites.
Psychometrika 51
Kapteyn, A., Neudecker, H., Wansbeek, T.: An approach to n n -mode components analysis · 1986
Earlier work this paper cites.
SIAM Journal on Matrix Analysis and Applications 21
De Lathauwer, L., De Moor, B., Vandewalle, J.: A multilinear singular value decomposition · 2000
Earlier work this paper cites.
SIAM Journal on Matrix Analysis and Applications 21
De Lathauwer, L., De Moor, B., Vandewalle, J.: On the best rank-1 and rank- ( r 1 , r 2 , … , r n ) (r_{1},r_{2},...,r_{n}) approximation of higher-order tensors · 2000
Earlier work this paper cites.
Pattern Recognition 40
Savas, B., Eldén, L.: Handwritten digit classification using higher order singular value decomposition · 2007
Earlier work this paper cites.
SIAM Journal on Matrix Analysis and Applications 31
Eldén, L., Savas, B.: A Newton-Grassmann method for computing the best multilinear rank- ( r 1 , r 2 , r 3 ) (r_{1},r_{2},r_{3}) approximation of a tensor · 2009
Earlier work this paper cites.
Numerical Algorithms 51
Ishteva, M., De Lathauwer, L., Absil, P.A., Huffel, S.V.: Differential-geometric Newton method for the best rank- ( r 1 , r 2 , r 3 ) (r_{1},r_{2},r_{3}) approximation of tensors · 2009
Earlier work this paper cites.
SIAM Review 51
Kolda, T.G., Bader, B.W.: Tensor decompositions and applications · 2009
Earlier work this paper cites.
SIAM Journal on Scientific Computing 32
Savas, B., Lim, L.H.: Quasi-Newton methods on Grassmannians and multilinear approximations of tensors · 2009
Earlier work this paper cites.
SIAM Journal on Matrix Analysis and Applications 31
Ishteva, M., Absil, P.A., Van Huffel, S., De Lathauwer, L.: Best low multlinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme · 2011
Cited alongside, same era.
Annals of Physics 326
Schollwöck, U.: The density-matrix renormalization group in the age of matrix product states · 2011
Cited alongside, same era.
Technical Report TW589, Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium (2011)
Vannieuwenhoven, N., Vandebril, R., Meerbergen, K.: On the truncated multilinear singular value decomposition · 2011
Cited alongside, same era.
SIAM Journal on Scientific Computing 34
Vannieuwenhoven, N., Vandebril, R., Meerbergen, K.: A new truncation strategy for the higher-order singular value decomposition · 2012
Cited alongside, same era.
Acta Numerica 23
Hackbusch, W.: Numerical tensor calculus · 2014
Cited alongside, same era.
In: Many-Electron Approaches in Physics, Chemistry and Mathematics, pp. 53–76. Springer (2014)
In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, pp. 761–770. ACM (2017)
Oh, J., Shin, K., E.Papalexakis, E., Faloutsos, C., Yu, H.: S-HOT: Scalable high-order Tucker decomposition · 2017
Later among the works it cites.
arXiv preprint arXiv:1811.10573 (2018)
Ma, L., Solomonik, E.: Accelerating alternating least squares for tensor decomposition by pairwise perturbation · 2018
Later among the works it cites.
Advances in Neural Information Processing Systems 31
Malik, O.A., Becker, S.: Low-rank Tucker decomposition of large tensors using tensorsketch · 2018
Later among the works it cites.
In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 1120–1131. IEEE (2018)
Oh, S., Park, N., Lee, S., Kang, U.: Scalable Tucker factorization for sparse tensors-algorithms and discoveries · 2018
Later among the works it cites.
Advances in Computational Mathematics 45
Che, M., Wei, Y.: Randomized algorithms for the approximations of Tucker and the tensor train decompositions · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Legeza, Ö., Rohwedder, T., Schneider, R., Szalay, S.: Tensor product approximation (DMRG) and coupled cluster method in quantum chemistry · 2014
Cited alongside, same era.
In: IEEE International Parallel and Distributed Processing Symposium, pp. 912–922. IEEE (2016)
Austin, W., Ballard, G., Kolda, T.G.: Parallel tensor compression for large-scale scientific data · 2016
Cited alongside, same era.
Foundations and Trends in Machine Learning 9
Cichocki, A., Lee, N., Oseledets, I., Phan, A.H., Zhao, Q., Mandic, D.P.: Tensor networks for dimensionality reduction and large-scale optimization: Part 1 low-rank tensor decompositions · 2016
Cited alongside, same era.
SIAM Journal on Scientific Computing 38
Etter, S.: Parallel ALS algorithm for solving linear systems in the hierarchical Tucker representation · 2016
Cited alongside, same era.
Vervliet, N., Debals, O., Sorber, L., Barel, M.V., Lathauwer, L.D.: MATLAB Tensorlab 3.0 · 2016
Cited alongside, same era.
arXiv preprint arXiv:1708.09165 (2017)
Cichocki, A., Phan, A.H., Zhao, Q., Lee, N., Oseledets, I.V., Sugiyama, M., Mandic, D.: Tensor networks for dimensionality reduction and large-scale optimizations: Part 2 applications and future perspectives · 2017
Cited alongside, same era.
URL http://yann.lecun.com/exdb/mnist/
LeCun, Y., Cortes, C., Burges, C.: The MNIST database of handwritten digits
Cited in the paper.
Later among the works it cites.
IEEE Transactions on Parallel and Distributed Systems 30
Oh, S., Park, N., Jang, J., Sael, L., Kang, U.: High-performance Tucker factorization on heterogeneous platforms · 2019
Later among the works it cites.
ACM Transactions on Mathematical Software (TOMS) 46
Ballard, G., Klinvex, A., Kolda, T.G.: TuckerMPI: A parallel C++/MPI software package for large-scale data compression via the Tucker tensor decomposition · 2020
Later among the works it cites.
SIAM Journal on Mathematics of Data Science 2
Minster, R., Saibaba, A.K., Kilmer, M.E.: Randomized algorithms for low-rank tensor decompositions in the Tucker format · 2020
Later among the works it cites.
IEEE Access 9
Ahmadi-Asl, S., Abukhovich, S., Asante-Mensah, M.G., Cichocki, A., Phan, A.H., Tanaka, T., Oseledets, I.: Randomized algorithms for computation of Tucker decomposition and higher order SVD (HOSVD) · 2021
Closest in time.
SIAM Journal on Scientific Computing 43
Ehrlacher, V., Grigori, L., Lombardi, D., Song, H.: Adaptive hierarchical subtensor partitioning for tensor compression · 2021
Closest in time.
arXiv preprint arXiv:2104.01101 (2021)
Ma, L., Solomonik, E.: Fast and accurate randomized algorithms for low-rank tensor decompositions · 2021
Closest in time.