.png){kind=icon}
.png){kind=icon}
Return
Learning rates for multi-task regularization networks
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2021.09.031.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multi-task learning is an important trend of machine learning in facing the era of artificial intelligence and big data. Despite a large amount of researches on learning rate estimates of various single-task machine learning algorithms, there is little parallel work for multi-task learning. We present mathemat-ical analysis on the learning rate estimate of multi-task learning based on the theory of vector-valued reproducing kernel Hilbert spaces and matrix-valued reproducing kernels. For the typical multi-task reg-ularization networks, an explicit learning rate dependent both on the number of sample data and the number of tasks is obtained. It reveals that the generalization ability of multi-task learning algorithms is indeed affected as the number of tasks increases. (c) 2021 Elsevier B.V. All rights reserved.
Keywords:
Vector-valued reproducing kernel Hilbert
spaces
Multi-task learning
Matrix-valued reproducing kernels
Learning rates
Regularization networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.