Algorithm-dependent generalization bounds for multi-task learning
- Publisher: IEEE Computer Society
Often, tasks are collected for multi-task learning (MTL) because they share\ud similar feature structures. Based on this observation, in this paper, we present\ud novel algorithm-dependent generalization bounds for MTL by exploiting the notion\ud of algorithmic stability. We focus on the performance of one particular task\ud and the average performance over multiple tasks by analyzing the generalization\ud 1\ud ability of a common parameter that is shared in MTL. When focusing on one\ud particular task, with the help of a mild assumption on the feature structures, we\ud interpret the function of the other tasks as a regularizer that produces a specific\ud inductive bias. The algorithm for learning the common parameter, as well as the\ud predictor, is thereby uniformly stable with respect to the domain of the particular\ud task and has a generalization bound with a fast convergence rate of order O(1=n),\ud where n is the sample size of the particular task. When focusing on the average\ud performance over multiple tasks, we prove that a similar inductive bias exists under\ud certain conditions on the feature structures. Thus, the corresponding algorithm\ud for learning the common parameter is also uniformly stable with respect to the domains\ud of the multiple tasks, and its generalization bound is of the order O(1=T ),\ud where T is the number of tasks. These theoretical analyses naturally show that\ud the similarity of feature structures in MTL will lead to specific regularizations for\ud predicting, which enables the learning algorithms to generalize fast and correctly\ud from a few examples.