Abstract
A higher-order tensor allows several possible matricizations (reshapes into matrices). The simultaneous decay of singular values of such matricizations has crucial implications on the low-rank approximability of the tensor via higher-order singular value decomposition. It is therefore an interesting question which simultaneous properties the singular values of different tensor matricizations actually can have, but it has not received the deserved attention so far. In this paper, preliminary investigations in this direction are conducted. While it is clear that the singular values in different matricizations cannot be prescribed completely independent from each other, numerical experiments suggest that sufficiently small, but otherwise arbitrary perturbations preserve feasibility. An alternating projection heuristic is proposed for constructing tensors with prescribed singular values (assuming their feasibility). Regarding the related problem of characterising sets of tensors having the same singular values in specified matricizations, it is noted that orthogonal equivalence under multilinear matrix multiplication is a sufficient condition for two tensors to have the same singular values in all principal, Tucker-type matricizations, but, in contrast to the matrix case, not necessary. An explicit example of this phenomenon is given.
Mathematics Subject Classification: 15A18, 15A21, 15A69
Introduction and problem statement
A space of higher-order tensors is isomorphic to many different matrix spaces of the form where , . Concretely, when identifying tensors with d-dimensional arrays of coordinates with respect to an orthonormal tensor product basis, such an isomorphism is realized by reshaping the array into a matrix. The directions in t indicate the multi-indices for the rows of the resulting matrix, while the other directions are used for the columns. All these different matricizations (also called unfoldings or reshapes in the literature) of the tensor carry some spectral information in form of their singular value decompositions.
For subsets of t that are part of a dimension partition tree, the column spaces of the corresponding matricizations satisfy certain nestedness properties that form the basis for important subspace based low-rank tensor decompositions like the Tucker format [22], the hierarchical Tucker (HT) format [7, 9], or the tensor train (TT) format [18, 19]. As a by-product, the ranks of the corresponding matricizations, that is, the number of nonzero singular values, are estimated as , where is a disjoint partition. In contrast, the interconnections between the singular values themselves have not been studied so far.
At first sight, the singular values of different matricizations could be considered as unnatural or artificial characteristics for tensors, as they ignore their multilinear nature. However, as it turns out, they provide crucial measures for the approximability of tensors in the aforementioned low-rank subspace formats. In the pioneering work [3] the higher-order singular value decomposition has been defined, and it has been shown how it can be practically used to obtain quasi-optimal low-rank approximations in the Tucker format with full error control. The approximation is obtained by an orthogonal projection on the tensor product of subspaces spanned by the dominating singular vectors of the corresponding matricizations in (i.e. corresponding to the choices for ). An upper bound of the squared error is then given by the sum of squares of all deleted singular values in all directions. Later, variants of such truncation procedures have been obtained for the TT format [16, 17] and the HT format [7] with similar error bounds, but involving singular values of some other matricizations of the tensor.
Building on these available, quasi-optimal bounds for low-rank approximations via higher-order versions of SVD truncation, it is understandable that quite some theorems have been stated making simultaneous assumptions on the singular values of certain matricizations of a tensor. This concerns stability of low-rank ODE integrators [12, 14], local convergence of optimization algorithms [20], or approximability by low-rank tensor formats [1], to name a few. Assumed properties of interest are decay rate of and gaps between the singular values, for instance. A principal task would then be to give alternative descriptions of classes of tensors satisfying such assumptions to prevent tautological results or, in worst case, void statements. But this task has turned out to be notoriously difficult. For tensors arising from function discretization, some qualitative statements about the decay of singular values can be obtained from their regularity using explicit analytic approximation techniques by tensor products of (trigonometric) polynomials or wavelets, exponential sum, or cross approximation; see [8, 21] and references therein. But these qualitative implications on the decay of singular values obtained from explicit separable approximations can rarely be made quantitatively precise, for instance, if they contain unknown constants, and also provide little insight on the actual interconnection between different matricizations.
In its purest form the question we are interested in is very simple to state. Given prescribed singular values for some matricizations (having, e.g., some favourable properties), does there exist at all a tensor having these singular values? For a matrix this is of course very easy to answer by simply constructing a diagonal matrix. For tensors it turns out to be quite difficult, and seems to depend on how many matricizations are simultaneously considered.
In the present paper we study this and related questions for the singular values related to the classical higher-order SVD, that is, the singular values of the principal, Tucker-type matricizations that separate single indices . We call the collection of the d corresponding singular value vectors the higher-order singular values, see Definition 1.1 below. Compared to other systems of matricizations, this framework is the historically most important. It also appears to be the simplest, partly because it is, at least to some extent, very conveniently possible to manipulate the principal matricizations simultaneously via multilinear matrix multiplications. Yet, even in this case, the obtained results remain fragmentary and far from complete. Nevertheless, we consider them as valuable first steps toward future investigations of this important and fascinating subject. Our contributions are as follows.
We show that not all configurations of higher-order singular values can be feasible. The proof is nonconstructive (Sect. 3.1).
However, conducted numerical experiments suggest that the singular values for different matricizations are, except for degenerate situations, locally independent from each other. That is, in the neighbourhood of a tensor it is possible to slightly perturb, say, only the singular values of the first matricization, while maintaining the singular values of the other ones. This is fundamentally different from the matrix case, since the singular values of a matrix are always the same as the ones of its transpose. However, currently this remains an unproved conjecture Sect. 3.2).
We propose the method of alternating projections as a heuristic to construct (approximately) tensors with prescribed singular values in certain matricizations (Sect. 3.3).
The higher-order SVD (HOSVD) is a generalization of the SVD from matrices to tensors. The role of the diagonal matrix of singular values is replaced by the core tensor in the HOSVD, representing the normal form under orthogonal equivalence, and characterized by slice-wise orthogonality properties. We show manifold properties of the set of these core tensors (called HOSVD tensors) in the case of strictly decreasing and positive higher-order singular values (Sect. 2.2).
We provide an example of two tensors having the same singular values in all three principal matricizations without being orthogonally equivalent (Sect. 2.4).
In this paper we consider real tensors for convenience. Although most concepts seem to generalize to the complex case, some care would be required, e.g., when switching from smooth manifolds to analytic ones.
The rest of this section is devoted to the precise statements of the considered problems. They require some amount of definitions and notation, which will be introduced first.
Preliminaries, definitions, notation
Let and . We consider the d-fold tensor product space as isomorphic to the space of real arrays (sometime called hyper-matrices). The entries of will be indexed by multi-indices , with every taking values between 1 and . For convenience, it will be assumed
throughout the paper. Furthermore, we set
A tensor admits d principal matricizations [10, 11]
in which the -th row contains all entries with fixed , arranged in some fixed ordering with respect to the remaining multi-indices. The choice of that ordering is not important for our purposes. The matricizations realize the isomorphism between the tensor space and the matrix spaces . Note that for tensors of order (that is, matrices), the matricizations are given by and (up to permutation).
It will further be convenient to have a notation for the Gram matrix of , which will be
By we denote the group of real orthogonal matrices, by the identity matrix. Each of the matrices admits a singular value decomposition
| 1.1 |
where , , and is a diagonal matrix containing the mode-j singular values as diagonal elements. We denote . The diagonal entries of are the ordered eigenvalues of .
Definition 1.1
Let .
- For , the vector
is called the vector of mode-j singular values. The tuple
is called the set of higher-order singular values of the tensor . - Correspondingly, for , the vector
is called the vector of mode-j Gramian eigenvalues. The tuple
is called the set of higher-order Gramian eigenvalues of the tensor . The multilinear rank of the tensor is the tuple with being equal to the number of nonzero entries of .
The tensor is called non-singular, if .
We note that for matrices the definition of ‘non-singular’ coincides with the usual definition (in particular, it enforces ). In general, the following is true.
Proposition 1.2
There exists a non-singular tensor in if and only if the following compatibility conditions hold:
| 1.2 |
In this case the set of non-singular tensors is open and dense in .
Proof
Consider j fixed. By isomorphy and known results on matrices, it is clear that the set of all with being of rank is not empty, open, and dense if and only if . The set of non-singular tensors is the intersection of these sets for . As such, it is also open and dense.
Let denote the Frobenius norm of matrices and tensors, and the standard Euclidean norm for vectors. Since matricization of a tensor is an isometric isomorphism in Frobenius norm, and since it holds , an obvious observation for higher-order singular values is
Therefore, we can focus in the following on tensors on the unit sphere
and hence higher-order singular values in the set
where denotes the set of all nonnegative, decreasingly ordered vectors on the Euclidean unit sphere in . For most results, however, it will be necessary to further restrict to the set of non-singular tensors having strictly decreasing mode-j singular values in every direction j. Therefore, we also introduce the notation
where each contains the unit norm vectors in with strictly decreasing and strictly positive entries. Then
Note that we do not introduce a notation for the slightly larger set of all non-singular tensors in . The main technical advantage of tensors in is that all principal unfoldings admit essentially unique singular value decompositions.
The following two facts are useful to know, and follow immediately from the matrix case.
Proposition 1.3
The function is continuous on . Assuming (1.2), the set is relatively open and dense in .
Proof
The continuity of as a function of follows by isomorphy to from the continuity of each as a function of . The proof that is relatively open and dense in is analogous to the proof of Proposition 1.2.
Problem statement
Regarding the higher-order singular values of tensors a principle question of interest is the following one.
Problem 1.4
(Feasible higher-order singular values) Given , does there exist a tensor such that ?
Such will be called a feasible. We define
In this generality, Problem 1.4 appears to be quite hard, and will not be satisfactorily solved in this article. At least, as a first result, we are able to show that not all are feasible: . The argument, however, is non-constructive, see Sect. 3.1.
A relaxed question of a more qualitative nature is the following one.
Problem 1.5
(Properties of ) What are the topological properties of the set as a subset of ? Does it, for instance, have positive (relative) Lebesgue measure?
Numerical experiments with random tensors seem to indicate that the answer to the second question could be positive when , but we are not able to prove it. So it remains a conjecture. In fact, we conjecture that for every in it holds that is an interior point of , see Sect. 3.2. A striking implication of this conjecture is that given , its high-order singular values in different directions can be perturbed independently from each other without loosing feasibility (local independence of high-order singular values). In Sect. 3.3 we will present a heuristic approach to do this using an alternating projection method, which seems to work quite reliably for small perturbations, although we are currently neither able to prove its convergence nor that limit points must have the desired property.
To approach Problems 1.4 and 1.5, it seems useful to also study the following problem, which is of some interest in itself.
Problem 1.6
(Tensors with same higher-order singular values) Given , characterize sets of tensors having the same singular values as .
The corresponding equivalence classes for tensors in and are denoted by
The next Sect. 2 provides some results related to Problem 1.6. It is observed that orbits of orthogonally equivalent tensors provide trivial examples of subsets of tensors having the same higher-order singular values. However, other than in the matrix case, their dimension is too small to provide a complete description. Via the tool of HOSVD tensors, which serve as normal forms in the orbits of orthogonally equivalent tensors, we are able to construct an example of two tensors with the same higher-order singular values that are not orthogonally equivalent.
Tensors with the same higher-order singular values
In this section we focus on equivalence classes of tensors having the same higher-order singular values.
Orthogonally equivalent tensors
We recall a fact from matrices: Two rectangular matrices , , have the same singular values, if and only if they are orthogonally equivalent, that is, if there exists and such that
This definition of orthogonal equivalence can be generalized to tensors using the multilinear matrix multiplication, see, e.g., [5, 13]. We consider the product unitary group
The left action of this group on is defined as the canonical action of the tensor product operator on in the sense that
In terms of matricizations, in a slight abuse of notation, we note that
| 2.1 |
cf. [8, Lemma 5.6]. In particular, since , it holds
| 2.2 |
for . For matrices (), these formulas define orthogonal equivalence, which motivates the following generalization.
Definition 2.1
(see [5]) Two tensors are called orthogonally equivalent, if there exists such .
From (2.2), we draw a trivial but important conclusion.
Proposition 2.2
If two tensors are orthogonally equivalent, then they have the same higher-order singular values.
In particular, the orbit of each under the group action contains only tensors with identical higher-order singular values.
Proposition 2.3
Let . Then the orbit is a locally smoothly embedded submanifold of of dimension
Proof
We write instead of . Consider the canonical map , , whose image is . Since is of constant rank [6, §16.10.2] and easily shown to be locally injective (uniqueness of left singular vectors up to sign flipping for ), it is already an immersion [6, §16.8.8.(iv)]. The result is now standard, see, e.g., [6, §16.8.8.(ii)].
For the dimension of can be smaller than . Note that we did not attempt to prove or disprove that the orbits are globally embedded submanifolds.
HOSVD tensors
The compact Lie group acts freely on . It also acts properly (since it is compact and acts continuously). By a general theorem (e.g. [6, § 16.10.3]), the quotient manifold of equivalence classes exists, and the canonical mapping is a submersion. A concrete realization of this abstract quotient manifold is the set of regular HOSVD tensors which is now introduced.
Given , let denote a matrix of left singular vectors of as in (1.1). By (2.1), has the matricizations
In particular, the rows of are right singular vectors of , the left singular vectors are unit vectors, and the singular values are the same as of , that is, . Hence has the specific property that
| 2.3 |
is a diagonal matrix of decreasing eigenvalues. The reverse relation
between and is called the higher-order singular value decomposition (HOSVD) of and has been introduced by De Lathauwer et al. [3].
Definition 2.4
Tensors satisfying (2.3) are called HOSVD tensors. The subset of HOSVD tensors in is denoted by , and the subset of HOSVD tensors in by .
HOSVD tensors can be regarded as representatives of orbits of orthogonally equivalent tensors. For , the representatives are essentially unique as stated next. Here it is instructive to note that for square matrices, the set consists of regular diagonal matrices with strictly decreasing diagonal entries.
Proposition 2.5
Let be two HOSVD tensors. If and are orthogonally equivalent, that is, , then the must be diagonal orthogonal matrices (i.e. with values on the diagonal).
The proof is immediate from (2.2), (2.3), and the uniqueness of orthogonal diagonalization up to sign flipping in the case of mutually distinct eigenvalues. Comparing with the explicit form (2.1), we see that the action of with diagonal with entries results in some sign flipping pattern for the entries of . This provides the following, sometimes useful necessary condition.
Proposition 2.6
If two HOSVD tensors are orthogonally equivalent, then . In particular, and have the same zero pattern.
We now turn to the manifold properties of .
Theorem 2.7
The set is a smooth embedded submanifold of of dimension
Proof
The formal setting is as follows. We denote by the space of symmetric matrices, by the subspace with zeros on the diagonal, by the orthogonal projection from onto , and . Consider
| 2.4 |
Then is a smooth map from to , and, by Definition 2.4, we have
Since the assertion will follow from the regular value theorem, if we show that is surjective for every . To prove the latter, we show that the range of contains the spaces for . We demonstrate this for . Consider the map
For brevity, we set . Since , it follows from the chain rule that the range of contains the range of . We show that the latter equals . Since , we have . Further noting that the tangent space to at I is the space of skew-symmetric matrices, we see that
As , it is enough to show that is injective in order to finish the proof. This now follows from the fact that, by definition of , the diagonal entries of are strictly decreasing, as it implies that cannot be diagonal for skew-symmetric . This, however, is equivalent to injectivity of as given above.
Remark 2.8
In our definition (2.3) of HOSVD tensors we required the diagonal elements of to be decreasing. This has advantages and drawbacks. One advantage are the narrower uniqueness properties leading to the practical condition in Proposition 2.6. A disadvantage is that it is more difficult to design HOSVD tensors “by hand” as in Sect. 2.4. Alternatively, one may define a set by just requiring the to be diagonal. Then for every we have , where are permutation matrices that sort the diagonal entries of accordingly. For mutually distinct eigenvalues the choice of is unique. The corresponding set is therefore the finite disjoint union of sets over all , and as such also an embedded submanifold of .
Degrees of freedom
A principal challenge in understanding the interconnection between higher-order singular values of tensors arises from the fact that, in contrast to the matrix case, the converse statement of Proposition 2.2 is in general not true when . Tensors may have the same higher-order singular values without being orthogonally equivalent. This can be seen from the following heuristic.
The set is open and dense in by Proposition 1.3, and therefore is a smooth manifold of dimension
The set is an open subset of Cartesian products of spheres and hence of dimension
Therefore, given , we expect the set of tensors having the same higher-order singular values as to be at least of “dimension”
When , by Proposition 2.3, this set cannot only consist of tensors that are orthogonally equivalent to .1 In fact, for large d, the orthogonally equivalent tensors will only be a very “low-dimensional” subset of .
A non-equivalent example
The previous considerations suggest that there must exist tensors having the same higher-order singular values without being orthogonally equivalent. We construct here an example of size using Proposition 2.6. Let us shortly count the degrees of freedom in this situation. The Euclidean unit sphere is of dimension seven, the set of potential tuples of higher-order singular values is of dimension three, while orbits of orthogonally equivalent tensors are of dimension at most three, too. This indicates for every an at least one-dimensional set of non-equivalent tensor with same higher-order singular values.
Using a common slice-wise notation of tensors, we consider (currently not normalized)
The three matricizations are , , and . In all three matricizations the rows are orthogonal, and the norm of the first row is larger than the norm of the second one. This shows that is a HOSVD tensor. Its squared higher-order singular values are
In particular, . As a second tensor consider
One checks again that all three matricizations , , and have orthogonal rows with squared row norms
This shows that and are two HOSVD tensors in with the same set of higher-order singular values. By Proposition 2.6, they are not orthogonally equivalent.
The set of feasible configurations
The set of feasible configurations has been defined in (1.2). In this section we investigate this set. A simple observation worth to mention is that is closed. This follows from Proposition 1.3 and the compactness of .
Not all configurations are feasible
When , we know that the singular values of a matrix and its transpose are the same, so trivially not all configurations for and are possible. The formal statement, using the introduced notation, reads, with ,
In fact, is an -dimensional subset in the -dimensional set .
This known phenomenon in the matrix case can be used to give a qualitative proof that also for higher-order tensors not all configurations are feasible. To start, we recall a fact on the HOSVD from the literature. Let have the left singular vector matrices (column-wise ordered by decreasing singular values), and multilinear rank . Then we can write the “economic” HOSVD as
where contains only the first columns of , and the core tensor is of size . The multilinear matrix product here corresponds to the action of the tensor product operator on , the explicit formulas are similar to (2.1). Note that if is non-singular, is just an HOSVD tensor in the orthogonally equivalent orbit of as defined above. The key observation in the general case is that is non-singular in , and its higher-order singular values in every direction are given by the nonzero higher-order singular values of [3].
Based on this fact, we can first give trivial examples of singular tensors for which the nonzero singular values in different directions are not independent of each other.
Lemma 3.1
Let have multilinear rank . Assume for . Then and .
Proof
Let be the economic HOSVD core tensor of . The matricizations for are just row vectors and have only one singular value which equals the Frobenius norm of . On the other hand, we have (up to possible permutations), which implies the result.
Since tensors with for considered in the previous lemma are naturally identified as elements of , that is, as matrices, the previous statement may appear rather odd at first. However, using a perturbation argument, it leads to a non-constructive proof that non-feasible configurations for higher-order singular values do exist even in the non-singular case. In fact, these configurations are of positive volume within .
Theorem 3.2
For , consider and such that
| 3.1 |
where the number of appended zeros on the right side equals . Let further , , denote neighbourhoods of in of diameter at most (w.r.t. some norm). For , let be similar neighbourhoods, but of and , respectively. Then there exists such that
that is, no is feasible.
Proof
Assume to the contrary that for every n there exists a tensor such that . The sequence of has a convergent subsequence with a limit . By Lemma 1.3, has higher-order singular values . Now Lemma 3.1 applies, but is in contradiction to (3.1).
Remark 3.3
The condition (3.1) can hold in two cases: (i) the number of nonzero singular values in direction one and two are the same (), but the singular values themselves are not, or (ii) . The second case has some interesting implications for rectangular tensors. Assume for instance . Then by Theorem 3.2 there cannot exist normalized non-singular tensors in for which the singular value vectors in directions are arbitrarily close to the corresponding unit vector . This surprising connection between mode sizes of the tensor and location of the singular value vectors is not obvious, especially given the fact that almost every tensor is non-singular (assuming (1.2)).
A conjecture on interior points
For we have seen that is a set of measure zero within , even when . One question is whether this is also true for higher-order tensors. Remarkably, the following experiment suggests that this does not need to be the case.
We generate random tensors of Frobenius norm one.2 With probability one, the higher-order singular values are elements of , which is a set of three dimensions and therefore can be visualized. We simply make the identification,
that is, we project on the first coordinate of each singular value vector. In Fig. 1 we see these projected points for 10,000 random examples, and their convex hull computed with a Matlab integrated Delauney triangulation.
Fig. 1.
Visualizing higher-order singular values in the case. Plotted are the vectors containing the largest singular values of the three directions for 10,000 random tensors . They seem to form a three-dimensional connected set. Hence, the corresponding set of should be of positive volume in the three-dimensional set
As the resulting point cloud appears three-dimensional, we suppose that the set of feasible configurations is also three-dimensional. But one can also verify in the plot that not all configurations are feasible. Above we made use of the fact that (Tucker rank in the direction j equals one) implies for . This can be seen in the picture as the convex polytope intersects the hyperplanes , and in single one-dimensional facets of 45 degree.
We are led to the following conjecture.
Conjecture 3.4
When , and given the compatibility condition (1.2), the set has positive (relative) volume in .
In fact, the following seems likely (under the same assumptions).
Conjecture 3.5
For generic , is a (relative) interior point of within .
Remark 3.6
During revision of the paper, a possible strategy to prove this conjecture has been revealed. It is based on the observation that is a relative interior point of if and only if the map (that has already been considered in (2.4)) is locally surjective when regarded as a map from the unit sphere to the Cartesian product of hyperplanes . In other words, one has to show that the rank of the derivative , when restricted to the tangent space , equals the maximum possible value . A sufficient condition for this is that is of rank on . However, as depends polynomially on the entries of , the function achieves its maximum value for almost all . Since it is bounded by , it is therefore enough to find a single tensor for which rank is achieved. In this way, one can validate Conjecture 3.5 for different configurations of by constructing random and evaluating the rank of numerically. A rigorous proof would have to confirm this numerical rank for “simple” candidates , which we were able to do for tensors so far. This approach shall be subject of a future work.
Alternating projection method
Even in the case that one would be given the information that a configuration is feasible, the question remains how to construct a corresponding tensor. Note that the suggested strategy to prove Conjecture 3.5 by showing full rank of (2.4) may not provide an explicit way for perturbing singular values in single directions.
A (currently) heuristic approach can be taken via the method of alternating projections. It is based on an alternative viewpoint on Problem 1.4: Given for , the configuration is feasible, if and only if there exists a tensor such that
| 3.2 |
where denotes the set of all tensors with mode-j singular values . More concretely,
The method of alternating projections tries to find satisfying (3.2) by successively projecting on the sets . It hence takes the form
| 3.3 |
where is a metric projection on the set , that is, returns a best approximation of in the set . A best approximation in Frobenius norm can be obtained by simply replacing the singular values of with :
| 3.4 |
Moreover, if , this best approximation is unique. To prove these assertions, note that the best approximation problem in Frobenius norm is equivalent to maximizing the trace of over all and , . The von Neumann trace inequality [15, 23] states that the upper bound for this quantity is . Moreover, equality is achieved at U, V if and only if , see [4, Remark 1.2]. Hence and are unique in the case that .
Although the interpretation as an alternating projection method is nice, we remark that the multiplication by in (3.4) could be omitted in practice. It is an easy induction to show that in this case an orthogonally equivalent sequence of tensors would be produced.
Even assuming that intersection points exist, we are currently not able to provide local or global convergence results for the alternating projection method (3.3). Instead, we confine ourselves with three numerical illustrations.
Recovering a feasible configuration
To obtain a feasible configuration , we create a norm-one tensor and take its higher-order singular values, . Then we run the iteration (3.3) starting from a random initialization, and measure the errors (Euclidean norm) after every full cycle of projections. Since is applied last, the singular values in direction three are always correct at the time the error is measured. The question is whether also the singular values in the other directions converge to the desired target values. The left plot in Fig. 2 shows one typical example of error curves observed in this kind of experiment in . We see that the sequence converges to , hence every cluster point of the sequence will have the desired higher-order singular values. So far, we have no theoretical explanation for the shifted peaks occurring in the curves.
Fig. 2.
Recovering a feasible configuration in via alternating projection. Left errors of singular value vectors. Right maximum difference between absolute values of entries of HOSVD core tensors of iterates and the generating tensor that provided the feasible configuration. As it does not go to zero, the limiting tensor is not orthogonally equivalent to the generating tensor
Since our initial guess is random, we do not expect that the generating or an orthogonally equivalent tensor will be recovered. To verify this, we make use of Proposition 2.6 and measure the error after every loop, where and are HOSVD representatives in the corresponding orbits of orthogonal equivalence. The right plot in Fig. shows this error curve, and we can see it does not tend to zero. By Proposition 2.6, the limiting tensor is hence not orthogonally equivalent to . Since this behaviour was observed being typical, the alternating projection method can be suggested as a practical procedure to construct tensors having the same higher-order singular values without being orthogonally equivalent.
Experiments with tensors of order and larger lead to similar results, but they quickly become computationally expensive as SVDs of large matrices have to be calculated.
Perturbation of a feasible configuration
To support Conjecture 3.5, we now consider random perturbations
of a known feasible configuration (obtained again from a random tensor ).3 According to the conjecture, we expect that for small the configuration is also feasible, so a corresponding tensor may be found by the alternating projection method (3.3). This can be verified in numerical experiments. The left plot in Fig. 3 shows the errors for one experiment in using .
Fig. 3.
Experiments in . Left perturbation of a given feasible configuration by with . Right infeasible configuration obtained using , but
Infeasible configuration
When conducting our experiments with the alternating projection method, we made the experience that with high probability even a randomly generated configuration will be feasible. Indeed, Fig. 1 supports this in the case, as the feasible configurations seem to make up a rather large fraction in .
To construct an infeasible configuration we therefore mimic the proof of Theorem 3.2: we generate as (as described in Footnote 3), where we use very small for , e.g., . By the arguments presented above this should also enforce to be close to to ensure feasibility. To impede this, we use larger and instead, e.g., (an alternative would be to generate and completely random). Our results suggest that this indeed results in an infeasible configuration. Accordingly, the alternating projection method fails. The right plot in Fig. 3 shows the outcome of one experiment, again in .
Acknowledgments
Open access funding provided by Max Planck Society.
Footnotes
For , i.e., matrices, it is the case: as (1.2) is assumed, we have , and two square matrices have the same singular values if and only if they are orthogonally equivalent. The formula gives which, however, only equals . The reason is that in the matrix case we know that the singular values of and are the same. Hence the feasible set is only of dimension , and not of dimension (the argument will be repeated in Sect. 3.1). For tensors, however, we conjecture that the dimension of is indeed , see Sect. 3.2.
For our experiments we made use of the Tensor Toolbox [2] in Matlab.
Practically, was generated by normalizing and sorting the perturbed .
Contributor Information
Wolfgang Hackbusch, Email: wh@mis.mpg.de.
André Uschmajew, Email: uschmajew@ins.uni-bonn.de.
References
- 1.Bachmayr M, Dahmen W. Adaptive near-optimal rank tensor approximation for high-dimensional operator equations. Found. Comput. Math. 2015;15(4):839–898. doi: 10.1007/s10208-013-9187-3. [DOI] [Google Scholar]
- 2.Bader, B.W., Kolda, T.G., et al.: Matlab tensor toolbox version 2.6 (2015). http://www.sandia.gov/~tgkolda/TensorToolbox/
- 3.De Lathauwer, L., De Moor, B., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21(4), 1253–1278 (2000, electronic)
- 4.de Sá EM. Exposed faces and duality for symmetric and unitarily invariant norms. Linear Algebra Appl. 1994;197(198):429–450. [Google Scholar]
- 5.de Silva V, Lim L-H. Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM J. Matrix Anal. Appl. 2008;30(3):1084–1127. doi: 10.1137/06066518X. [DOI] [Google Scholar]
- 6.Dieudonné J. Treatise on Analysis. New York: Academic Press; 1972. [Google Scholar]
- 7.Grasedyck, L.: Hierarchical singular value decomposition of tensors. SIAM J. Matrix Anal. Appl. 31(4), 2029–2054 (2009/2010)
- 8.Hackbusch W. Tensor Spaces and Numerical Tensor Calculus. Heidelberg: Springer; 2012. [Google Scholar]
- 9.Hackbusch W, Kühn S. A new scheme for the tensor representation. J. Fourier Anal. Appl. 2009;15(5):706–722. doi: 10.1007/s00041-009-9094-9. [DOI] [Google Scholar]
- 10.Hitchcock FL. The expression of a tensor or a polyadic as a sum of products. J. Math. Phys. 1927;6:164–189. doi: 10.1002/sapm192761164. [DOI] [Google Scholar]
- 11.Hitchcock FL. Multiple invariants and generalized rank of a -way matrix or tensor. J. Math. Phys. 1927;7:39–79. doi: 10.1002/sapm19287139. [DOI] [Google Scholar]
- 12.Koch O, Lubich C. Dynamical tensor approximation. SIAM J. Matrix Anal. Appl. 2010;31(5):2360–2375. doi: 10.1137/09076578X. [DOI] [Google Scholar]
- 13.Kolda TG, Bader BW. Tensor decompositions and applications. SIAM Rev. 2009;51(3):455–500. doi: 10.1137/07070111X. [DOI] [Google Scholar]
- 14.Lubich C, Rohwedder T, Schneider R, Vandereycken B. Dynamical approximation by hierarchical Tucker and tensor-train tensors. SIAM J. Matrix Anal. Appl. 2013;34(2):470–494. doi: 10.1137/120885723. [DOI] [Google Scholar]
- 15.Mirsky L. A trace inequality of John von Neumann. Monatsh. Math. 1975;79(4):303–306. doi: 10.1007/BF01647331. [DOI] [Google Scholar]
- 16.Oseledets I, Tyrtyshnikov E. TT-cross approximation for multidimensional arrays. Linear Algebra Appl. 2010;432(1):70–88. doi: 10.1016/j.laa.2009.07.024. [DOI] [Google Scholar]
- 17.Oseledets IV. Tensor-train decomposition. SIAM J. Sci. Comput. 2011;33(5):2295–2317. doi: 10.1137/090752286. [DOI] [Google Scholar]
- 18.Oseledets IV, Tyrtyshnikov EE. Breaking the curse of dimensionality, or how to use SVD in many dimensions. SIAM J. Sci. Comput. 2009;31(5):3744–3759. doi: 10.1137/090748330. [DOI] [Google Scholar]
- 19.Oseledets, I.V., Tyrtyshnikov, E.E.: Recursive decomposition of multidimensional tensors. Dokl. Akad. Nauk 427(1), 14–16 (2009, in Russian) [English translation in: Dokl. Math. 80(1), 460–462 (2009)]
- 20.Rohwedder T, Uschmajew A. On local convergence of alternating schemes for optimization of convex problems in the tensor train format. SIAM J. Numer. Anal. 2013;51(2):1134–1162. doi: 10.1137/110857520. [DOI] [Google Scholar]
- 21.Schneider R, Uschmajew A. Approximation rates for the hierarchical tensor format in periodic Sobolev spaces. J. Complex. 2014;30(2):56–71. doi: 10.1016/j.jco.2013.10.001. [DOI] [Google Scholar]
- 22.Tucker LR. Some mathematical notes on three-mode factor analysis. Psychometrika. 1966;31(3):279–311. doi: 10.1007/BF02289464. [DOI] [PubMed] [Google Scholar]
- 23.von Neumann J. Some matrix-inequalities and metrization of matrix-space. Tomsk. Univ. Rev. 1937;1:286–300. [Google Scholar]



