When More Data Hurts: A Troubling Quirk in Developing Broad-Coverage Natural Language Understanding Systems
Not on the map. Why?
Abstract (arXiv)
In natural language understanding (NLU) production systems, users' evolving needs necessitate the addition of new features over time, indexed by new symbols added to the meaning representation space. This requires additional training data and results in ever-growing datasets. We present the first systematic investigation of this incremental symbol learning scenario. Our analysis reveals a troubling quirk in building broad-coverage NLU systems: as the training dataset grows, performance on the new symbol often decreases if we do not accordingly increase its training data. This suggests that it becomes more difficult to learn new symbols with a larger training dataset. We show that this trend holds for multiple mainstream models on two common NLU tasks: intent recognition and semantic parsing. Rejecting class imbalance as the sole culprit, we reveal that the trend is closely associated with an effect we call source signal dilution, where strong lexical cues for the new symbol become diluted as the training dataset grows. Selectively dropping training examples to prevent dilution often reverses the trend, showing the over-reliance of mainstream neural NLU models on simple lexical cues. Code, models, and data are available at https://aka.ms/nlu-incremental-symbol-learning
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 30 of its 50 references that are in the map. First posted on arXiv 24 May 2022.
Builds on
30 of 50 references.
References · 30
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
- 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,281
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
- 2019Right for the Wrong Reasons: Diagnosing Syntactic Heuristics in Natural Language Inferencecited by 864
- 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 522
- 2019An Evaluation Dataset for Intent Classification and Out-of-Scope Predictioncited by 378
- 2018AllenNLP: A Deep Semantic Natural Language Processing Platformcited by 347
- 2016Deep Biaffine Attention for Neural Dependency Parsingcited by 334
- 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
- 2019Benchmarking Natural Language Understanding Services for building Conversational Agentscited by 166
18 more
- 2016Language to Logical Form with Neural Attentioncited by 158
- 2019Transformers without Tears: Improving the Normalization of Self-Attentioncited by 153
- 2019Distributionally Robust Language Modelingcited by 142
- 2020Task-Oriented Dialogue as Dataflow Synthesiscited by 122
- 2016Data Recombination for Neural Semantic Parsingcited by 111
- 2021Competency Problems: On Finding and Removing Artifacts in Language Datacited by 91
- 2020Continual Learning in Task-Oriented Dialogue Systemscited by 82
- 2014Grammar as a Foreign Languagecited by 70
- 2021Examining and Combating Spurious Features under Distribution Shiftcited by 64
- 2019AMR Parsing as Sequence-to-Graph Transductioncited by 50
- 2019Broad-Coverage Semantic Parsing as Transductioncited by 32
- 2021Procrustean Training for Imbalanced Deep Learningcited by 24
- 2021Calibrating Concepts and Operations: Towards Symbolic Reasoning on Real Imagescited by 14
- 2019The Universal Decompositional Semantics Dataset and Decomp Toolkitcited by 10
- 2019Universal Decompositional Semantic Parsingcited by 8
- 2021Few-Shot Semantic Parsing for New Predicatescited by 7
- 2021Joint Universal Syntactic and Semantic Parsingcited by 5
- 2020Do We Need Online NLU Tools?cited by 3
Built on by
Citing papers per year: 2022: 1; 2023: 1.
2 papers.