A Practical Randomized CP Tensor Decomposition
type: Item
instance of: scholarly article
title: A Practical Randomized CP Tensor Decomposition
zbMATH Open document ID: 1444.65016
DOI: 10.1137/17M1112303
author: Casey Battaglino
author: Grey Ballard
author: Tamara G. Kolda
published in: SIAM Journal on Matrix Analysis and Applications
publication date: 2018-05-24T00:00:00Z
full work available at URL: https://arxiv.org/abs/1701.06600
Mathematics Subject Classification ID: 65F99
Mathematics Subject Classification ID: 15A69
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6872622
zbMATH Keywords: canonical polyadic tensor decomposition
zbMATH Keywords: multilinear algebra
zbMATH Keywords: randomized algorithm
describes a project that uses: Blendenpik
describes a project that uses: COIL-100
describes a project that uses: DFacTo
describes a project that uses: TensorToolbox
describes a project that uses: Algorithm 862
describes a project that uses: SPLATT
MaRDI profile type: Publication
arXiv ID: 1701.06600
cites work: Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
cites work: Blendenpik: Supercharging LAPACK's Least-Squares Solver
cites work: Algorithm 862
cites work: Efficient MATLAB Computations with Sparse and Factored Tensors
cites work: Exact matrix completion via convex optimization
cites work: Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young'' decomposition
cites work: A Least-Squares Method for Sparse Low Rank Approximation of Multivariate Functions
cites work: Uncertainty principles and ideal atomic decomposition
cites work: Faster least squares approximation
cites work: A continuous analogue of the tensor-train decomposition
cites work: Extensions of Lipschitz mappings into a Hilbert space
cites work: Tensor Decompositions and Applications
cites work: Q4856179
cites work: Tensor-Train Decomposition
cites work: Enhanced Line Search: A Novel Method to Accelerate PARAFAC
cites work: Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data
cites work: A fast randomized algorithm for overdetermined linear least-squares regression
cites work: Tensor Decomposition for Signal Processing and Machine Learning
cites work: A comparison of algorithms for fitting the PARAFAC model
cites work: Computational Advertising: Techniques for Targeting Relevant Ads
OpenAlex ID: W3102869303
Wikidata QID: Q129774144
Recommended article: Q5157452
Recommended article: Incremental CP Tensor Decomposition by Alternating Minimization Method
Recommended article: Numerical CP decomposition of some difficult tensors
Recommended article: An efficient randomized fixed-precision algorithm for tensor singular value decomposition
Recommended article: A randomized algorithm for a tensor-based generalization of the singular value decomposition
Recommended article: Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
Recommended article: Efficient Tensor Decompositions
Recommended article: Randomized algorithms for the approximations of Tucker and the tensor train decompositions
Recommended article: On the optimization landscape of tensor decompositions
Recommended article: Randomized algorithms for the low multilinear rank approximations of tensors
description: scientific article; zbMATH DE number 6872622