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

SERAPH:超稀疏半监督度量学习范式

SERAPH: Semi-supervised Metric Learning Paradigm with Hyper Sparsity

Gang Niu, Bo Dai, Makoto Yamada, Masashi Sugiyama

摘要:

我们提出了一个通用的信息理论方法,称为Seraph(SEMI监督metRic学习范式与超稀疏)的度量学习,不依赖于流形假设。给定由Mahalanobis距离参数化的概率,我们在标记数据上最大化该概率的熵,并在熵正则化后在未标记数据上最小化该概率的熵,这使得监督和非监督部分能够以自然和有意义的方式集成。此外,Seraph是正规化的鼓励低秩投影从度量。采用解析E-Step和凸M-Step的类EM格式,高效稳定地求解了Seraph的优化问题。实验表明,Seraph与许多知名的全局和局部度量学习方法相比毫不逊色。

英文摘要:

We propose a general information-theoretic approach called Seraph (SEmi-supervised metRic leArning Paradigm with Hyper-sparsity) for metric learning that does not rely upon the manifold assumption. Given the probability parameterized by a Mahalanobis distance, we maximize the entropy of that probability on labeled data and minimize it on unlabeled data following entropy regularization, which allows the supervised and unsupervised parts to be integrated in a natural and meaningful way. Furthermore, Seraph is regularized by encouraging a low-rank projection induced from the metric. The optimization of Seraph is solved efficiently and stably by an EM-like scheme with the analytical E-Step and convex M-Step. Experiments demonstrate that Seraph compares favorably with many well-known global and local metric learning methods.

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

↑