Exploiting Efficient Representations in Large-Scale Tensor Decompositions
From MaRDI portal
Publication:4631411
DOI10.1137/17M1152371OpenAlexW2924170235WikidataQ128187968 ScholiaQ128187968MaRDI QIDQ4631411
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
Related Items (2)
A Probit Tensor Factorization Model For Relational Learning ⋮ Incremental CP Tensor Decomposition by Alternating Minimization Method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- TT-cross approximation for multidimensional arrays
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- Computing the polyadic decomposition of nonnegative third order tensors
- Linear algebra for tensor problems
- A comparison of algorithms for fitting the PARAFAC model
- Generalizing the column-row matrix decomposition to multi-way arrays
- Principal component analysis of three-mode data by means of alternating least squares algorithms
- CANDELINC: A general approach to multidimensional analysis of many-way arrays with linear constraints on parameters
- Complexity of multiplication with vectors for structured matrices
- Fast algorithms with preprocessing for matrix-vector multiplication problems
- Optimization via separated representations and the canonical tensor decomposition
- A new scheme for the tensor representation
- Condition numbers for the tensor rank decomposition
- Low rank Tucker-type tensor approximation to classical potentials
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Orthogonal Tensor Decompositions
- Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- A literature survey of low-rank tensor approximation techniques
- The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
- 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
- Hierarchical Singular Value Decomposition of Tensors
- Tensor Spaces and Numerical Tensor Calculus
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms
- Fast Revealing of Mode Ranks of Tensor in Canonical Form
- Multigrid Accelerated Tensor Approximation of Function Related Multidimensional Arrays
- Exponential data fitting using multilinear algebra: the single‐channel and multi‐channel case
- Efficient MATLAB Computations with Sparse and Factored Tensors
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- A Constrained Factor Decomposition With Application to MIMO Antenna Systems
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Efficient Nonnegative Tucker Decompositions: Algorithms and Uniqueness
- A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization
- Löwner-Based Blind Signal Separation of Rational Functions With Applications
- Tensor Decomposition for Signal Processing and Machine Learning
- Unconstrained Optimization of Real Functions in Complex Variables
- Solution of Linear Systems and Matrix Inversion in the TT-Format
- Fast truncation of mode ranks for bilinear tensor operations
- A Second-Order Method for Fitting the Canonical Polyadic Decomposition With Non-Least-Squares Cost
- Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking
- 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
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
- Structured Rank-(r1, . . . , rd) Decomposition of Function-related Tensors in R_D
- Hierarchical Kronecker tensor-product approximations
- Fast Hankel tensor–vector product and its application to exponential data fitting
- Exact line and plane search for tensor optimization
This page was built for publication: Exploiting Efficient Representations in Large-Scale Tensor Decompositions
