title: Quantized kernel least mean square algorithm.
abstract: In this paper, we propose a quantization approach, as an alternative of sparsification, to curb the growth of the radial basis function structure in kernel adaptive filtering. The basic idea behind this method is to quantize and hence compress the input (or feature) space. Different from sparsification, the new approach uses the "redundant" data to update the coefficient of the closest center. In particular, a quantized kernel least mean square (QKLMS) algorithm is developed, which is based on a simple online vector quantization method. The analytical study of the mean square convergence has been carried out. The energy conservation relation for QKLMS is established, and on this basis we arrive at a sufficient condition for mean square convergence, and a lower and upper bound on the theoretical value of the steady-state excess mean square error. Static function estimation and short-term chaotic time-series prediction examples are presented to demonstrate the excellent performance.
authors.forename: Badong
authors.initials: B
authors.lastname: Chen
authors.forename: Songlin
authors.initials: S
authors.lastname: Zhao
authors.forename: Pingping
authors.initials: P
authors.lastname: Zhu
authors.forename: José C
authors.initials: JC
authors.lastname: Príncipe