Sampling and Reconstruction of Signals in a Reproducing Kernel Subspace of Lp(Rd)L^p({\Bbb R}^d)

In this paper, we consider sampling and reconstruction of signals in a reproducing kernel subspace of L^p(\Rd), 1\le p\le \infty, associated with an idempotent integral operator whose kernel has certain off-diagonal decay and regularity. The space of $p$-integrable non-uniform splines and the shift-invariant spaces generated by finitely many localized functions are our model examples of such reproducing kernel subspaces of L^p(\Rd). We show that a signal in such reproducing kernel subspaces can be reconstructed in a stable way from its samples taken on a relatively-separated set with sufficiently small gap. We also study the exponential convergence, consistency, and the asymptotic pointwise error estimate of the iterative approximation-projection algorithm and the iterative frame algorithm for reconstructing a signal in those reproducing kernel spaces from its samples with sufficiently small gap

Solving Support Vector Machines in Reproducing Kernel Banach Spaces with Positive Definite Functions

In this paper we solve support vector machines in reproducing kernel Banach spaces with reproducing kernels defined on nonsymmetric domains instead of the traditional methods in reproducing kernel Hilbert spaces. Using the orthogonality of semi-inner-products, we can obtain the explicit representations of the dual (normalized-duality-mapping) elements of support vector machine solutions. In addition, we can introduce the reproduction property in a generalized native space by Fourier transform techniques such that it becomes a reproducing kernel Banach space, which can be even embedded into Sobolev spaces, and its reproducing kernel is set up by the related positive definite function. The representations of the optimal solutions of support vector machines (regularized empirical risks) in these reproducing kernel Banach spaces are formulated explicitly in terms of positive definite functions, and their finite numbers of coefficients can be computed by fixed point iteration. We also give some typical examples of reproducing kernel Banach spaces induced by Mat\'ern functions (Sobolev splines) so that their support vector machine solutions are well computable as the classical algorithms. Moreover, each of their reproducing bases includes information from multiple training data points. The concept of reproducing kernel Banach spaces offers us a new numerical tool for solving support vector machines.Comment: 26 page