The “kernel trick” is well established as a means of constructing nonlinear algorithms from linear ones, by transferring the linear algorithms to a high dimensional feature space: specifically, a reproducing kernel Hilbert space (RKHS). Recently, it has become clear that a potentially more far reaching use of kernels is as a linear way of dealing with higher order statistics, by embedding proba...

In this paper we consider quantile regression in reproducing kernel Hilbert spaces, which we refer to as kernel quantile regression (KQR). We make three contributions: (1) we propose an efficient algorithm that computes the entire solution path of the KQR, with essentially the same computational cost as fitting one KQR model; (2) we derive a simple formula for the effective dimension of the KQR...

Suppose H is a space of functions on X. If H is a Hilbert space with reproducing kernel then that structure of H can be used to build distance functions on X. We describe some of those and their interpretations and interrelations. We also present some computational properties and examples.

A reproducing kernel Hilbert space (RKHS) has four well-known easily derived properties. Since these properties are usually not emphasized as a simple means of gaining insight into RKHS structure, they are singled out and proved here.

Modeling policies in reproducing kernel Hilbert space (RKHS) renders policy gradient reinforcement learning algorithms non-parametric. As a result, the policies become very flexible and have a rich representational potential without a predefined set of features. However, their performances might be either non-covariant under reparameterization of the chosen kernel, or very sensitive to step-siz...

To improve the performance of subspace classi er, it is e ective to reduce the dimensionality of the intersections between subspaces. For this purpose, the feature space is mapped implicitly to a high dimensional reproducing kernel Hilbert space and the subspace classi er is applied in this space. As a result of Hiragana recognition experiment, our classi er outperformed the conventional subspa...

Support Vector Machines nd the hypothesis that corresponds to the centre of the largest hypersphere that can be placed inside version space, i.e. the space of all consistent hypotheses given a training set. The boundaries of version space touched by this hypersphere de ne the support vectors. An even more promising approach is to construct the hypothesis using the whole of version space. This i...

An account of sampling in the setting of reproducing kernel spaces is given, the main point of which is to show that the sampling theory of Kluvánek, even though it is very general in some respects, is nevertheless a special case of the reproducing kernel theory. A Dictionary is provided as a handy summary of the essential steps. Starting with the classical formulation, the notion of band-limit...

We demonstrate that a reproducing kernel Hilbert space of functions on a separable absolute Borel space or an analytic subset of a Polish space is separable if it possesses a Borel measurable feature map.

The aim of this paper is to use the Reproducing kernel Hilbert Space Method (RKHSM) to solve the linear and nonlinear fuzzy impulsive fractional differential equations. Finding the numerical solutionsof this class of equations are a difficult topic to analyze. In this study, convergence analysis, estimations error and bounds errors are discussed in detail under some hypotheses which provi...