activity
20122020
most citedWindows into Relational Events: Data Structures for Contiguous Subsequences of Edges

1 citations · 2 across the 6 of their papers we have counts for

collaborators

7 papers

cs.CL2020

Pivot Through English: Reliably Answering Multilingual Questions without Document Retrieval

Ivan Montero, Shayne Longpre, Ni Lao +2

Existing methods for open-retrieval question answering in lower resource languages (LRLs) lag significantly behind English. They not only suffer from the shortcomings of non-Englis…

cs.LG2020

How Effective is Task-Agnostic Data Augmentation for Pretrained Transformers?

Shayne Longpre, Yu Wang, Christopher DuBois

Task-agnostic forms of data augmentation have proven widely effective in computer vision, even on pretrained models. In NLP similar results are reported most commonly for low data…

cs.CL2020

On the Transferability of Minimal Prediction Preserving Inputs in Question Answering

Shayne Longpre, Yi Lu, Christopher DuBois

Recent work (Feng et al., 2018) establishes the presence of short, uninterpretable input fragments that yield high confidence and accuracy in neural models. We refer to these as Mi…

cs.CL2019

An Exploration of Data Augmentation and Sampling Techniques for Domain-Agnostic Question Answering

Shayne Longpre, Yi Lu, Zhucheng Tu +1

To produce a domain-agnostic question answering model for the Machine Reading Question Answering (MRQA) 2019 Shared Task, we investigate the relative benefits of large pre-trained…

cs.LG2013★ 1 cited

Stochastic Collapsed Variational Bayesian Inference for Latent Dirichlet Allocation

James Foulds, Levi Boyles, Christopher Dubois +2

In the internet era there has been an explosion in the amount of digital text information available, leading to difficulties of scale for traditional inference algorithms for topic…

cs.DS2012★ 1 cited

Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges

Michael J. Bannister, Christopher DuBois, David Eppstein +1

We consider the problem of analyzing social network data sets in which the edges of the network have timestamps, and we wish to analyze the subgraphs formed from edges in contiguou…