Learning by Association

Neural networks usually require vast amounts of labeled training data. In this dissertation, we propose an approach to solve this problem: "Learning bay Association". This training schedule is suitable for any embedding learning task such as classification, domain adaptation or clustering. The key idea is to “associate” training examples for which labels are known with unlabeled examples. A novel cost function facilitates state-of-the-art results with significantly less labeled training data.