Exploiting Efficient Representations in Large-Scale Tensor Decompositions
From MaRDI portal
Publication:4631411
DOI10.1137/17M1152371OpenAlexW2924170235WikidataQ128187968 ScholiaQ128187968MaRDI QIDQ4631411FDOQ4631411
Authors: Nico Vervliet, Otto Debals, Lieven De Lathauwer 
Publication date: 29 March 2019
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1152371
Recommendations
- Efficient Tensor Decompositions
- On the optimization landscape of tensor decompositions
- Efficient tree decomposition of high-rank tensors
- Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
- Computing dense tensor decompositions with optimal dimension trees
- Stochastic gradients for large-scale tensor decomposition
- Recursive tensor-train decomposition in higher dimensions
- Tensor decompositions for learning latent variable models
- scientific article
- Low-rank structures and tensor approximations for huge-size data sets
Cites Work
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Title not available (Why is that?)
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Orthogonal tensor decompositions
- Tensor Decompositions and Applications
- CANDELINC: A general approach to multidimensional analysis of many-way arrays with linear constraints on parameters
- Tensor-train decomposition
- TT-cross approximation for multidimensional arrays
- Hierarchical Singular Value Decomposition of Tensors
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Tensor-CUR Decompositions for Tensor-Based Data
- Fast Multilinear Singular Value Decomposition for Structured Tensors
- Hierarchical Kronecker tensor-product approximations
- Title not available (Why is that?)
- Principal component analysis of three-mode data by means of alternating least squares algorithms
- Tensor spaces and numerical tensor calculus
- Exponential data fitting using multilinear algebra: the single‐channel and multi‐channel case
- Fast Hankel tensor-vector product and its application to exponential data fitting.
- A literature survey of low-rank tensor approximation techniques
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- A new scheme for the tensor representation
- Low rank Tucker-type tensor approximation to classical potentials
- The alternating linear scheme for tensor optimization in the tensor train format
- Fast revealing of mode ranks of tensor in canonical form
- Multigrid accelerated tensor approximation of function related multidimensional arrays
- The Best rank-\((R_1,R_2,R_3)\) approximation of tensors by means of a geometric Newton method
- Solution of Linear Systems and Matrix Inversion in the TT-Format
- Structured Rank-(r1, . . . , rd) Decomposition of Function-related Tensors in R_D
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-\((L_r,L_r,1)\) terms, and a new generalization
- Unconstrained Optimization of Real Functions in Complex Variables
- Linear algebra for tensor problems
- Complexity of multiplication with vectors for structured matrices
- A comparison of algorithms for fitting the PARAFAC model
- Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
- Generalizing the column-row matrix decomposition to multi-way arrays
- Tensor Decomposition for Signal Processing and Machine Learning
- Fast algorithms with preprocessing for matrix-vector multiplication problems
- Computing the polyadic decomposition of nonnegative third order tensors
- A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization
- A new truncation strategy for the higher-order singular value decomposition
- Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
- A Constrained Factor Decomposition With Application to MIMO Antenna Systems
- Optimization via separated representations and the canonical tensor decomposition
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Fast truncation of mode ranks for bilinear tensor operations
- Condition numbers for the tensor rank decomposition
- Efficient Nonnegative Tucker Decompositions: Algorithms and Uniqueness
- Computing the gradient in optimization algorithms for the CP decomposition in constant memory through tensor blocking
- Exact line and plane search for tensor optimization
- Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms
- Löwner-Based Blind Signal Separation of Rational Functions With Applications
- A Second-Order Method for Fitting the Canonical Polyadic Decomposition With Non-Least-Squares Cost
Cited In (7)
- Title not available (Why is that?)
- On the optimization landscape of tensor decompositions
- MuLOT: multi-level optimization of the canonical polyadic tensor decomposition at large-scale
- A Probit Tensor Factorization Model For Relational Learning
- On the computational benefit of tensor separation for high-dimensional discrete convolutions
- Faster tensor train decomposition for sparse data
- Incremental CP tensor decomposition by alternating minimization method
Uses Software
This page was built for publication: Exploiting Efficient Representations in Large-Scale Tensor Decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4631411)
