Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Christopher Hidey

dblp:184/3749 · also Chris Hidey · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
4since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 9 · 4 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
5 papers
Information extraction and text analysis · 56% Trustworthy machine learning · 25% Language models and text generation · 19%
Databases, data mining, and information retrieval
2 papers
Web and social media mining · 82% Information retrieval · 18%

Topics — the 10 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
multilingual language models
0.712023
DAMP: Doubly Aligned Multilingual Parser for Task-Oriented Dialogue · ACL (1) 2023
Machine learning › Trustworthy machine learning › robustness
adversarial examples
0.412020
DeSePtion: Dual Sequence Prediction and Adversarial Examples for Improved Fact-Checking · ACL 2020
Natural language and speech › Information extraction and text analysis
fact-checking
0.412020
DeSePtion: Dual Sequence Prediction and Adversarial Examples for Improved Fact-Checking · ACL 2020
Machine learning › Trustworthy machine learning
robustness
0.412020
DeSePtion: Dual Sequence Prediction and Adversarial Examples for Improved Fact-Checking · ACL 2020
Natural language and speech › Information extraction and text analysis
argument mining
0.412019
AMPERSAND: Argument Mining for PERSuAsive oNline Discussions · EMNLP/IJCNLP (1) 2019
Natural language and speech › Information extraction and text analysis › relation extraction › event relation extraction
causal relation extraction
0.212016
Identifying Causal Relations Using Parallel Wikipedia Articles · ACL (1) 2016
Natural language and speech › Information extraction and text analysis
relation extraction
0.212016
Identifying Causal Relations Using Parallel Wikipedia Articles · ACL (1) 2016
Natural language and speech › Information extraction and text analysis › semantic parsing
multilingual semantic parsing
0.212023
DAMP: Doubly Aligned Multilingual Parser for Task-Oriented Dialogue · ACL (1) 2023
Natural language and speech › Information extraction and text analysis
semantic parsing
0.212023
DAMP: Doubly Aligned Multilingual Parser for Task-Oriented Dialogue · ACL (1) 2023
Natural language and speech › Information extraction and text analysis › dialogue analysis
online discussion analysis
0.112019
AMPERSAND: Argument Mining for PERSuAsive oNline Discussions · EMNLP/IJCNLP (1) 2019

Methods — techniques the papers use, named apart from their topics

word embeddings · 0.7semantic frame embedding · 0.7neural network · 0.7multi-task learning · 0.7discourse relation embedding · 0.7alignment · 0.7parallel corpus analysis · 0.5cross-language alignment · 0.5natural language processing · 0.4
YearPublicationVenuePosition
2023 DAMP: Doubly Aligned Multilingual Parser for Task-Oriented Dialogue
abstract
William Held, Christopher Hidey, Fei Liu, Eric Zhu, Rahul Goel, Diyi Yang, Rushin Shah. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2023.
William Barr Held, Christopher Hidey, Eric Zhu, Rahul Goel, Diyi Yang, Rushin Shah
ACL (1)2
2022 Improving Top-K Decoding for Non-Autoregressive Semantic Parsing via Intent Conditioning
abstract
Semantic parsing (SP) is a core component of modern virtual assistants like Google Assistant and Amazon Alexa. While sequence-to-sequence based auto-regressive (AR) approaches are common for conversational SP, recent studies employ non-autoregressive (NAR) decoders and reduce inference latency while maintaining competitive parsing quality. However, a major drawback of NAR decoders is the difficulty of generating top-k (i.e., k-best) outputs with approaches such as beam search. To address this challenge, we propose a novel NAR semantic parser that introduces intent conditioning on the decoder. Inspired by the traditional intent and slot tagging parsers, we decouple the top-level intent prediction from the rest of a parse. As the top-level intent largely governs the syntax and semantics of a parse, the intent conditioning allows the model to better control beam search and improves the quality and diversity of top-k outputs. We introduce a hybrid teacher-forcing approach to avoid training and inference mismatch. We evaluate the proposed NAR on conversational SP datasets, TOP & TOPv2. Like the existing NAR models, we maintain the O(1) decoding time complexity while generating more diverse outputs and improving top-3 exact match (EM) by 2.4 points. In comparison with AR models, our model speeds up beam search inference by 6.7 times on CPU with competitive top-k EM.
Geunseob Oh, Rahul Goel, Christopher Hidey, Shachi Paul, Aditya Gupta 0001, Pararth Shah, Rushin Shah
COLING3
2022 Reducing Model Churn: Stable Re-training of Conversational Agents
abstract
Retraining modern deep learning systems can lead to variations in model performance even when trained using the same data and hyperparameters by simply using different random seeds.This phenomenon is known as model churn or model jitter.This issue is often exacerbated in real world settings, where noise may be introduced in the data collection process.In this work we tackle the problem of stable retraining with a novel focus on structured prediction for conversational semantic parsing.We first quantify the model churn by introducing metrics for agreement between predictions across multiple re-trainings.Next, we devise realistic scenarios for noise injection and demonstrate the effectiveness of various churn reduction techniques such as ensembling and distillation.Lastly, we discuss practical tradeoffs between such techniques and show that co-distillation provides a sweet spot in terms of churn reduction with only a modest increase in resource usage.
Christopher Hidey, Rahul Goel
SIGDIAL1
2021 ENTRUST: Argument Reframing with Language Models and Entailment
abstract
Tuhin Chakrabarty, Christopher Hidey, Smaranda Muresan. Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2021.
Tuhin Chakrabarty, Christopher Hidey, Smaranda Muresan
NAACL-HLT2
2020 DeSePtion: Dual Sequence Prediction and Adversarial Examples for Improved Fact-Checking
abstract
Christopher Hidey, Tuhin Chakrabarty, Tariq Alhindi, Siddharth Varia, Kriste Krstovski, Mona Diab, Smaranda Muresan. Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics. 2020.
Christopher Hidey, Tuhin Chakrabarty, Tariq Alhindi, Siddharth Varia, Kriste Krstovski, Mona T. Diab, Smaranda Muresan
ACL1
2019 AMPERSAND: Argument Mining for PERSuAsive oNline Discussions
abstract
Tuhin Chakrabarty, Christopher Hidey, Smaranda Muresan, Kathy McKeown, Alyssa Hwang. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2019.
Tuhin Chakrabarty, Christopher Hidey, Smaranda Muresan, Kathy McKeown, Alyssa Hwang
EMNLP/IJCNLP (1)2
2019 Discourse Relation Prediction: Revisiting Word Pairs with Convolutional Networks
abstract
Word pairs across argument spans have been shown to be effective for predicting the discourse relation between them.We propose an approach to distill knowledge from word pairs for discourse relation classification with convolutional neural networks by incorporating joint learning of implicit and explicit relations.Our novel approach of representing the input as word pairs achieves state-of-theart results on four-way classification of both implicit and explicit relations as well as one of the binary classification tasks.For explicit relation prediction, we achieve around 20% error reduction on the four-way task.At the same time, compared to a two-layered Bi-LSTM-CRF model, our model is able to achieve these results with half the number of learnable parameters and approximately half the amount of training time.
Siddharth Varia, Christopher Hidey, Tuhin Chakrabarty
SIGdial2
2018 Persuasive Influence Detection: The Role of Argument Sequencing
abstract
Automatic detection of persuasion in online discussion is key to understanding how social media is used. Predicting persuasiveness is difficult, however, due to the need to model world knowledge, dialogue, and sequential reasoning. We focus on modeling the sequence of arguments in social media posts using neural models with embeddings for words, discourse relations, and semantic frames. We demonstrate significant improvement over prior work in detecting successful arguments. We also present an error analysis assessing novice human performance at predicting persuasiveness.
Christopher Hidey, Kathy McKeown
AAAI1
2016 Identifying Causal Relations Using Parallel Wikipedia Articles
Christopher Hidey, Kathy McKeown
ACL (1)1