Learning Rates for Multi-task Regularization Networks
From MaRDI portal
Publication:6364337
arXiv2104.00453MaRDI QIDQ6364337FDOQ6364337
Authors: Jie Gui, Haizhang Zhang
Publication date: 1 April 2021
Abstract: 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 mathematical 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 regularization 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.
This page was built for publication: Learning Rates for Multi-task Regularization Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6364337)