论文标题
多任务场景中的多视图表示学习
Multi-View representation learning in Multi-Task Scene
论文作者
论文摘要
近几十年来,在多任务学习还是多视图学习方面取得了很大的进步,但是同时考虑这两个学习场景的情况并没有得到太多关注。如何利用每个任务的多种视图潜在表示来改善每个学习任务绩效是一个挑战问题。基于此,我们提出了一种新型的半监督算法,该算法被称为基于常见和特殊特征(MTMVCSF)的多任务多视图学习。通常,多视图是对象的不同方面,每个视图都包含此对象的基本常见或特殊信息。结果,我们将挖掘每个学习任务的多种视图共同的潜在因素,这些因素由每个视图特殊功能和所有视图的共同特征组成。通过这种方式,原始的多任务多视图数据已退化为多任务数据,并探索了多个任务之间的相关性,使得可以改善学习算法的性能。这种方法的另一个明显优势是,我们通过标记实例的回归任务的约束来获得一组未标记的实例的潜在表示。在这些潜在表示中,分类和半监督聚类任务的性能显然比原始数据更好。此外,提出了一种称为AN-MTMVCSF的反噪声多任务多视图算法,该算法对噪声标签具有很强的适应性。这些算法的有效性通过对现实世界和合成数据进行的一系列精心设计的实验证明。
Over recent decades have witnessed considerable progress in whether multi-task learning or multi-view learning, but the situation that consider both learning scenes simultaneously has received not too much attention. How to utilize multiple views latent representation of each single task to improve each learning task performance is a challenge problem. Based on this, we proposed a novel semi-supervised algorithm, termed as Multi-Task Multi-View learning based on Common and Special Features (MTMVCSF). In general, multi-views are the different aspects of an object and every view includes the underlying common or special information of this object. As a consequence, we will mine multiple views jointly latent factor of each learning task which consists of each view special feature and the common feature of all views. By this way, the original multi-task multi-view data has degenerated into multi-task data, and exploring the correlations among multiple tasks enables to make an improvement on the performance of learning algorithm. Another obvious advantage of this approach is that we get latent representation of the set of unlabeled instances by the constraint of regression task with labeled instances. The performance of classification and semi-supervised clustering task in these latent representations perform obviously better than it in raw data. Furthermore, an anti-noise multi-task multi-view algorithm called AN-MTMVCSF is proposed, which has a strong adaptability to noise labels. The effectiveness of these algorithms is proved by a series of well-designed experiments on both real world and synthetic data.