Exploiting Efficient Representations in Large-Scale Tensor Decompositions
From MaRDI portal
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; zbMATH DE number 1820149
- Low-rank structures and tensor approximations for huge-size data sets
Cites work
- A comparison of algorithms for fitting the PARAFAC model
- A Constrained Factor Decomposition With Application to MIMO Antenna Systems
- A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization
- A literature survey of low-rank tensor approximation techniques
- A Multilinear Singular Value Decomposition
- A new scheme for the tensor representation
- A new truncation strategy for the higher-order singular value decomposition
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- A Second-Order Method for Fitting the Canonical Polyadic Decomposition With Non-Least-Squares Cost
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
- Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-(L_r,L_r,1) Terms
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- CANDELINC: A general approach to multidimensional analysis of many-way arrays with linear constraints on parameters
- Complexity of multiplication with vectors for structured matrices
- Computing the gradient in optimization algorithms for the CP decomposition in constant memory through tensor blocking
- Computing the polyadic decomposition of nonnegative third order tensors
- Condition numbers for the tensor rank decomposition
- 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
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Efficient Nonnegative Tucker Decompositions: Algorithms and Uniqueness
- Exact line and plane search for tensor optimization
- Exponential data fitting using multilinear algebra: the single‐channel and multi‐channel case
- Fast algorithms with preprocessing for matrix-vector multiplication problems
- Fast Hankel tensor-vector product and its application to exponential data fitting.
- Fast Multilinear Singular Value Decomposition for Structured Tensors
- Fast revealing of mode ranks of tensor in canonical form
- Fast truncation of mode ranks for bilinear tensor operations
- Generalizing the column-row matrix decomposition to multi-way arrays
- Hierarchical Kronecker tensor-product approximations
- Hierarchical Singular Value Decomposition of Tensors
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Linear algebra for tensor problems
- Low rank Tucker-type tensor approximation to classical potentials
- Löwner-Based Blind Signal Separation of Rational Functions With Applications
- Multigrid accelerated tensor approximation of function related multidimensional arrays
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Optimization via separated representations and the canonical tensor decomposition
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization
- Orthogonal tensor decompositions
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Principal component analysis of three-mode data by means of alternating least squares algorithms
- Solution of Linear Systems and Matrix Inversion in the TT-Format
- Structured Rank-(r1, . . . , rd) Decomposition of Function-related Tensors in R_D
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Tensor spaces and numerical tensor calculus
- Tensor-CUR Decompositions for Tensor-Based Data
- Tensor-train decomposition
- The alternating linear scheme for tensor optimization in the tensor train format
- The Best rank-\((R_1,R_2,R_3)\) approximation of tensors by means of a geometric Newton method
- TT-cross approximation for multidimensional arrays
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Unconstrained Optimization of Real Functions in Complex Variables
Cited in
(8)- On the computational benefit of tensor separation for high-dimensional discrete convolutions
- Faster tensor train decomposition for sparse data
- MuLOT: multi-level optimization of the canonical polyadic tensor decomposition at large-scale
- On the optimization landscape of tensor decompositions
- Incremental CP tensor decomposition by alternating minimization method
- A Probit Tensor Factorization Model For Relational Learning
- scientific article; zbMATH DE number 5269047 (Why is no real title available?)
- Reducing swamp behavior for the canonical polyadic decomposition problem by rank-1 freezing
Describes a project that uses
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)
