STARK: Structured Dictionary Learning Through Rank-one Tensor Recovery

11/13/2017 ∙ by Mohsen Ghassemi, et al. ∙ Rutgers University 0

In recent years, a class of dictionaries have been proposed for multidimensional (tensor) data representation that exploit the structure of tensor data by imposing a Kronecker structure on the dictionary underlying the data. In this work, a novel algorithm called "STARK" is provided to learn Kronecker structured dictionaries that can represent tensors of any order. By establishing that the Kronecker product of any number of matrices can be rearranged to form a rank-1 tensor, we show that Kronecker structure can be enforced on the dictionary by solving a rank-1 tensor recovery problem. Because rank-1 tensor recovery is a challenging nonconvex problem, we resort to solving a convex relaxation of this problem. Empirical experiments on synthetic and real data show promising results for our proposed algorithm.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

Sparse representations of data have been widely used in a variety of information processing tasks such as data compression, feature extraction, data classification, signal denoising and inpainting, and audio processing 

[1, 2, 3]. One of the powerful techniques to obtain sparse representations is dictionary learning (DL) which can be formulated as


We wish to find an overcomplete basis with unit-norm columns and dictionary coefficient matrix such that each observation is represented by a linear combination of no more than columns of . Since this problem is not convex, it is typically solved by alternating minimization; is updated using a fixed and then, is updated using a fixed  [3].

In traditional DL literature, when dealing with multidimensional data, high order data (tensors of order

or higher) are vectorized and stacked in columns of an observation matrix

: the structure of the data is not considered in the dictionary underlying the data. In this case, any standard DL method can be used to find sparse representations of data. This simplistic method disregards the multidimensional structure in the data and does not capture the correlation and structure along different dimensions in each original “data point.”

On the other hand, in structured DL methods for tensor data, the multidimentional structure in data is taken into account. There exists a class of DL algorithms for tensor data that are based on the Tucker decomposition [4] of tensors. The resulting “Kronecker structured” DL methods (KS-DL) assume the dictionary consists of the Kronecker product [5] of smaller subdictionaries. Such algorithms represent tensor data using many fewer parameters compared to vectorized DL techniques [6, 7, 8, 9]

. This is due to the fact that the number of degrees of freedom in the KS-DL problem is significantly less than the traditional DL problem; this suggests that dictionary recovery is possible with smaller sample complexity using KS-DL methods

[10, 11]. These works provide KS-DL algorithms to represent second order [6, 7, 8] and 3rd-order tensors [9]. In [6], for example, the KS-DL objective function is minimized using a Riemannian conjugate gradient method along with a nonmonotonic line search. In other methods, the subdictionaries composing the KS dictionary are updated alternately; in [7], an approach similar to K-SVD [3] is employed that uses higher-order SVD (HOSVD) [12] to alternately update coordinate dictionaries for second order tensor data and in [9], gradient descent is used to alternately update coordinate dictionaries for third order tensor data. The dictionary update stage in these algorithms involves solving a nonconvex minimization problem. The central challenge in the theoretical analysis of such KS-DL solvers is that the dictionary update stage is nonconvex. Furthermore, these explicit models are specialized to KS problems: they do not extend to more general structures in the underlying dictionary. In contrast, Dantas et al. [8] recently proposed an algorithm to learn the sum of KS dictionaries that represent second order tensor data by adding a regularizer in the objective function.

In this paper, we propose a novel algorithm called “STARK” to learn KS dictionaries for th-order tensor data (). Our method involves adding a regularization term to the objective function of the DL problem defined in (1). The motivation for this term comes from the following realization: elements of any KS matrix can be rearranged to form a rank-

tensor. Thus, enforcing a rank-1 constraint on such rearrangement of the dictionary results in a KS dictionary. To this end, we take advantage of low-rank tensor estimation literature 

[13, 14, 15, 16, 17] to add a convex regularizer that imposes low-rankness on the rearrangement tensor. This formulation has the advantage that it can be used to learn KS dictionaries as well as the case where the underlying dictionary is better approximated by sum of KS dictionaries. Our method can learn dictionaries of arbitrary tensor order; in the case of second order tensor data our general formulation coincides with that of Danita’s et al. [8].

We conduct numerical experiments to validate the performance of our algorithm. We use STARK for representation of third order synthetic and real tensor data and demonstrate that STARK outperforms vectorized DL technique K-SVD [3] and KS-DL technique K-HOSVD [7] for small sample sizes.

Notation Convention: Underlined bold upper-case, bold upper-case and lower-case letters are used to denote tensors, matrices and vectors, respectively. Lower-case letters denote scalars. We denote the Kronecker product and outer product by and , respectively, while denotes the mode product between a tensor and a matrix [18]. Norms are given by subscripts, so and are the and norms of , while , , and are the spectral, Frobenius, and nuclear norms of , respectively. A slice of a tensor is a -dimensional section defined by fixing all but two of its indices. Particularly, a frontal slice of a -dimensional tensor is defined by fixing the third index.

Ii Tucker-Based KS-DL

According to the Tucker decomposition of tensors, an -th order data tensor can be decomposed in the following form:


where denotes the core tensor and ’s denote transformation matrices along each mode of . The vectorized version of can be written as


where and [18]. Here, the structure in tensor data is being exploited using the Kronecker product of transformation matrices. Stacking vectorized data points in columns of a matrix , we get


which is similar to the conventional DL problem, except that the dictionary is Kronecker structured.

In the next section, we present our proposed KS-DL algorithm called “STructured dictionAry learning through RanK-1 Tensor recovery” (STARK), which implicitly enforces Kronecker structure on the dictionary being learned by means of a regularizer in the DL objective function.

We note that STARK can be used to enforce a more general structure called low-separation-rank (LSR) structure. An LSR matrix can be written as sum of a few KS matrices:


where the factor matrices have the same size for a fixed , and is the separation rank of  [19].

Iii Enforcing Structure via Regularization

To motivate the idea behind STARK, let us consider . It turns out that the elements of can be rearranged to form , where for [5]. Figure 1 illustrates this rearrangement for . Similarly, for , we can write , where each frontal slice of the tensor is a scaled copy of . Following a similar procedure, we can show that if , then a certain “rearrangement” of is the rank- tensor where for . This suggests that in the structured DL problem, we can impose the LSR structure (KS when ) on the dictionary being learned by minimizing the rank of .

Since tensor rank is a nonconvex function, in order to make this DL problem convex with respect to , we use a commonly used convex proxy for the tensor rank function, the sum-trace-norm [15], which is defined as the average of the trace (nuclear) norms of the unfoldings of the tensor: Using this convex relaxation for the rank function, the KS-DL problem has the following form:


where the columns of have unit norm. We use alternating minimization to solve this nonconvex problem. To minimize the objective function in (6) with respect to , we can use any of the standard sparse coding methods. In simulations, we use orthogonal matching pursuit (OMP) [20, 21]. To update the KS dictionary , we use the alternating direction method of multipliers (ADMM) [22]. We describe this dictionary update step in the next section.

Fig. 1: Example of rearranging a KS matrix into a rank-1 matrix.

Iv Structured Dictionary Update Using ADMM

In this section, we discuss the dictionary update step of solving problem (6), which can be stated as


The main issue in solving the convex dictionary update problem (7) is dealing with the interdependent nuclear norms. This makes optimization methods that use gradient information challenging. Inspired by many works in the literature on low-rank tensor estimation [14, 13, 15, 16], we instead suggest the following reformulation of (7):


In this formulation, although the nuclear norms are associated with one another through the introduced constraint, we can decouple the minimization problem into separate subproblems. In particular, we can solve the objective function (IV) using ADMM, which involves decoupling the problem into independent subproblems by forming the following augmented Lagrangian function:


where and . Here, the inner product of two tensors is defined as the inner product of their vectorizations.

Finally, to find the gradient of (IV) with respect to , we rewrite the Lagrangian function in the following form


Here, we defined and , where and is a permutation matrix such that .

In the rest of this section, we briefly discuss derivation of the permutation matrix as well as the update steps of ADMM. Due to lack of space, we leave the details to an extended version of this paper.

Iv-a The Permutation Matrix

The permutation matrix

represents a linear transformation that maps the elements of

to . Given index of and the corresponding mapped index of , our strategy for finding the permutation matrix is to define as a function of . To this end, we first find the the corresponding row and column indices of matrix from the th element of . Then, we find the index of the element of interest on the th order rearranged tensor , and finally, we find its location on . Note that the permutation matrix is only a function of the dimensions of the factor matrices. We leave the formal explanation of this procedure to an extended version of this paper.

Iv-B ADMM Update Rules

Recall that each iteration of ADMM consists of the following steps [22]:


where is the vertical concatenation of instances of , the identity operator on .

The solution to problem (11) is found by taking the gradient of with respect to and setting it to zero. Suppressing the iteration index for ease of notation, we have

where denotes the adjoint of the linear operator [13]. Setting the gradient to zero results in


Equivalently, we have,


Therefore, the update rule for is


To update , we can break the second step (12) into solving independent subproblems (suppressing the index ):

The objective function of this problem can be reformulated as


The minimizer of an objective function of the form (IV-B) is


where is the shrinkage operator that applies soft-thresholding at level

on the singular values of

(see Theorem 2.1 in [23] for details). Therefore,


where is the inverse of the unfolding operator. The summary of our DL method is provided in Algorithm 1.

0:  ,
1:  initialize: , , ,  
3:  while  do
4:     Sparse coding stage: Use OMP to update .
5:     Dictionary update stage:
6:        while  do
7:           Update according to update rule (IV-B)
8:           for all  do
9:              Update according to update rule (IV-B)
10:           end for
11:           for all  do
13:           end for
14:        end while
15:        Normalize columns of
16:  end while
17:  return  
Algorithm 1 Structured Dictionary Learning through Rank-1 Tensor Recovery (STARK)

V Numerical Experiments

We compare the performance of STARK with two methods: KSVD [3], as a non-structured DL method, and K-HOSVD [7], which is a structured DL method that explicitly enforces Kronecker structure on the dictionary. We compare the performance of these methods are compared for synthetic -dimensional and -dimensional data as well as -dimensional real-world data.

Synthetic Data

For synthetic data, we randomly generate the dictionary and the sparse coefficient matrix to construct the observation matrix . We generate a KS dictionary as (and for -dimensional data) with unit-norm columns according to the following procedure. The elements of the subdictionaries through

are chosen i.i.d from a Gaussian distribution

, and then the columns of the subdictionaries are normalized. For generating , we select the locations of the nonzero elements of each column uniformly at random. The values of those elements are sampled i.i.d. from . In the learning process, the dictionary is initialized using random columns of the observation matrix . The experiments were run for 20 Monte Carlo iterations and for various training sample sizes and the resulting dictionaries were tested on a set of test samples. For 2nd-order tensor data we selected , , , , , and for 3rd-order tensor data we selected , , , , , , and .

The results of our experiments on synthetic data are shown in Figure 2. We compared our method to K-SVD and K-HOSVD. For K-HOSVD, we used algorithm provided by the authors, which actually enforces a Khatri-Rao structure on the dictionary rather than KS. STARK outperforms both K-SVD and K-HOSVD for all training sample sizes, especially when the number of training samples is small. The improvement over K-SVD can be attributed to the lower sample complexity of structured DL models. We conjecture that one reason for the improvement over K-HOSVD is that the dictionary update in STARK is a convex problem and thus the algorithm is less prone to getting stuck in a poor local minimum.

Fig. 2: Normalized Representation Error on Synthetic Data.

Real Data

For these experiments, we compare the denoising performance of the three methods on two RGB images, Peppers and Lena, which are and tensors, respectively. We corrupt the images using additive white Gaussian noise with . To construct the training data set, we extract overlapping patches from each image and treat each patch as a data point. Then we compare the denoising performances of the methods based on the resulting peak signal to noise ratio (PSNR) of the reconstructed images [24].

Figure 3 shows the results averaged over 10 Monte Carlo iterations. We can see the denoising performance of STARK is superior to both K-SVD and K-HOSVD for all training sample sizes. This is in part due to the fact that for real-world data, the underlying dictionaries may not be KS. STARK allows to have rank higher than , meaning the algorithm can use a larger number of parameters ( times as many when ) to approximate the true dictionary.

Fig. 3: Denoising Performance on Real Data (PSNR).

Vi Conclusion

In this paper we showed that the Kronecker product of matrices can be rearranged to form an th order rank-1 tensor. Based on this, we proposed a novel structured dictionary learning method for multidimensional data that enforces LSR structure in the dictionary through imposing a low-rank structure on the rearranged tensor. In particular, Kronecker structure can be enforced by imposing a rank-1 constraint on the rearranged tensor. Since the low-rank tensor recovery problem is a nonconvex problem, we resort to solving its convex relaxation, namely, minimizing the sum-trace-norm of the rearranged tensor, which is a convex proxy for tensor rank. We used ADMM for solving the dictionary update stage of this structured DL problem. Our experiments on both synthetic and real data showed that when the sample size is small, our method considerably outperforms both K-SVD, which returns unstructured dictionaries, and K-HOSVD, a KS-DL method that directly finds the subdictionaries.


  • [1] K. Kreutz-Delgado, J. F. Murray, B. D. Rao, K. Engan, T.-W. Lee, and T. J. Sejnowski, “Dictionary learning algorithms for sparse representation,” Neural computation, vol. 15, no. 2, pp. 349–396, February 2003. [Online]. Available:
  • [2]

    M. Elad, J.-L. Starck, P. Querre, and D. L. Donoho, “Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA),”

    Appl. and Computational Harmonic Anal., vol. 19, no. 3, pp. 340–358, November 2005. [Online]. Available:
  • [3] M. Aharon, M. Elad, and A. Bruckstein, “-SVD: An algorithm for designing overcomplete dictionaries for sparse representation,” IEEE Trans. Signal Process., vol. 54, no. 11, pp. 4311–4322, November 2006. [Online]. Available:
  • [4] L. R. Tucker, “Implications of factor analysis of three-way matrices for measurement of change,” Problems in Measuring Change, pp. 122–137, 1963.
  • [5] C. F. Van Loan, “The ubiquitous Kronecker product,” J. Computational and Appl. Math., vol. 123, no. 1, pp. 85–100, November 2000. [Online]. Available:
  • [6] S. Hawe, M. Seibert, and M. Kleinsteuber, “Separable dictionary learning,” in

    Proc. IEEE Conf. Comput. Vision and Pattern Recognition (CVPR)

    , June 2013, pp. 438–445. [Online]. Available:
  • [7] F. Roemer, G. Del Galdo, and M. Haardt, “Tensor-based algorithms for learning multidimensional separable dictionaries,” in Proc. IEEE Int. Conf. Acoustics, Speech and Signal Process. (ICASSP), May 2014, pp. 3963–3967. [Online]. Available:
  • [8] C. F. Dantas, M. N. da Costa, and R. da Rocha Lopes, “Learning dictionaries as a sum of Kronecker products,” IEEE Signal Process. Lett., vol. 24, no. 5, pp. 559–563, March 2017. [Online]. Available:
  • [9] S. Zubair and W. Wang, “Tensor dictionary learning with sparse Tucker decomposition,” in Proc. IEEE 18th Int. Conf. Digital Signal Process. (DSP), July 2013, pp. 1–6. [Online]. Available:
  • [10] Z. Shakeri, W. U. Bajwa, and A. D. Sarwate, “Minimax lower bounds for Kronecker-structured dictionary learning,” in Proc. 2016 IEEE Int. Symp. Inf. Theory, July 2016, pp. 1148–1152. [Online]. Available:
  • [11] ——, “Minimax lower bounds on dictionary learning for tensor data,” arXiv preprint arXiv:1608.02792, August 2016. [Online]. Available:
  • [12]

    L. De Lathauwer, B. De Moor, and J. Vandewalle, “A multilinear singular value decomposition,”

    SIAM J. Matrix Analy. and Applicat., vol. 21, no. 4, pp. 1253–1278, 2000. [Online]. Available:
  • [13] S. Gandy, B. Recht, and I. Yamada, “Tensor completion and low-n-rank tensor recovery via convex optimization,” Inverse Problems, vol. 27, no. 2, p. 025010, January 2011. [Online]. Available:
  • [14] B. Romera-Paredes, H. Aung, N. Bianchi-Berthouze, and M. Pontil, “Multilinear multitask learning,” in Proc. 30th Int. Conf. Mach. Learn. (ICML), vol. 28, no. 3, Atlanta, Georgia, USA, June 2013, pp. 1444–1452. [Online]. Available:
  • [15]

    K. Wimalawarne, M. Sugiyama, and R. Tomioka, “Multitask learning meets tensor factorization: Task imputation via convex optimization,” in

    Proc. Advances in Neural Inform. Process. Syst. (NIPS), 2014, pp. 2825–2833. [Online]. Available:
  • [16] B. Huang, C. Mu, D. Goldfarb, and J. Wright, “Provable low-rank tensor recovery,” Optimization-Online, vol. 4252, p. 2, February 2014. [Online]. Available:
  • [17] J. Liu, P. Musialski, P. Wonka, and J. Ye, “Tensor completion for estimating missing values in visual data,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 35, no. 1, pp. 208–220, January 2013. [Online]. Available:
  • [18] T. G. Kolda and B. W. Bader, “Tensor decompositions and applications,” SIAM Review, vol. 51, no. 3, pp. 455–500, August 2009. [Online]. Available:
  • [19] T. Tsiligkaridis and A. O. Hero, “Covariance estimation in high dimensions via Kronecker product expansions,” IEEE Trans. Signal Process., vol. 61, no. 21, pp. 5347–5360, November 2013. [Online]. Available:
  • [20] Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, “Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition,” in Proc. 27th Asilomar Conf. Signals, Syst. and Comput., November 1993, pp. 40–44 vol.1. [Online]. Available:
  • [21] J. A. Tropp and A. C. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,” IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4655–4666, December 2007. [Online]. Available:
  • [22] S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Found. Trends Mach. Learn., vol. 3, no. 1, pp. 1–122, January 2011. [Online]. Available:
  • [23] J.-F. Cai, E. J. Candès, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM J. Optimization, vol. 20, no. 4, pp. 1956–1982, March 2010. [Online]. Available:
  • [24] A. Hore and D. Ziou, “Image quality metrics: PSNR vs. SSIM,” in Proc. IEEE int. conf. Pattern recognition (ICPR), August 2010, pp. 2366–2369. [Online]. Available: