ML p(r)ior | Weighted tensor decomposition for approximate decoupling of multivariate polynomials

Weighted tensor decomposition for approximate decoupling of multivariate polynomials

2016-01-28
Multivariate polynomials arise in many different disciplines. Representing such a polynomial as a vector of univariate polynomials can offer useful insight, as well as more intuitive understanding. For this, techniques based on tensor methods are known, but these have only been studied in the exact case. In this paper, we generalize an existing method to the noisy case, by introducing a weight factor in the tensor decomposition. Finally, we apply the proposed weighted decoupling algorithm in the domain of system identification, and observe smaller model errors.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations

Related Articles

2015-09-22

Deep neural networks currently demonstrate state-of-the-art performance in several domains. At the s… show more
PDF

Highlights - Most important sentences from the article

2016-12-20

In pattern classification, polynomial classifiers are well-studied methods as they are capable of ge… show more
PDF

Highlights - Most important sentences from the article

2013-06-25

Fourier PCA is Principal Component Analysis of a matrix obtained from higher order derivatives of th… show more
PDF

Highlights - Most important sentences from the article

2018-11-13
1811.05076 | stat.ML

We consider the problem of decomposition of multiway tensor with binary entries. Such data problems … show more
PDF

Highlights - Most important sentences from the article

2018-01-11

We address the problem of inferring an undirected graph from nodal observations, which are modeled a… show more
PDF

Highlights - Most important sentences from the article

2019-02-11

Invariance transformations of polyadic decompositions of matrix multiplication tensors define an equ… show more
PDF

Highlights - Most important sentences from the article

2019-05-21

We present a windowed technique to learn parsimonious time-varying autoregressive models from multiv… show more
PDF

Highlights - Most important sentences from the article

2018-11-30
1811.12562 | math.NA

This paper proposes a new computational method for solving structured least squares problems that ar… show more
PDF

Highlights - Most important sentences from the article

2018-04-04

We address the structure identification and the uniform approximation of sums of ridge functions $f(… show more
PDF

Highlights - Most important sentences from the article

2016-05-27

Network reconstruction of dynamical continuous-time (CT) systems is motivated by applications in man… show more
PDF

Highlights - Most important sentences from the article

2016-10-10
1610.02962 | stat.ML

This work studies the linear approximation of high-dimensional dynamical systems using low-rank dyna… show more
PDF

Highlights - Most important sentences from the article

2018-11-05

Consider the following fundamental learning problem: given input examples $x \in \mathbb{R}^d$ and t… show more
PDF

Highlights - Most important sentences from the article

2018-09-03

The Canonical Polyadic decomposition (CPD) is a convenient and intuitive tool for tensor factorizati… show more
PDF

Highlights - Most important sentences from the article

2018-11-26
1811.10573 | math.NA

The alternating least squares algorithm for CP and Tucker decomposition is dominated in cost by the … show more
PDF

Highlights - Most important sentences from the article

2018-10-20

This paper proposes a novel neural network architecture inspired by the nonstandard form proposed by… show more
PDF

Highlights - Most important sentences from the article

2017-02-14

We consider a multitask learning problem, in which several predictors are learned jointly. Prior res… show more
PDF

Highlights - Most important sentences from the article