Scalable Metric Learning for Co-Embedding
Lists
Only you see this
Abstract
We present a general formulation of metric learning for co-embedding, where the goal is to relate objects from different sets. The framework allows metric learning to be applied to a wide range of problems—including link prediction, relation learning, multi-label tagging and ranking—while allowing training to be reformulated as convex optimization. For training we provide a fast iterative algorithm that improves the scalability of existing metric learning approaches. Empirically, we demonstrate that the proposed method converges to a global optimum efficiently, and achieves competitive results in a variety of co-embedding problems such as multi-label classification and multi-relational prediction.
BibTeX
@inproceedings{mirzazadeh2015scalable,
author = {Farzaneh Mirzazadeh and Martha White and András György and Dale Schuurmans},
title = {{Scalable Metric Learning for Co-Embedding}},
booktitle = {ECML/PKDD},
year = {2015},
doi = {10.1007/978-3-319-23528-8\_39},
}Loading related content...