资源分类
》 资源 》论文》Optimal learning rates for least squares SVMs using Gaussian kernels

Optimal learning rates for least squares SVMs using Gaussian kernels

2020-01-08 | |  60 |   48 |   0

Abstract

We prove a new oracle inequality for support vector machines with Gaussian RBF kernels solving the regularized least squares regression problem. To this end, we apply the modulus of smoothness. With the help of the new oracle inequality we then derive learning rates that can also be achieved by a simple data-dependent parameter selection method. Finally, it turns out that our learning rates are asymptotically optimal for regression functions satisfying certain standard smoothness conditions.

上一篇：Multi-Bandit Best Arm Identification

下一篇：Structural equations and divisive normalization for energy-dependent component analysis

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...