08.10.2016 Views

Foundations of Data Science

2dLYwbK

2dLYwbK

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

A T S A S is invertible. We will prove that this w satisfies the conditions <strong>of</strong> Theorem 10.3.<br />

First, for coordinates in S,<br />

as required.<br />

For coordinates in ¯S, we have<br />

(A T w) S = (A S ) T A S (A T SA S ) −1 z = z<br />

(A T w) ¯S = (A ¯S) T A S (A T SA S ) −1 z.<br />

Now, the eigenvalues <strong>of</strong> A T S A S, which are the squares <strong>of</strong> the singular values <strong>of</strong> A S , are<br />

between (1 − δ s ) 2 and (1 + δ s ) 2 . So ||(A T S A S) −1 || ≤ 1<br />

(1−δ S<br />

. Letting p = (A T ) 2 S A S) −1 z, we<br />

have |p| ≤<br />

√ s<br />

(1−δ S<br />

. Write A<br />

) 2 s p as Aq, where q has all coordinates in ¯S equal to zero. Now,<br />

for j ∈ ¯S<br />

(A T w) j = e T j A T Aq<br />

and part (2) <strong>of</strong> Lemma 10.4 gives |(A T w) j | ≤ 9δ s+1<br />

√ s/(1 − δ<br />

2<br />

s ) ≤ 1/2 establishing the<br />

Theorem 10.3 holds.<br />

A Gaussian matrix is a matrix where each element is an independent Gaussian variable.<br />

Gaussian matrices satisfy the restricted isometry property. (Exercise ??)<br />

10.4 Applications<br />

10.4.1 Sparse Vector in Some Coordinate Basis<br />

Consider Ax = b where A is a square n×n matrix. The vectors x and b can be considered<br />

as two representations <strong>of</strong> the same quantity. For example, x might be a discrete time<br />

sequence with b the frequency spectrum <strong>of</strong> x and the matrix A the Fourier transform. The<br />

quantity x can be represented in the time domain by x and in the frequency domain by its<br />

Fourier transform b. In fact, any orthonormal matrix can be thought <strong>of</strong> as a transformation<br />

and there are many important transformations other than the Fourier transformation.<br />

Consider a transformation A and a signal x in some standard representation. Then<br />

y = Ax transforms the signal x to another representation y. If A spreads any sparse<br />

signal x out so that the information contained in each coordinate in the standard basis is<br />

spread out to all coordinates in the second basis, then the two representations are said to<br />

be incoherent. A signal and its Fourier transform are one example <strong>of</strong> incoherent vectors.<br />

This suggests that if x is sparse, only a few randomly selected coordinates <strong>of</strong> its Fourier<br />

transform are needed to reconstruct x. In the next section we show that a signal cannot<br />

be too sparse in both its time domain and its frequency domain.<br />

339

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!