Accelerating jackknife resampling for the Canonical Polyadic Decomposition

12/07/2021
by   Christos Psarras, et al.
0

The Canonical Polyadic (CP) tensor decomposition is frequently used as a model in applications in a variety of different fields. Using jackknife resampling to estimate parameter uncertainties is often desirable but results in an increase of the already high computational cost. Upon observation that the resampled tensors, though different, are nearly identical, we show that it is possible to extend the recently proposed Concurrent ALS (CALS) technique to a jackknife resampling scenario. This extension gives access to the computational efficiency advantage of CALS for the price of a modest increase (typically a few percent) in the number of floating point operations. Numerical experiments on both synthetic and real-world datasets demonstrate that the new workflow based on a CALS extension can be several times faster than a straightforward workflow where the jackknife submodels are processed individually.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2019

Fast Randomized Matrix and Tensor Interpolative Decomposition Using CountSketch

We propose a new fast randomized algorithm for interpolative decompositi...
research
09/03/2018

Tensor Networks for Latent Variable Analysis: Higher Order Canonical Polyadic Decomposition

The Canonical Polyadic decomposition (CPD) is a convenient and intuitive...
research
12/20/2021

Efficient Tensor Robust PCA under Hybrid Model of Tucker and Tensor Train

Tensor robust principal component analysis (TRPCA) is a fundamental mode...
research
05/30/2021

A Tapered Floating Point Extension for the Redundant Signed Radix 2 System Using the Canonical Recoding

A tapered floating point encoding is proposed which uses the redundant s...
research
11/19/2020

CP-TT: using TT-SVD to greedily construct a Canonical Polyadic tensor approximation

In the present work, a method is proposed in order to compute a Canonica...
research
04/08/2017

Noisy Tensor Completion for Tensors with a Sparse Canonical Polyadic Factor

In this paper we study the problem of noisy tensor completion for tensor...
research
12/05/2019

A Fast Implementation for the Canonical Polyadic Decomposition

A new implementation of the canonical polyadic decomposition (CPD) is pr...

Please sign up or login with your details

Forgot password? Click here to reset