Master's thesis presentation

Jian Deng, Master’s candidate
David R. Cheriton School of Computer Science

This thesis presents Multi-view Labelling Object Detector (MLOD). The detector takes an RGB image and a LIDAR point cloud as input and follows the two-stage object detection framework \cite{girshick2015fast} \cite{ren2015faster}. A Region Proposal Network (RPN) generates 3D proposals in a Bird's Eye View (BEV) projection of the point cloud. The second stage projects the 3D proposal bounding boxes to the image and BEV feature maps and sends the corresponding map crops to a detection header for classification and bounding-box regression.

Hamidreza Shahidi, Master’s candidate
David R. Cheriton School of Computer Science

A number of researchers have recently questioned the necessity of increasingly complex neural network (NN) architectures. In particular, several recent papers have shown that simpler, properly tuned models are at least competitive across several natural language processing (NLP) tasks. 

Friday, August 16, 2019 2:30 pm - 2:30 pm EDT (GMT -04:00)

Master’s Thesis Presentation: Policy Extraction via Online Q-Value Distillation

Aman Jhunjhunwala, Master’s candidate
David R. Cheriton School of Computer Science

Recently, deep neural networks have been capable of solving complex control tasks in certain challenging environments. However, these deep learning policies continue to be hard to interpret, explain and verify, which limits their practical applicability. Decision Trees lend themselves well to explanation and verification tools but are not easy to train especially in an online fashion. The aim of this thesis is to explore online tree construction algorithms and demonstrate the technique and effectiveness of distilling reinforcement learning policies into a Bayesian tree structure.

Alexander Sachs, Master’s candidate
David R. Cheriton School of Computer Science

GitHub is an excellent democratic source of software. Unlike traditional work groups however, GitHub repositories are primarily anonymous and virtual. Traditional strategies for improving the productivity of a work group often include external consultation agencies that do in-person interviews. The resulting data from these interviews are then reviewed and their recommendations provided. In the online world however, where colleagues are often anonymous and geographically dispersed, it is often impossible to apply such approaches.

Jonathan Vi Perrie, Master’s candidate
David R. Cheriton School of Computer Science

Over the years, hit song science has been a controversial topic within music information retrieval (MIR). Researchers have debated whether an unbiased dataset can be constructed and what it means to successfully model song performance. Often classes for modelling are derived from one component of song performance, like for example, a song's peak position on some chart. 

Rahul Iyer, Master’s candidate
David R. Cheriton School of Computer Science

Social interactions in the form of discussion are an indispensable part of collaborative software development. The discussions are essential for developers to share their views and to form a strong relationship with other teammates. These discussions invoke both positive and negative emotions such as joy, love, aggression, and disgust. Additionally, developers also exhibit hidden behaviors that dictate their personality. Some developers can be supportive and open to new ideas, whereas others can be conservative. Past research has shown that the personality of the developers has a significant role in determining the success of the task they collaboratively perform.

Matthew Angus, Master’s candidate
David R. Cheriton School of Computer Science

There exists wide research surrounding the detection of out of distribution sample for image classification. Safety critical applications, such as autonomous driving, would benefit from the ability to localise the unusual objects causing an image to be out of distribution. 

Yingluo Xun, Master’s candidate
David R. Cheriton School of Computer Science

In reinforcement learning, entropy-regularized value function (in policy space) has attracted a lot of attention recently due to its effect on smoothing the value function, and the effect on encouraging exploration. However, there is a discrepancy between the regularized objective function and the original objective function in existing methods, which would potentially result in a discrepancy between the trained policy and the optimal policy, as the policy directly depends on the value function in the reinforcement learning framework. 

Friday, May 17, 2019 11:00 am - 11:00 am EDT (GMT -04:00)

Master’s Essay Presentation: Applications of Deconvolution Network, SPN and ELMo

Joshua Cheng, Master’s candidate
David R. Cheriton School of Computer Science

In this paper, we are going to explore the possibility to apply deconvolution network, sum-product network and contextualized word embeddings (ELMo) on learning encoded sentence representation and sentiment identification.

Friday, April 5, 2019 10:00 am - 10:00 am EDT (GMT -04:00)

Master’s Thesis Presentation: End-to-end Neural Information Retrieval

Wei Yang, Master’s candidate
David R. Cheriton School of Computer Science

In recent years, we have witnessed many successes of neural networks in the information retrieval community with lots of labeled data. Yet it remains unknown whether the same techniques can be easily adapted to search social media posts where the text is much shorter. In addition, we find that most neural information retrieval models are compared against weak baselines. 

In this thesis, we build an end-to-end neural information retrieval system using two toolkits: Anserini and MatchZoo. In addition, we also propose a novel neural model to capture the relevance of short and varied tweet text, named MP-HCNN.