mlsanityData to 7 Oct 2026

Measuring and Reducing Model Update Regression in Structured Prediction for NLP

arXiv 2202.02976 ↗First posted 7 Feb 2022cs.CL cs.AI cs.LGcited by 11

Not on the map. Why?

Abstract (arXiv)

Recent advance in deep learning has led to the rapid adoption of machine learning-based NLP models in a wide range of applications. Despite the continuous gain in accuracy, backward compatibility is also an important aspect for industrial applications, yet it received little research attention. Backward compatibility requires that the new model does not regress on cases that were correctly handled by its predecessor. This work studies model update regression in structured prediction tasks. We choose syntactic dependency parsing and conversational semantic parsing as representative examples of structured prediction tasks in NLP. First, we measure and analyze model update regression in different model update settings. Next, we explore and benchmark existing techniques for reducing model update regression including model ensemble and knowledge distillation. We further propose a simple and effective method, Backward-Congruent Re-ranking (BCR), by taking into account the characteristics of structured prediction. Experiments show that BCR can better mitigate model update regression than model ensemble and knowledge distillation approaches.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 33 of its 54 references that are in the map. First posted on arXiv 7 Feb 2022.

Builds on

33 of 54 references.

References · 33

  1. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  3. 2019The Curious Case of Neural Text Degenerationcited by 2,881
  4. 2014FitNets: Hints for Thin Deep Netscited by 1,619
  5. 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,486
  6. 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
  7. 2018Hierarchical Neural Story Generationcited by 1,182
  8. 2015A Diversity-Promoting Objective Function for Neural Conversation Modelscited by 1,068
  9. 2016Paying More Attention to Attention: Improving the Performance of Convolutional Neural Networks via Attention Transfercited by 1,059
  10. 2020Beyond Accuracy: Behavioral Testing of NLP models with CheckListcited by 979
  11. 2016Sequence-Level Knowledge Distillationcited by 761
  12. 2020Stanza: A Python Natural Language Processing Toolkit for Many Human Languagescited by 719
21 more
  1. 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
  2. 2020Learning under Concept Drift: A Reviewcited by 470
  3. 2013Do Deep Nets Really Need to be Deep?cited by 466
  4. 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 446
  5. 2016Deep Biaffine Attention for Neural Dependency Parsingcited by 334
  6. 2020Continual Lifelong Learning in Natural Language Processing: A Surveycited by 152
  7. 2019Fairness-Aware Ranking in Search & Recommendation Systems with Application to LinkedIn Talent Searchcited by 137
  8. 2018Semantic Parsing for Task Oriented Dialog using Hierarchical Representationscited by 101
  9. 2020Towards Backward-Compatible Representation Learningcited by 74
  10. 2020Don't Parse, Generate! A Sequence to Sequence Architecture for Task-Oriented Semantic Parsingcited by 59
  11. 2020Positive-Congruent Training: Towards Regression-Free Model Updatescited by 55
  12. 2019Simple and Effective Noisy Channel Modeling for Neural Machine Translationcited by 37
  13. 2018Stack-Pointer Networks for Dependency Parsingcited by 36
  14. 2019Complexity-Weighted Loss and Diverse Reranking for Sentence Simplificationcited by 20
  15. 2019Improving Semantic Parsing for Task Oriented Dialogcited by 15
  16. 2021Backward-Compatible Prediction Updates: A Probabilistic Approachcited by 14
  17. 2021Regression Bugs Are In Your Model! Measuring, Reducing and Analyzing Regressions In NLP Model Updatescited by 13
  18. 2020Efficient Computation of Expectations under Spanning Tree Distributionscited by 11
  19. 2020Please Mind the Root: Decoding Arborescences for Dependency Parsingcited by 11
  20. 2020Structural Knowledge Distillation: Tractably Distilling Information for Structured Predictorcited by 7
  21. 2021On Finding the K-best Non-projective Dependency Treescited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 4; 2024: 3; 2025: 2; 2026: 2.

11 papers.