title: Sparse representation in kernel machines.
abstract: We study the properties of least square kernel regression with l1 coefficient regularization. The kernels can be flexibly chosen to be either positive definite or indefinite. Asymptotic learning rates are deduced under smoothness condition on the kernel. Sparse representation of the solution is characterized theoretically. Empirical simulations and real applications indicate that both good learning performance and sparse representation could be guaranteed.
authors: Hongwei
authors: H
authors: Sun
authors: Qiang
authors: Q
authors: Wu