.png){kind=icon}
返回
Deterministic error bounds for kernel-based learning techniques under bounded noise
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2021.109896.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of reconstructing a function from a finite set of noise-corrupted samples. Two kernel algorithms are analyzed, namely kernel ridge regression and epsilon-support vector regression. By assuming the ground-truth function belongs to the reproducing kernel Hilbert space of the chosen kernel, and the measurement noise affecting the dataset is bounded, we adopt an approximation theory viewpoint to establish deterministic, finite-sample error bounds for the two models. Finally, we discuss their connection with Gaussian processes and two numerical examples are provided. In establishing our inequalities, we hope to help bring the fields of non-parametric kernel learning and system identification for robust control closer to each other. (C) 2021 Elsevier Ltd. All rights reserved.
Keyword:
Deterministic error bounds
Generalization error
Kernel ridge regression
Support vector machines
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
分享收藏Differential expression of genes that encode glycolysis enzymes in kidney and lung cancer in humans
PREAI
分享收藏
查看更多内容