We propose two affine projection algorithms (APA)
with variable regularization parameter. The proposed algorithms
dynamically update the regularization parameter that is fixed in the
conventional regularized APA (R-APA) using a gradient descent
based approach. By introducing the normalized gradient, the proposed
algorithms give birth to an efficient and a robust update scheme for
the regularization parameter. Through experiments we demonstrate
that the proposed algorithms outperform conventional R-APA in
terms of the convergence rate and the misadjustment error.
 B. Widrow and S. D. Sterns, Adaptive Signal Processing, Englewood
Cliffs, NJ: Prentice Hall, 1985.
 S. Haykin, Adaptive Filter Theory, Englewood Cliffs, NJ: Prentice Hall,
 A. H. Sayed, Fundamentals of Adaptive Filtering, Englewood Cliffs,
NJ: Prentice Hall, 2003.
 K. Ozeki and T. Umeda, “An adaptive filtering algorithm using an
orthogonal projection to an affine subspace and its properties,” Electro.
Commun. Jpn., vol. 67-A, no. 5, pp. 19–27, 1984.
 H.-C. Shin and A. H. Sayed, “Mean-square peformance of a family of
affine projection algorithms,” IEEE Trans. Signal Processing, vol. 52,
pp. 90–102, Jan. 2004.
 V. Myllyl¨a and G. Schmidt, “Psedo-optimal regulariztion for affine
projection algorithms,” in Proc. IEEE Int. Conf. on Accoustics, Speech,
and Signal Processing, ICASSP’02, Orlando, Florida, May 2002,
 S. C. Douglas, “Generalized gradient adaptive step sizes for stochastic
gradient adaptive filters,” in Proc. IEEE Int. Conf. on Accoustics, Speech,
and Signal Processing, ICASSP’95, vol. 2, pp. 1396–1399, 1995.