A Practical Randomized CP Tensor Decomposition
From MaRDI portal
Publication:4643335
DOI10.1137/17M1112303zbMath1444.65016arXiv1701.06600OpenAlexW3102869303WikidataQ129774144 ScholiaQ129774144MaRDI QIDQ4643335
Casey Battaglino, Grey Ballard, Tamara G. Kolda
Publication date: 24 May 2018
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.06600
Multilinear algebra, tensor calculus (15A69) Randomized algorithms (68W20) Numerical linear algebra (65F99)
Related Items (37)
Tensor methods for the Boltzmann-BGK equation ⋮ Stochastic Gradients for Large-Scale Tensor Decomposition ⋮ Low-Rank Tucker Approximation of a Tensor from Streaming Data ⋮ Johnson–Lindenstrauss Embeddings with Kronecker Structure ⋮ A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition ⋮ An efficient algorithm for computing the approximate t-URV and its applications ⋮ Time-aware tensor decomposition for sparse tensors ⋮ The Hanson-Wright inequality for random tensors ⋮ Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument ⋮ Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition ⋮ Real eigenstructure of regular simplex tensors ⋮ A literature survey of matrix methods for data science ⋮ Randomized tensor decomposition for large-scale data assimilation problems for carbon dioxide sequestration ⋮ Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition ⋮ A Higher-Order Generalized Singular Value Decomposition for Rank-Deficient Matrices ⋮ A block-randomized stochastic method with importance sampling for CP tensor decomposition ⋮ A randomized algorithm for tensor singular value decomposition using an arbitrary number of passes ⋮ Accelerated doubly stochastic gradient descent for tensor CP decomposition ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ Provable stochastic algorithm for large-scale fully-connected tensor network decomposition ⋮ The numerical approximation of nonlinear functionals and functional differential equations ⋮ Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations ⋮ Multiscale co-clustering for tensor data based on canonical polyadic decomposition and slice-wise factorization ⋮ Randomized algorithms for the low multilinear rank approximations of tensors ⋮ Structured Random Sketching for PDE Inverse Problems ⋮ Parallel tensor methods for high-dimensional linear PDEs ⋮ Fast randomized matrix and tensor interpolative decomposition using countsketch ⋮ Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion ⋮ Sparse low rank approximation of potential energy surfaces with applications in estimation of anharmonic zero point energies and frequencies ⋮ On Koopman mode decomposition and tensor component analysis ⋮ Incremental CP Tensor Decomposition by Alternating Minimization Method ⋮ Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition ⋮ Unnamed Item ⋮ Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares ⋮ Tensor-Structured Sketching for Constrained Least Squares ⋮ Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems ⋮ Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
Uses Software
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Faster least squares approximation
- A comparison of algorithms for fitting the PARAFAC model
- A continuous analogue of the tensor-train decomposition
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Exact matrix completion via convex optimization
- Randomized Alternating Least Squares for Canonical Tensor Decompositions: Application to A PDE With Random Data
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Computational Advertising: Techniques for Targeting Relevant Ads
- A fast randomized algorithm for overdetermined linear least-squares regression
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Extensions of Lipschitz mappings into a Hilbert space
- A Least-Squares Method for Sparse Low Rank Approximation of Multivariate Functions
- Algorithm 862
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Uncertainty principles and ideal atomic decomposition
- Tensor Decomposition for Signal Processing and Machine Learning
- Enhanced Line Search: A Novel Method to Accelerate PARAFAC
This page was built for publication: A Practical Randomized CP Tensor Decomposition
