Sparse Representer Theorems for Learning in Reproducing Kernel Banach Spaces

arXiv:2305.12584v2 Announce Type: replace-cross
Abstract: Sparsity of a learning solution is a desirable feature in machine learning. Certain reproducing kernel Banach spaces (RKBSs) are appropriate hypothesis spaces for sparse learning methods. The goal of this paper is to understand what kind of RKBSs can promote sparsity for learning solutions. We consider two typical learning models in an RKBS: the minimum norm interpolation (MNI) problem and the regularization problem. We first establish an explicit representer theorem for solutions of these problems, …

abstract arxiv cs.lg feature hypothesis kernel kind machine machine learning math.fa paper promote solution solutions spaces sparsity type