← Search

Shuyang Gao

7 accepted papers

2022

Context-Situated Pun Generation

EMNLP 2022main

Previous work on pun generation commonly begins with a given pun word (a pair of homophones for heterographic pun generation and a polyseme for homographic pun generation) and seeks to generate an appropriate pun. While this may enable efficient pun generation, we believe that a pun is most entertai…

2022

GRAVL-BERT: Graphical Visual-Linguistic Representations for Multimodal Coreference Resolution

COLING 2022main

Learning from multimodal data has become a popular research topic in recent years. Multimodal coreference resolution (MCR) is an important task in this area. MCR involves resolving the references across different modalities, e.g., text and images, which is a crucial capability for building next-gene…

2021

Alexa Conversations: An Extensible Data-driven Approach for Building Task-oriented Dialogue Systems

NAACL 2021system demonstrations

Traditional goal-oriented dialogue systems rely on various components such as natural language understanding, dialogue state tracking, policy learning and response generation. Training each component requires annotations which are hard to obtain for every new domain, limiting scalability of such sys…

Cited by 22SourcePDFScholar
2018

Invariant Representations without Adversarial Training

NeurIPS 2018poster

Representations of data that are invariant to changes in specified factors are useful for a wide range of problems: removing potential biases in prediction problems, controlling the effects of covariates, and disentangling meaningful factors of variation. Unfortunately, learning representations that…

Cited by 264SourcePDFScholar
2016

Variational Information Maximization for Feature Selection

NeurIPS 2016poster

Feature selection is one of the most fundamental problems in machine learning. An extensive body of work on information-theoretic feature selection exists which is based on maximizing mutual information between subsets of features and class labels. Practical methods are forced to rely on approximati…

2015

Efficient Estimation of Mutual Information for Strongly Dependent Variables

AISTATS 2015poster

We demonstrate that a popular class of non-parametric mutual information (MI) estimators based on k-nearest-neighbor graphs requires number of samples that scales exponentially with the true MI. Consequently, accurate estimation of MI between two strongly dependent variables is possible only for pro…