Faculty

Cheriton School of Computer Science Professor Jesse Hoey has teamed up with Professor Robert Freeland, a sociologist at Wake Forest University, to conduct novel research at the intersection of computer science and social psychology.

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.

Thursday, April 25, 2019 1:00 pm - 1:00 pm EDT (GMT -04:00)

PhD Seminar: Automating the Intentional Encoding of Human-Designable Markers

Joshua Jung, PhD candidate
David R. Cheriton School of Computer Science

Recent work established that it is possible for human artists to encode information into hand-drawn markers, but it is difficult to do when simultaneously maintaining aesthetic quality. We present two methods for relieving the mental burden associated with encoding, while allowing an artist to draw as freely as possible. 

Thursday, April 25, 2019 1:00 pm - 1:00 pm EDT (GMT -04:00)

PhD Defence: Dynamical Systems in Spiking Neuromorphic Hardware

Aaron Voelker, PhD candidate
David R. Cheriton School of Computer Science

Dynamical systems are universal computers. They can perceive stimuli, remember, learn from feedback, plan sequences of actions, and coordinate complex behavioural responses. The Neural Engineering Framework (NEF) provides a general recipe to formulate models of such systems as coupled sets of nonlinear differential equations and compile them onto recurrently connected spiking neural networks — akin to a programming language for spiking models of computation. The Nengo software ecosystem supports the NEF and compiles such models onto neuromorphic hardware. 

Professor Kate Larson has been appointed a University Research Chair in recognition of her outstanding research contributions to the field of artificial intelligence. Waterloo’s designation of University Research Chair recognizes exceptional achievement of faculty and their pre-eminence in a field of knowledge.

Professor Robin Cohen is one of four faculty members to receive a 2019 Distinguished Teacher Award, the University of Waterloo’s most prestigious honour for teaching excellence. The Distinguished Teacher Awards will be presented by Mario Coniglio, associate vice-president, academic, at the June convocation ceremony.

Read the full story

Thursday, April 11, 2019 10:30 am - 10:30 am EDT (GMT -04:00)

AI Seminar: Voting Games: Trembling Hand Equilibria

Svetlana Obraztsova
Nanyang Technological University

Traditionally, computational social choice focuses on evaluating voting rules by their resistance to strategic behaviours, and uses computational complexity as a barrier to them. In contrast, recent works (counting from 2010) take another natural approach and analyse voting scenarios from a game-theoretic perspective, viewing strategic parties as players and examining possible stable outcomes of their interaction (i.e., equilibria). The main problem of this approach is multiple unrealistic Nash equilibria. Fortunately, several refinements have been developed that allow to filter out some undesirable Nash Equilibria. 

Wednesday, March 27, 2019 4:30 pm - 4:30 pm EDT (GMT -04:00)

PhD Seminar: Semi-supervised Clustering for De-duplication

Shrinu Kushagra, PhD candidate
David R. Cheriton School of Computer Science

Data de-duplication is the task of detecting multiple records that correspond to the same real-world entity in a database. In this work, we view de-duplication as a clustering problem. We introduce a framework which we call promise correlation clustering. Given a complete graph \(G\) with the edges labeled \(0\) and \(1\), the goal is to find a clustering that minimizes the number of \(0\) edges within a cluster plus the number of \(1\) edges across different clusters (or correlation loss). The optimal clustering can also be viewed as a complete graph \(G^*\) with edges corresponding to points in the same cluster being labeled \(0\) and other edges being labeled \(1\).