MétaCan
Menu
Back to cohort
Record W2948710720 · doi:10.18653/v1/p19-1004

Do Neural Dialog Systems Use the Conversation History Effectively? An Empirical Study

2019· preprint· en· W2948710720 on OpenAlexaff
Chinnadhurai Sankar, Sandeep Subramanian, Christopher Pal, Sarath Chandar, Yoshua Bengio

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldComputer Science
TopicTopic Modeling
Canadian institutionsPolytechnique MontréalUniversité de Montréal
FundersNvidia
KeywordsDialog boxComputer scienceGenerative grammarFlexibility (engineering)ShufflingContext (archaeology)Artificial intelligenceTransformerCode (set theory)ConversationDialog systemNatural language processingMachine learningHuman–computer interactionProgramming languageCommunicationWorld Wide WebPsychologyEngineering

Abstract

fetched live from OpenAlex

Neural generative models have been become increasingly popular when building conversational agents.They offer flexibility, can be easily adapted to new domains, and require minimal domain engineering.A common criticism of these systems is that they seldom understand or use the available dialog history effectively.In this paper, we take an empirical approach to understanding how these models use the available dialog history by studying the sensitivity of the models to artificially introduced unnatural changes or perturbations to their context at test time.We experiment with 10 different types of perturbations on 4 multi-turn dialog datasets and find that commonly used neural dialog architectures like recurrent and transformer-based seq2seq models are rarely sensitive to most perturbations such as missing or reordering utterances, shuffling words, etc.Also, by open-sourcing our code, we believe that it will serve as a useful diagnostic tool for evaluating dialog systems in the future 1 .

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.016
metaresearch head score (Gemma)0.093
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.016
Threshold uncertainty score0.086

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0160.093
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.005
Open science0.0010.002
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0020.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.106
GPT teacher head0.309
Teacher spread0.203 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations16
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicTopic ModelingFrench-language works237,207