Fetching the paper…
Reading the bibliography…
The alternating least squares algorithm for CP and Tucker decomposition is dominated in cost by the tensor contractions necessary to set up the quadratic optimization subproblems.
Lineare Scharen orthogonaler Matrizen
J. Radon · 1922
Earlier work this paper cites.
The expression of a tensor or a polyadic as a sum of products
F. L. Hitchcock · 1927
Earlier work this paper cites.
Vector fields on spheres
J. F. Adams · 1962
Earlier work this paper cites.
On matrices whose real linear combinations are nonsingular
J. F. Adams, P. D. Lax, and R. S. Phillips · 1965
Earlier work this paper cites.
Some mathematical notes on three-mode factor analysis
L. R. Tucker · 1966
Earlier work this paper cites.
Analysis of individual differences in multidimensional scaling via an N-way generalization of Eckart-Young decomposition
J. D. Carroll and J.-J. Chang · 1970
Earlier work this paper cites.
Foundations of the PARAFAC procedure: models and conditions for an explanatory multimodal factor analysis
R. A. Harshman · 1970
Earlier work this paper cites.
ScaLAPACK User’s Guide
L. S. Blackford, J. Choi, A. Cleary, E. D’Azeuedo, J. Demmel, I. Dhillon, S. Hammarling, G. Henry, A. Petitet, K. Stanley, D. Walker, and R. C. Whaley · 1997
Earlier work this paper cites.
Improving the speed of multi-way algorithms: Part I. Tucker3
C. A. Andersson and R. Bro · 1998
Earlier work this paper cites.
A multilinear singular value decomposition
L. De Lathauwer, B. De Moor, and J. Vandewalle · 2000
Earlier work this paper cites.
On the best rank-1 and rank-(r1, r2,…, rn) approximation of higher-order tensors
L. De Lathauwer, B. De Moor, and J. Vandewalle · 2000
Earlier work this paper cites.
Singular values and eigenvalues of tensors: a variational approach
L.-H. Lim · 2005
Earlier work this paper cites.
Matlab tensor toolbox
T. G. Kolda and B. W. Bader · 2006
Earlier work this paper cites.
Kronecker product approximation for preconditioning in three-dimensional imaging applications
J. G. Nagy and M. E. Kilmer · 2006
Earlier work this paper cites.
Enhanced line search: a novel method to accelerate PARAFAC
M. Rajih, P. Comon, and R. A. Harshman · 2008
Earlier work this paper cites.
Tensor decompositions and applications
T. G. Kolda and B. W. Bader · 2009
Earlier work this paper cites.
Breaking the curse of dimensionality, or how to use SVD in many dimensions
I. V. Oseledets and E. E. Tyrtyshnikov · 2009
Earlier work this paper cites.
A scalable optimization approach for fitting canonical tensor decompositions
E. Acar, D. M. Dunlavy, and T. G. Kolda · 2011
Earlier work this paper cites.
Tensor spaces and numerical tensor calculus
W. Hackbusch · 2012
Earlier work this paper cites.
Tensor hypercontraction density fitting. I. Quartic scaling second- and third-order Møller-Plesset perturbation theory
E. G. Hohenstein, R. M. Parrish, and T. J. Martínez · 2012
Earlier work this paper cites.
Communication: Tensor hypercontraction. III. Least-squares tensor hypercontraction for the determination of correlated wavefunctions, 2012
E. G. Hohenstein, R. M. Parrish, C. D. Sherrill, and T. J. Martínez · 2012
Cited alongside, same era.
A new truncation strategy for the higher-order singular value decomposition
N. Vannieuwenhoven, R. Vandebril, and K. Meerbergen · 2012
Cited alongside, same era.
Tensor representation techniques in post-Hartree–Fock methods: matrix product state tensor format
U. Benedikt, H. Auer, M. Espig, W. Hackbusch, and A. A. Auer · 2013
Cited alongside, same era.
On best rank one approximation of tensors
S. Friedland, V. Mehrmann, R. Pajarola, and S. K. Suter · 2013
Cited alongside, same era.
A literature survey of low-rank tensor approximation techniques
L. Grasedyck, D. Kressner, and C. Tobler · 2013
Cited alongside, same era.
Most tensor problems are NP-hard
High performance parallel algorithms for the Tucker decomposition of sparse tensors
O. Kaya and B. Uçar · 2016
Later among the works it cites.
Spatial distributions of local illumination color in natural scenes
S. M. Nascimento, K. Amano, and D. H. Foster · 2016
Later among the works it cites.
On optimizing distributed Tucker decomposition for dense tensors
V. T. Chakaravarthy, J. W. Choi, D. J. Joseph, X. Liu, P. Murali, Y. Sabharwal, and D. Sreedhar · 2017
Later among the works it cites.
Shared memory parallelization of MTTKRP for dense tensors
K. Hayashi, G. Ballard, J. Jiang, and M. Tobia · 2017
Later among the works it cites.
Low rank factorization of the Coulomb integrals for periodic coupled cluster theory
F. Hummel, T. Tsatsoulis, and A. Grüneis · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. J. Hillar and L.-H. Lim · 2013
Cited alongside, same era.
Computations in quantum tensor networks
T. Huckle, K. Waldherr, and T. Schulte-Herbrüggen · 2013
Cited alongside, same era.
Tensor completion for estimating missing values in visual data
J. Liu, P. Musialski, P. Wonka, and J. Ye · 2013
Cited alongside, same era.
Fast alternating LS algorithms for high order CANDECOMP/PARAFAC tensor factorizations
A.-H. Phan, P. Tichavskỳ, and A. Cichocki · 2013
Cited alongside, same era.
Tensor decompositions for learning latent variable models
A. Anandkumar, R. Ge, D. J. Hsu, S. M. Kakade, and M. Telgarsky · 2014
Cited alongside, same era.
Nonnegative tensor decomposition
N. Hao, L. Horesh, and M. Kilmer · 2014
Cited alongside, same era.
A practical introduction to tensor networks: Matrix product states and projected entangled pair states
R. Orús · 2014
Cited alongside, same era.
O. Kaya · 2017
Later among the works it cites.
Model-driven sparse CP decomposition for higher-order tensors
J. Li, J. Choi, I. Perros, J. Sun, and R. Vuduc · 2017
Later among the works it cites.
Nesterov-based alternating optimization for nonnegative tensor factorization: algorithm and parallel implementation
A. P. Liavas, G. Kostoulas, G. Lourakis, K. Huang, and N. D. Sidiropoulos · 2017
Later among the works it cites.
HPTT: a high-performance tensor transposition C++ library
P. Springer, T. Su, and P. Bientinesi · 2017
Later among the works it cites.
Parallel nonnegative CP decomposition of dense tensors
G. Ballard, K. Hayashi, and R. Kannan · 2018
Closest in time.
Communication lower bounds for matricized tensor times Khatri-Rao product
G. Ballard, N. Knight, and K. Rouse · 2018
Closest in time.
A practical randomized CP tensor decomposition
C. Battaglino, G. Ballard, and T. G. Kolda · 2018
Closest in time.
High-performance dense Tucker decomposition on GPU clusters
J. Choi, X. Liu, and V. Chakaravarthy · 2018
Closest in time.
Approximate tensor-product preconditioners for very high order discontinuous Galerkin methods
W. Pazner and P.-O. Persson · 2018
Closest in time.
PySCF: the Python-based simulations of chemistry framework
Q. Sun, T. C. Berkelbach, N. S. Blunt, G. H. Booth, S. Guo, Z. Li, J. Liu, J. D. McClain, E. R. Sayfutyarova, S. Sharma, et al · 2018
Closest in time.
Computing dense tensor decompositions with optimal dimension trees
O. Kaya and Y. Robert · 2019
Closest in time.
The dynamics of swamps in the canonical tensor approximation problem
M. J. Mohlenkamp · 2019
Closest in time.
Array programming with NumPy
C. R. Harris, K. J. Millman, S. J. van der Walt, R. Gommers, P. Virtanen, D. Cournapeau, E. Wieser, J. Taylor, S. Berg, N. J. Smith, R. Kern, M. Picus, S. Hoyer, M. H. van Kerkwijk, M. Brett, A. Haldane, J. F. del R’ıo, M. Wiebe, P. Peterson, P. G’erard-Marchant, K. Sheppard, T. Reddy, W. Weckesser, H. Abbasi, C. Gohlke, and T. E. Oliphant · 2020
Closest in time.
Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree
L. Ma and E. Solomonik · 2020
Closest in time.