arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.03072cs.LG
收藏

基于概率标记的半监督表示学习

Semi-Supervised Representation Learning based on Probabilistic Labeling

University of Waterloo(滑铁卢大学);Vector Institute(向量研究所)

Ershad Banijamali, Ali Ghodsi

摘要:

在本文中,我们提出了一个新的算法,半监督表示学习。在该算法中,我们首先根据数据点在空间中的局部位置为数据点的标签找到一个向量表示。然后,我们使用线性变换将数据映射到低维空间,使得变换后的数据与分配的标签之间的依赖性最大化。事实上,我们试图找到一个尽可能有区别的映射。该方法将使用Hilber-Schmidt独立准则(HSIC)作为依赖性度量。我们还提出了一个内核化版本的算法,它允许非线性变换,并提供了更大的灵活性,在寻找适当的映射。使用未标记的数据来学习新的表示并不总是有益的,并且没有算法可以确定性地保证通过利用未标记的数据来提高性能。因此,我们还提出了一个边界上的算法的性能,可以用来确定使用的未标记的数据在算法中的有效性。我们证明了算法的能力,在寻找转换使用玩具的例子和现实世界的数据集。

英文摘要:

In this paper, we present a new algorithm for semi-supervised representation learning. In this algorithm, we first find a vector representation for the labels of the data points based on their local positions in the space. Then, we map the data to lower-dimensional space using a linear transformation such that the dependency between the transformed data and the assigned labels is maximized. In fact, we try to find a mapping that is as discriminative as possible. The approach will use Hilber-Schmidt Independence Criterion (HSIC) as the dependence measure. We also present a kernelized version of the algorithm, which allows non-linear transformations and provides more flexibility in finding the appropriate mapping. Use of unlabeled data for learning new representation is not always beneficial and there is no algorithm that can deterministically guarantee the improvement of the performance by exploiting unlabeled data. Therefore, we also propose a bound on the performance of the algorithm, which can be used to determine the effectiveness of using the unlabeled data in the algorithm. We demonstrate the ability of the algorithm in finding the transformation using both toy examples and real-world datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑