The above Lemma states that the optimal solution W t+1 in line 5 of Algorithm 2 is also a sparse vector.
it is desirable to optimize the W t+1 in a low complexity independent on d. If so, we can easily see that if we set W 1 as a sparse vector, W t is sparse for all t > 1 by a mathematical induction.