Typical $l_1$-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices
Yoshiyuki Kabashima, Mikko Vehkapera, Saikat Chatterjee
Introduction
The recovery problem of sparse vectors from a linear underdetermined set of equations has recently attracted attention in various fields of science and technology due to its many applications, for example, in linear regression , communication , , , multimedia , , , and compressive sampling (CS) , . In such a sparse representation problem, we have the following underdetermined set of linear equations
Recent results in the parallel problem of CS, where acts as a sensing matrix, reveal that the typical conditions for perfect -recovery are universal for all random sensing matrices that belong to the rotationally invariant matrix ensembles . The standard setup, where the entries of the sensing matrix are independent standard Gaussian, is an example that belongs to this ensemble. It is also known that the conditions required for perfect recovery do not in general depend on the details of the marginal distribution related to the non-zero elements. On the other hand, we know that correlations in the sensing matrix can degrade the performance of -recovery . This suggests intuitively that using a sample matrix of the rotationally invariant ensembles as is preferred in the recovery problem when we expect to encounter a variety of dense signals . However, the set of matrix ensembles whose -recovery performance are known is still limited, and further investigation is needed to assess whether the choice of is indeed so straightforward.
The purpose of the present study is to fulfill this demand. Specifically, we examine the typical -recovery performance of the matrices constructed by concatenating several randomly chosen orthonormal bases. Such construction has attracted considerable attention due to ease of implementation and theoretical elegance , , for designing sparsity inducing over-complete dictionaries for natural signals . For a practical engineering scheme, audio coding (music source coding) uses a dictionary formed by concatenating several modified discrete cosine transforms with different parameters.
By using the replica method in conjunction with the development of an integral formula for handling random orthogonal matrices, we show that the dictionary consisting of concatenated orthogonal matrices is also preferred in terms of the performance of -recovery. More precisely, the matrices can result in better -recovery performance than that of the rotationally invariant matrices when the density of non-zero entries of is not uniform among the orthogonal matrix modules, while the performance is the same between the two types of matrices for the uniform densities. This surprising result further promotes the use of the concatenated orthogonal matrices in practical applications.
This paper is organized as follows. In the next section, we explain the problem setting that we investigated. In Section 3, which is the main part of this paper, we discuss the development of a methodology for evaluating the recovery performance of the concatenated orthogonal matrices on the basis of the replica method and an integral formula concerning the random orthogonal matrices. In Section 4, we explain the significance of the methodology through application to two distinctive examples, the validity of which is also justified by extensive numerical experiments. The final section is devoted to a summary.
Problem Setting
With full knowledge of and , the -recovery is performed by solving the constrained minimization problem
For theoretically evaluating the -recovery performance, we assume that the entries of , are distributed independently according to a block-dependent sparse distribution
where means the density of the non-zero entries of the -th block of the same size in and is a distribution whose second moment about the origin is finite, which is assumed as unity for simplicity. Intuitively, as the compression rate decreases, the overall density up to which (9) can successfully recover a typical sample of the original vector becomes smaller. However, precise performance may depend on the profile of . The above setting allows us to quantitatively examine how such block dependence of the non-zero density affects the critical relation between and for typically successful -recovery of .
Statistical mechanics approach
and , constitutes the basis of our analysis. Equations (11) and (13) mean that can be identified with the average of the state variable for the Gibbs-Boltzmann distribution (13) in the vanishing temperature limit . However, as (13) depends on and , further averaging with respect to the generation of these external random variables is necessary for evaluating the typical properties of the -recovery. Evaluation of such “double averages” can be carried out systematically using the replica method .
2 Integral formula for handling random orthogonal matrices
Let us assume that -dimensional vectors are characterized by their norms as , where denotes the standard Euclidean norm of the vector . For these vectors, we define the function
where generally denotes the average of with respect to , and denotes the Haar measure of the orthogonal matrices. Our claim is that by explicitly using , (15) can be expressed as
where generally denotes the extremization of function with respect to . Expression (17) is derived from the fact that for fixed , moves uniformly on the surface of the -dimensional hypersphere of radius when varies according to the uniform distribution of the orthogonal matrices; therefore, in (15) can be replaced with a spherical measure of -dimensional vector . For details, see A.
Function physically represents a characteristic exponent of the probability that -dimensional vectors form a closed loop satisfying when they are independently and isotropically sampled under the norm constraints of . For small , the loop condition strongly restricts the region of to which is well defined. In concrete terms, diverges to minus infinity unless an equality
are satisfied for and , respectively. In particular, the constraint of (18) requires us to deal with the system of in a manner different from that of except for the case of , as discussed in the analysis of section 3.4.
3 Replica method
Now, we are ready to apply the replica method for analyzing the typical property of the -recovery (11). For this, we evaluate the -th moment of the partition function using the identity
Let us consider averaging (21) with respect to and define for each fixed set of :
where . When is placed in the configuration of the RS solution, the expression
holds for each , where stands for matrix transpose, , and . denotes an orthogonal matrix composed of the vector and an orthonormal set of vectors that are orthogonal to . This indicates that may be expressed as
3.2 Entropic part
On the other hand, inserting identities , and into (21) and taking an average concerning , in conjunction with integration with respect to dynamical variables , result in the expression
for a fixed set of . The conjugate variable is introduced for expressing a delta function as , and similarly for and . Notation stands for an integral measure , and the functions on the right hand side are defined as
where the average for is taken according to (10). The expression of (37) indicates that its rescaled logarithm is accurately evaluated using the saddle point method with respect to the conjugate variables in the large system limit . In addition, the replica symmetry guarantees that the relevant saddle point is of the RS form as , , and . As a consequence, the evaluation yields
3.3 Free energy and saddle point equations
and rescaled variables are introduced as , , , and to properly describe the relevant solution in the limit of . Extremization is to be performed with respect to .
Similar to earlier studies, at the extremum characterized by a set of the saddle point equations
and physically denote the macroscopic averages of the recovered vector as and , respectively. Here, is provided by the extremum solution of (17) for , and
For , a Lagrange multiplier should be exceptionally introduced in (48) for enforcing .
The success of the -recovery is characterized by the condition in which is satisfied at the extremum for . Therefore, one can evaluate the critical relation between and by examining the thermodynamic stability of the success solution for the saddle point equations (47)–(52).
We assume for a while, since an exceptional treatment is required for . For obtaining the success solution, it is necessary that and hold. Expanding (50)–(52) under the assumption of yields
and we used , which is derived from the assumption (10). These result in the expression
holds, where is the solution of coupled equations
where we denote and This expression makes it possible to evaluate as
where , and . Inserting (61), (62), and (66) into (48) yields a set of equations to determine for a given set of non-zero densities
where we set and used the relation , which is obtained from (47) and (63).
Equations (48) and (59) indicate that the critical condition for making stable is expressed as
For characterizing the critical condition for the success of the -recovery, let us suppose that the set of non-zero densities is provided as a function of a single parameter as . For , the critical situation is specified by an appropriate set of variables of , , and . These are provided by conditions of (68)–(70).
On the other hand, the critical condition for is provided differently from (68)–(70) because the constraint of for keeping well defined requires for any pair of and . Explicitly, the condition is provided by the following four coupled equations:
where is a Lagrange parameter for enforcing . These determine four variables of at the critical condition.
Equations (68)–(70) for and (71)–(74) for constitute the main result of this paper. For , an equivalent result can also be obtained in a slightly different manner .
5 Validity of RS evaluation
The above calculation can be generalized to arbitrary levels of replica symmetry breaking (RSB). For example, under one-step RSB (1RSB) ansatz, where replicas of each block are classified into groups of an identical size and their overlaps are assumed to be if and belong to the same group and otherwise, (34) and (42) are modified as
respectively, where .
In the 1RSB framework, the RS solution is regarded as a special solution of and (). In the limit of and keeping , the critical condition that a solution of and bifurcates from the RS solution, which corresponds to the de Almeida-Thouless (AT) condition of the current system, is expressed as
where and .
holds for the success solution at the critical condition of the -recovery. Equation (80) yields an eigenvalue of unity whose eigenvector is given as , which makes (79) hold. Similarly, (79) is also satisfied at the critical condition of the -recovery of . These validate our RS evaluation in terms of the local stability analysis, although further justification with other schemes, such as comparison with numerical experiments, is necessary for examining possibilities that the RS solution becomes thermodynamically irrelevant due to discontinuous phase transitions.
Case studies
Let us examine the significance of the developed methodology by applying it to two representative examples.
We consider the uniform density case of () as the first example, where the uniformity allows us to solve (47)–(52) setting all variables to be independent of as . In particular, setting simplifies the expressions of (47)–(49) providing and . This makes it unnecessary to deal with the saddle point problems of in an exceptional manner. As a consequence, the critical condition of the -recovery is expressed compactly by using a pair of equations as
for both and . By setting , these provide a critical condition identical to that obtained for the rotationally invariance matrix ensembles in earlier studies . This indicates that for vectors of the uniform non-zero density, the -recovery performance of the concatenated orthogonal matrices is identical to that of the standard setup provided by the matrix of independent standard Gaussian entries.
However, this is not the case when the non-zero density is not uniform. As a distinctive example, we examined the case of localized density, which is characterized by setting and for . Such an assumption is plausible in handling various kinds of real world signals at least as a first approximation; due to the intrinsic nature of real world signals, one can expect that the density of the sparsest expression is localized in a certain block when the concatenation of identity and randomly chosen Fourier/wavelet bases, which is a representative example of the -concatenation of orthonormal bases, is employed. Table 1 and Figure 1 show critical values of the total non-zero density given the compression rate for the uniform and localized density cases. These show that the concatenated matrices always result in better -recovery performance for vectors of the localized densities, and the significance increases as becomes smaller while matrices of rotationally invariant ensembles result in identical performance as long as is unchanged. It is noteworthy that the performance gain is obtained without utilizing the knowledge of the profile of in the recovery stage. This indicates that, in addition to their ease of implementation and theoretical elegance, the concatenated orthogonal matrices are preferred for practical use in terms of their high recovery performance for vectors of non-uniform non-zero densities.
2 Numerical justification
Summary
Promising future studies include performance evaluation in the case of noisy situations and development of approximate recovery algorithms suitable for the concatenated orthogonal matrices .
Appendix A Derivation of (17)
We insert the Fourier expressions of -function
Evaluating this by means of the saddle point method with respect to results in
Similarly, the denominator of (84) is evaluated as
Substituting (84), (91), and (92) into (15) leads to the expression of (17).