BEGIN:VCALENDAR BEGIN:VEVENT SUMMARY:PhD Defense- Soravit (Beer) Changpinyo DESCRIPTION:PhD Candidate: Soravit (Beer) Changpinyo\n Committee: Fei Sha (chair), Kevin Knight, C.-C. Jay Kuo (outside member)\n \n Title: Modeling, Learning, and Leveraging Similarity\n Time & Place: Tuesday, May 8th, 12-2pm, SAL 213\n Abstract:\n Measuring similarity between any two entities is an essential component in most machine learning tasks. In this defense, I will describe my research work that provides a set of techniques revolving around the notion of similarity.\n The first part involves "modeling and learning" similarity. We introduce Similarity Component Analysis (SCA), a Bayesian network for modeling instance-level similarity that does not observe the triangle inequality. Such a modeling choice avoids the transitivity bias in most existing similarity models, making SCA intuitively more aligned with the human perception of similarity.\n The second part involves "learning and leveraging" similarity for effective learning with limited data, with applications in computer vision and natural language processing. We first leverage incomplete and noisy similarity graphs in different modalities to aid the learning of object recognition models. In particular, we propose two novel zero-shot learning algorithms that utilize class-level semantic similarities as a building block, establishing state-of-the-art performance on the large-scale benchmark with more than 20,000 categories. As for natural language processing, we employ multi-task learning (MTL) to leverage unknown similarities between sequence tagging tasks. This study leads to insights regarding the benefit of going to beyond pairwise MTL, task selection strategies, as well as the nature of the relationships between those tasks.\n DTSTART:20180508T120000 LOCATION:SAL 213 URL;VALUE=URI: DTEND:20180508T140000 END:VEVENT END:VCALENDAR