Skip to main content
Top

2022 | Book

An Introduction to Artificial Intelligence Based on Reproducing Kernel Hilbert Spaces

insite
SEARCH

About this book

This textbook provides an in-depth exploration of statistical learning with reproducing kernels, an active area of research that can shed light on trends associated with deep neural networks. The author demonstrates how the concept of reproducing kernel Hilbert Spaces (RKHS), accompanied with tools from regularization theory, can be effectively used in the design and justification of kernel learning algorithms, which can address problems in several areas of artificial intelligence. Also provided is a detailed description of two biomedical applications of the considered algorithms, demonstrating how close the theory is to being practically implemented.

Among the book’s several unique features is its analysis of a large class of algorithms of the Learning Theory that essentially comprise every linear regularization scheme, including Tikhonov regularization as a specific case. It also provides a methodology for analyzing not only different supervised learning problems, such as regression or ranking, but also different learning scenarios, such as unsupervised domain adaptation or reinforcement learning. By analyzing these topics using the same theoretical framework, rather than approaching them separately, their presentation is streamlined and made more approachable.

An Introduction to Artificial Intelligence Based on Reproducing Kernel Hilbert Spaces is an ideal resource for graduate and postgraduate courses in computational mathematics and data science.

Table of Contents

Frontmatter
1. Introduction
Abstract
Assume that we are provided with the real numbers \(y_1,y_2,\ldots ,y_n\in \mathbb {R}\) that are supposed to be the values of some unknown function f(x) taken at the points x 1, x 2, …, x n in a domain X of d-dimensional Euclidean space \(\mathbb {R}^d,d\geq 1\), but we are aware that these values may be blurred by additive noise \(\bar {\xi }=(\xi _1,\xi _2,\ldots ,\xi _n)\), such that we assume the actual form y i = f(x) + ξ i, i = 1, 2, …, n.
Sergei Pereverzyev
2. Learning in Reproducing Kernel Hilbert Spaces and Related Integral Operators
Abstract
In the previous chapter, discussing the reconstruction of an unknown function from a sample \(z = \{(x_i,y_i)\}_{i=1}^n,\) we did not make any assumptions on the nature of the data. Admitting that the above data are usually incomplete, one, however, can try to uncover the relationship between a dependent variable y and an independent variable x by assuming all complicated affecting factors to be random and then employing a technique known as “supervised learning.” In this technique, the sample z is considered as a training set of examples of input–output pairs z i = (x i, y i) observed in a system under study, and the goal is to use the above data in predicting output https://static-content.springer.com/image/chp%3A10.1007%2F978-3-030-98316-1_2/524959_1_En_2_IEq2_HTML.gif for a previously unseen input x ∈ X.
Sergei Pereverzyev
3. Selected Topics of the Regularization Theory
Abstract
In the previous section, we have seen that learning in RKHS can be reduced to linear operator equations, such as (2.​2), (2.​6), (2.​10), which involve non-negative, self-adjoint, and compact operators acting in a Hilbert space \(\mathcal {H}\). Therefore, when discussing the general regularization tools for dealing with the ill-posedness, we shall focus on the equations with such operators.
Sergei Pereverzyev
4. Regularized Learning in RKHS
Abstract
This chapter is devoted to the application of regularization tools presented in Chap. 3.
Sergei Pereverzyev
5. Examples of Applications
Abstract
In this chapter we present some applications of the regularized RKHS-based learning algorithms, which have been described and analyzed in this book. We mainly restrict ourselves to learning in the ranking setting, because examples of the application of RKHS-regression learning algorithms can easily be found in the literature (see, for instance, Chapters 4 and 5 of [8] and the references therein). We begin with a demonstration of the performance of regularized ranking algorithms on some publicly available benchmark datasets. Then we discuss possible applications in Diabetes Technology. Finally, we consider one more biomedical application which is automatic stenosis detection from magnetic resonance imaging data, where we employ results on regularization of unsupervised domain adaptation in RKHS.
Sergei Pereverzyev
Backmatter
Metadata
Title
An Introduction to Artificial Intelligence Based on Reproducing Kernel Hilbert Spaces
Author
Prof. Sergei Pereverzyev
Copyright Year
2022
Electronic ISBN
978-3-030-98316-1
Print ISBN
978-3-030-98315-4
DOI
https://doi.org/10.1007/978-3-030-98316-1

Premium Partner