arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1606.04646cs.LG
收藏

非配对输入输出样本预测器的无监督学习

Unsupervised Learning of Predictors from Unpaired Input-Output Samples

Microsoft Research(微软研究院)

Jianshu Chen, Po-Sen Huang, Xiaodong He, Jianfeng Gao, Li Deng

摘要:

无监督学习是机器学习中最具挑战性的问题,尤其是在深度学习中。在许多场景中,我们研究了一个具有高经济价值的无监督学习问题--学习预测,而无需昂贵的输入数据和相应的标签配对。这个问题的部分困难在于缺乏可靠的评估措施。在本文中,我们采取了一种实用的方法,通过使用与预测任务中的监督学习相同的成功标准来接地无监督学习,但我们不需要存在成对的输入输出训练数据。特别是,我们提出了一个目标函数,其目的是使预测输出很好地适应输出的结构,同时保持输入和预测输出之间的相关性。我们用一个合成结构预测问题进行了实验,结果表明,即使使用简单的线性分类器,目标函数也是高度非凸的。我们进一步证明了这个非凸优化问题的性质以及潜在的解决方案。特别是,我们表明,通过生成模型进行正则化,使用提出的无监督目标函数进行学习会收敛到最优解。

英文摘要:

Unsupervised learning is the most challenging problem in machine learning and especially in deep learning. Among many scenarios, we study an unsupervised learning problem of high economic value --- learning to predict without costly pairing of input data and corresponding labels. Part of the difficulty in this problem is a lack of solid evaluation measures. In this paper, we take a practical approach to grounding unsupervised learning by using the same success criterion as for supervised learning in prediction tasks but we do not require the presence of paired input-output training data. In particular, we propose an objective function that aims to make the predicted outputs fit well the structure of the output while preserving the correlation between the input and the predicted output. We experiment with a synthetic structural prediction problem and show that even with simple linear classifiers, the objective function is already highly non-convex. We further demonstrate the nature of this non-convex optimization problem as well as potential solutions. In particular, we show that with regularization via a generative model, learning with the proposed unsupervised objective function converges to an optimal solution.

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

↑