Portrait de Ian Porada n'est pas disponible

Ian Porada

Alumni

Publications

Investigating Failures to Generalize for Coreference Resolution Models
A.R. Olteanu
Kaheer Suleman
Adam Trischler
Jackie CK Cheung
Coreference resolution models are often evaluated on multiple datasets. Datasets vary, however, in how coreference is realized -- i.e., how … (voir plus)the theoretical concept of coreference is operationalized in the dataset -- due to factors such as the choice of corpora and annotation guidelines. We investigate the extent to which errors of current coreference resolution models are associated with existing differences in operationalization across datasets (OntoNotes, PreCo, and Winogrande). Specifically, we distinguish between and break down model performance into categories corresponding to several types of coreference, including coreferring generic mentions, compound modifiers, and copula predicates, among others. This break down helps us investigate how state-of-the-art models might vary in their ability to generalize across different coreference types. In our experiments, for example, models trained on OntoNotes perform poorly on generic mentions and copula predicates in PreCo. Our findings help calibrate expectations of current coreference resolution models; and, future work can explicitly account for those types of coreference that are empirically associated with poor generalization when developing models.
Does Pre-training Induce Systematic Inference? How Masked Language Models Acquire Commonsense Knowledge
Jackie CK Cheung
Modeling Event Plausibility with Consistent Conceptual Abstraction
Kaheer Suleman
Adam Trischler
Jackie CK Cheung
ADEPT: An Adjective-Dependent Plausibility Task
A.R. Olteanu
Kaheer Suleman
Adam Trischler
Jackie CK Cheung
Can a Gorilla Ride a Camel? Learning Semantic Plausibility from Text
Kaheer Suleman
Jackie CK Cheung
Meta-Learning State-based Eligibility Traces for More Sample-Efficient Policy Evaluation
Mingde Zhao
Xiao-Wen Chang
Temporal-Difference (TD) learning is a standard and very successful reinforcement learning approach, at the core of both algorithms that lea… (voir plus)rn the value of a given policy, as well as algorithms which learn how to improve policies. TD-learning with eligibility traces provides a way to boost sample efficiency by temporal credit assignment, i.e. deciding which portion of a reward should be assigned to predecessor states that occurred at different previous times, controlled by a parameter