Revisiting adaptive least-squares estimation and application to online sparse signal recovery

This paper presents a novel time-adaptive estimation technique by revisiting the classical Wiener-Hopf equation. Any convex and not necessarily differentiable function can be used for enlarging the Wiener-Hopf equation in order to incorporate the often met, in practice, measurement and model inaccuracies. Unlike classical techniques, e.g., the Recursive Least Squares (RLS) algorithm, the proposed method is free of the computation of the inverse of a correlation matrix. Moreover, the method offers the means for dealing with the presence of convex constraints in an efficient way, by exploiting general convex analytic tools. To validate the proposed estimation method, an application of increasing importance nowadays, the online sparse signal recovery task is considered. Numerical results support the introduced theoretical arguments against the sparsity-aware classical batch, and the very recently introduced RLS-based signal recovery techniques.

[1]  Georgios B. Giannakis,et al.  Online Adaptive Estimation of Sparse Signals: Where RLS Meets the $\ell_1$ -Norm , 2010, IEEE Transactions on Signal Processing.

[2]  H. Zou The Adaptive Lasso and Its Oracle Properties , 2006 .

[3]  丸山 徹 Convex Analysisの二,三の進展について , 1977 .

[4]  Georgios B. Giannakis,et al.  RLS-weighted Lasso for adaptive estimation of sparse signals , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[5]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[6]  Alfred O. Hero,et al.  Sparse LMS for system identification , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[7]  Sergios Theodoridis,et al.  Adaptive algorithm for sparse system identification using projections onto weighted ℓ1 balls , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

[8]  Alexander J. Smola,et al.  Learning with kernels , 1998 .

[9]  Sergios Theodoridis,et al.  Online Sparse System Identification and Signal Reconstruction Using Projections Onto Weighted $\ell_{1}$ Balls , 2010, IEEE Transactions on Signal Processing.

[10]  I. Daubechies,et al.  Iteratively reweighted least squares minimization for sparse recovery , 2008, 0807.0575.

[11]  P. L. Combettes The foundations of set theoretic estimation , 1993 .

[12]  Isao Yamada,et al.  Asymptotic minimization of sequences of loss functions constrained by families of quasi-nonexpansive mappings and its application to online learning , 2010, ArXiv.

[13]  Paulo Sergio Ramirez,et al.  Fundamentals of Adaptive Filtering , 2002 .

[14]  Stephen P. Boyd,et al.  Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.