Least Square Regularized Regression for Multitask Learning

الملخص EN

The study of multitask learning algorithms is one of very important issues.

This paper proposes a least-square regularized regression algorithm for multi-task learning with hypothesis space being the union of a sequence of Hilbert spaces.

The algorithm consists of two steps of selecting the optimal Hilbert space and searching for the optimal function.

We assume that the distributions of different tasks are related to a set of transformations under which any Hilbert space in the hypothesis space is norm invariant.

We prove that under the above assumption the optimal prediction function of every task is in the same Hilbert space.

Based on this result, a pivotal error decomposition is founded, which can use samples of related tasks to bound excess error of the target task.

We obtain an upper bound for the sample error of related tasks, and based on this bound, potential faster learning rates are obtained compared to single-task learning algorithms.