Fetching the paper…
Reading the bibliography…
The popular Alternating Least Squares (ALS) algorithm for tensor decomposition is efficient and easy to implement, but often converges to poor local optima---particularly when the weights of the factors are non-uniform.
Foundations of the parafac procedure: Models and conditions for an” explanatory” multi-modal factor analysis
Richard A Harshman · 1970
Earlier work this paper cites.
Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
Joseph B Kruskal · 1977
Earlier work this paper cites.
Tensor rank is NP-Complete
Johan Håstad · 1990
Earlier work this paper cites.
A decomposition for three-way arrays
SE Leurgans, RT Ross, and RB Abel · 1993
Earlier work this paper cites.
Placing search in context: The concept revisited
Lev Finkelstein, Evgeniy Gabrilovich, Yossi Matias, Ehud Rivlin, Zach Solan, Gadi Wolfman, and Eytan Ruppin · 2001
Earlier work this paper cites.
Rank-one approximation to high order tensors
Tong Zhang and Gene H Golub · 2001
Earlier work this paper cites.
A link between the canonical decomposition in multilinear algebra and simultaneous matrix diagonalization
Lieven De Lathauwer · 2006
Earlier work this paper cites.
Efficient MATLAB computations with sparse and factored tensors
Brett W. Bader and Tamara G. Kolda · 2007
Earlier work this paper cites.
Tensor decompositions, alternating least squares and other tales
Pierre Comon, Xavier Luciani, and André LF De Almeida · 2009
Earlier work this paper cites.
Tensor decompositions and applications
Tamara G Kolda and Brett W Bader · 2009
Earlier work this paper cites.
Joint diagonalization: Is non-orthogonal always preferable to orthogonal?
Antoine Souloumiac · 2009
Earlier work this paper cites.
Bounding standard gaussian tail probabilities
Lutz Duembgen · 2010
Earlier work this paper cites.
Shifted power method for computing tensor eigenpairs
Tamara G Kolda and Jackson R Mayo · 2011
Earlier work this paper cites.
ICA with reconstruction cost for efficient overcomplete feature learning
Quoc V Le, Alexandre Karpenko, Jiquan Ngiam, and Andrew Y Ng · 2011
Earlier work this paper cites.
A spectral algorithm for latent dirichlet allocation
Animashree Anandkumar, Yi-kai Liu, Daniel J Hsu, Dean P Foster, and Sham M Kakade · 2012
Earlier work this paper cites.
Matlab tensor toolbox version 2.5
Brett W. Bader, Tamara G. Kolda, et al · 2012
Cited alongside, same era.
Distributional semantics in technicolor
Elia Bruni, Gemma Boleda, Marco Baroni, and Nam-Khanh Tran · 2012
Cited alongside, same era.
Gigatensor: scaling tensor analysis up by 100 times-algorithms and discoveries
U Kang, Evangelos Papalexakis, Abhay Harpale, and Christos Faloutsos · 2012
Cited alongside, same era.
Parcube: Sparse parallelizable tensor decompositions
Evangelos E Papalexakis, Christos Faloutsos, and Nicholas D Sidiropoulos · 2012
Cited alongside, same era.
Most tensor problems are NP-Hard
Christopher J Hillar and Lek-Heng Lim · 2013
Cited alongside, same era.
Fast detection of overlapping communities via online tensor methods
Furong Huang, UN Niranjan, Mohammad Umar Hakeem, and Animashree Anandkumar · 2013
Tensor factorization via matrix factorization
Volodymyr Kuleshov, Arun Tejasvi Chaganty, and Percy Liang · 2015
Later among the works it cites.
Sparse and low-rank tensor decomposition
Parikshit Shah, Nikhil Rao, and Gongguo Tang · 2015
Later among the works it cites.
DMS: Distributed sparse tensor factorization with alternating least squares
Shaden Smith and George Karypis · 2015
Later among the works it cites.
Guaranteed tensor decomposition: A moment approach
Gongguo Tang and Parikshit Shah · 2015
Later among the works it cites.
Reinforcement learning of POMDPs using spectral methods
Kamyar Azizzadenesheli, Alessandro Lazaric, and Animashree Anandkumar · 2016
Later among the works it cites.
SPALS: Fast alternating least squares via implicit leverage scores sampling
Dehua Cheng, Richard Peng, Yan Liu, and Ioakeim Perros · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Estimating latent-variable graphical models using moments and likelihoods
Arun Tejasvi Chaganty and Percy Liang · 2014
Cited alongside, same era.
Distributed latent dirichlet allocation via tensor factorization
Furong Huang, Sergiy Matusevych, Anima Anandkumar, Nikos Karampatziakis, and Paul Mineiro · 2014
Cited alongside, same era.
Neural word embedding as implicit matrix factorization
Omer Levy and Yoav Goldberg · 2014
Cited alongside, same era.
Glove: Global vectors for word representation
Jeffrey Pennington, Richard Socher, and Christopher D. Manning · 2014
Cited alongside, same era.
Learning overcomplete latent variable models through tensor methods
Animashree Anandkumar, Rong Ge, and Majid Janzamin · 2015
Cited alongside, same era.
FastMotif: spectral sequence motif discovery
Nicolo Colombo and Nikos Vlassis · 2015
Cited alongside, same era.
Tensor decomposition via joint matrix schur decomposition
Nicolo Colombo and Nikos Vlassis · 2016
Later among the works it cites.
Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
Samuel B Hopkins, Tselil Schramm, Jonathan Shi, and David Steurer · 2016
Later among the works it cites.
Tensorly: Tensor learning in python
Jean Kossaifi, Yannis Panagakis, and Maja Pantic · 2016
Later among the works it cites.
Polynomial-time tensor decompositions with sum-of-squares
Tengyu Ma, Jonathan Shi, and David Steurer · 2016
Later among the works it cites.
Yaroslav Shitov · 2016
Later among the works it cites.
Sublinear time orthogonal tensor decomposition
Zhao Song, David Woodruff, and Huan Zhang · 2016
Later among the works it cites.
Learning from multiway data: Simple and efficient tensor regression
Rose Yu and Yan Liu · 2016
Later among the works it cites.
A practical randomized CP tensor decomposition
Casey Battaglino, Grey Ballard, and Tamara G Kolda · 2017
Closest in time.