Jump to content

Tensor reshaping

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Will Orrick (talk | contribs) at 16:58, 25 February 2020 (Move up the "examples", which are actually fundamental processes on which the general flattening construction depends, namely coordinate representation and vectorization.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In multilinear algebra, a reshaping of tensors is any bijection between the set of indices of an order- tensor and the set of indices of an order- tensor, where . The use of indices presupposes tensors in coordinate representation with respect to a basis. The coordinate representation of a tensor can be regarded as a multi-dimensional array, and a bijection from one set of indices to another therefore amounts to a rearrangement of the array elements into an array of a different shape. Such a rearrangement constitutes a particular kind of linear map between the vector space of order- tensors and the vector space of order- tensors.

Definition

Given a positive integer , the notation refers to the set of the first d positive integers. Given a set , the notation refers to the cardinality of , i.e. the number of its elements.

For each integer where for a positive integer , let Vk denote an nk-dimensional vector space over a field . Then there are vector space isomorphisms (linear maps)

where is any permutation and is the symmetric group on elements. Via these (and other) vector space isomorphisms, a tensor can be interpreted in several ways as an order- tensor where .

Coordinate representation

The first vector space isomorphism on the list above, , gives the coordinate representation of an abstract tensor. Assume that each of the vector spaces has a basis . The expression of a tensor with respect to this basis has the form where the coefficients are elements of . The coordinate representation of is where is the standard basis vector of . This can be regarded as a d-dimensional array whose elements are the coefficients .

Vectorization

By means of a bijective map , a vector space isomorphism between and is constructed via the mapping where for every natural number such that , the vector denotes the jth standard basis vector of . In such a reshaping, the tensor is simply interpreted as a vector in . This is known as vectorization, and is analogous to vectorization of matrices. A standard choice of bijection is such that

which is consistent with the way in which the colon operator in Matlab and GNU Octave reshapes a higher-order tensor into a vector. In general, the vectorization of is the vector .

General flattenings

For each subset of , let

denote the projection with , i.e. denote the elements of the subset .

Let be a partition. Then, the -flattening of a simple tensor is defined as

which may be interpreted as a tensor of order by ignoring for each positive integer with the tensor product structure on .

The standard way to ignore the tensor product structure consists of looking at through vector space isomorphisms, which for each positive integer allow identifying and . Using these identifications, is viewed as an element of , where for each positive integer we define , the product of the integers .

For general tensors the above definition is extended linearly as follows. Since every tensor admits a tensor rank decomposition, we can define the -flattening of an arbitrary tensor as follows:

The vectorization of is an -reshaping wherein .

Matricization

Let be the coordinate representation of an abstract tensor with respect to a basis. A standard factor-k flattening of is an -reshaping in which and . Usually, a standard flattening is denoted by

These reshapings are sometimes called matricizations or unfoldings in the literature. A standard choice for the bijection is the one that is consistent with the reshape function in Matlab and GNU Octave, namely