Efficient construction of canonical polyadic approximations of tensor ...

Efficient Construction of Canonical Polyadic Approximations of ...

We consider the problem of constructing a canonical polyadic (CP) decomposition for a tensor network, rather than a single tensor.

Title:Efficient construction of canonical polyadic approximations of tensor networks ... Abstract:We consider the problem of constructing a ...

Efficient construction of canonical polyadic approximations of tensor ...

Efficient construction of canonical polyadic approximations of tensor networks. Karl Pierce and Edward F. Valeev∗. Department of Chemistry, Virginia Tech ...

Efficient Construction of Canonical Polyadic Approximations of ...

Title: Efficient Construction of Canonical Polyadic Approximations of Tensor Networks. Journal Article · Fri Dec 09 00:00:00 EST 2022 · Journal of Chemical ...

Efficient Construction of Canonical Polyadic Approximations of ...

The utility of this technique is demonstrated for the order-4 Coulomb interaction tensor approximated by two order-3 tensors via an approximate generalized ...

(PDF) Efficient Construction of Canonical Polyadic Approximations ...

DOI: 10.1021/acs.jctc.2c00861) We consider the problem of constructing a canonical polyadic (CP) decomposition for a tensor network, rather than a single ...

Efficient construction of canonical polyadic approximations of ... - dblp

Karl Pierce, Edward F. Valeev: Efficient construction of canonical polyadic approximations of tensor networks. CoRR abs/2208.09992 (2022).

Towards efficient utilization of the canonical polyadic decomposition ...

Towards efficient utilization of the canonical polyadic decomposition to approximate tensor networks in high accuracy electronic structure methods. Karl ...

Towards efficient canonical polyadic decomposition on sunway ...

TC algorithms usually tackle the data recovery problem by low rank approximation combining tensor decomposition (TD) and norm optimization. TD generally ...

Canonical polyadic decomposition — Tensorlab 3.0 documentation

Computing the error¶. The residual between a tensor T and its CPD approximation defined by factor matrices ...

Efficient Structure-preserving Support Tensor Train Machine

This kernel is defined on the Canonical. Polyadic (CP) tensor format, also known as Parallel Factor Analysis, or PARAFAC (Hitchcock, 1927,. 1928). Once the CP ...

(PDF) Analysis and Approximation of the Canonical Polyadic Tensor ...

PDF | We study the least-squares (LS) functional of the canonical polyadic (CP) tensor decomposition. Our approach is based on the elimination of one.

[PDF] Optimization-Based Algorithms for Tensor Decompositions ...

Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-(Lr, Lr, 1) Terms, and a New Generalization.

Optimization-Based Algorithms for Tensor Decompositions ...

Computational Optimization and Applications, Vol. 84, No. 2 | 27 October 2022. Efficient Construction of Canonical Polyadic Approximations of Tensor Networks.

Computation of low-rank tensor approximation under existence ...

The Canonical Polyadic (CP) tensor decomposition has become an attractive mathematical tool in several fields during the last ten years. This decomposition ...

optimization-based algorithms for tensor decompositions: canonical ...

Many strategies to store the approximation to the Hessian exist. For instance, the nonlinear conjugate gradient method can be interpreted to build Bk as the sum ...

Efficient Structure-preserving Support Tensor Train Machine

We develop the Tensor Train Multi-way Multi-level Kernel (TT-MMK), which combines the simplicity of the Canonical Polyadic decomposition, the classification ...

Efficient Construction of Tensor Ring Representations from Sampling

In this paper we propose an efficient method to compress a high dimensional function into a tensor ring format, based on alternating least squares (ALS).

Basic use of Tensorlab

... Canonical polyadic decomposition). ... Note that the option names are case insensitive. Construction of a tensor obtained by a multilinear transformation of a ...

using TT-SVD to greedily construct a Canonical Polyadic tensor ...

The proposed approach can be straightforwardly extended to compute rank-$k$ updates in a stable way and is compared to ALS and ASVD methods and performs ...