mlsanityData to 14 Oct 2026

Using Interventions to Improve Out-of-Distribution Generalization of Text-Matching Recommendation Systems

arXiv 2210.10636 ↗First posted 7 Oct 2022cs.IR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Given a user's input text, text-matching recommender systems output relevant items by comparing the input text to available items' description, such as product-to-product recommendation on e-commerce platforms. As users' interests and item inventory are expected to change, it is important for a text-matching system to generalize to data shifts, a task known as out-of-distribution (OOD) generalization. However, we find that the popular approach of fine-tuning a large, base language model on paired item relevance data (e.g., user clicks) can be counter-productive for OOD generalization. For a product recommendation task, fine-tuning obtains worse accuracy than the base model when recommending items in a new category or for a future time period. To explain this generalization failure, we consider an intervention-based importance metric, which shows that a fine-tuned model captures spurious correlations and fails to learn the causal features that determine the relevance between any two text inputs. Moreover, standard methods for causal regularization do not apply in this setting, because unlike in images, there exist no universally spurious features in a text-matching task (the same token may be spurious or causal depending on the text it is being matched to). For OOD generalization on text inputs, therefore, we highlight a different goal: avoiding high importance scores for certain features. We do so using an intervention-based regularizer that constraints the causal effect of any token on the model's relevance score to be similar to the base model. Results on Amazon product and 3 question recommendation datasets show that our proposed regularizer improves generalization for both in-distribution and OOD evaluation, especially in difficult scenarios when the base model is not accurate.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 32 of its 46 references that are in the map. First posted on arXiv 7 Oct 2022.

Builds on

32 of 46 references.

References · 32

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  3. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  4. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
  5. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  6. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,173
  7. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
  8. 2020Beyond Accuracy: Behavioral Testing of NLP models with CheckListcited by 1,006
  9. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
  10. 2021Robust fine-tuning of zero-shot modelscited by 797
  11. 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 766
  12. 2022Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distributioncited by 739
20 more
  1. 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 695
  2. 2020Pretrained Transformers Improve Out-of-Distribution Robustnesscited by 294
  3. 2020Domain Generalization using Causal Matchingcited by 225
  4. 2022Improving Out-of-Distribution Robustness via Selective Augmentationcited by 202
  5. 2020CLEAR: Contrastive Learning for Sentence Representationcited by 186
  6. 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
  7. 2021Condenser: a Pre-training Architecture for Dense Retrievalcited by 162
  8. 2020Pre-training Tasks for Embedding-based Large-scale Retrievalcited by 153
  9. 2020Augmented SBERT: Data Augmentation Method for Improving Bi-Encoders for Pairwise Sentence Scoring Taskscited by 138
  10. 2022Domain Generalization by Mutual-Information Regularization with Pre-trained Modelscited by 133
  11. 2020The elephant in the interpretability room: Why use attention as explanation when we have saliency methods?cited by 122
  12. 2022Self-Supervised Learning for Recommender Systems: A Surveycited by 95
  13. 2019The Unfairness of Popularity Bias in Recommendationcited by 70
  14. 2022Diversify and Disambiguate: Learning From Underspecified Datacited by 56
  15. 2021Causally motivated Shortcut Removal Using Auxiliary Labelscited by 55
  16. 2020Contrastive Learning for Debiased Candidate Generation in Large-Scale Recommender Systemscited by 38
  17. 2021ECLARE: Extreme Classification with Label Graph Correlationscited by 38
  18. 2018Adversarial Domain Adaptation for Duplicate Question Detectioncited by 30
  19. 2022CausPref: Causal Preference Learning for Out-of-Distribution Recommendationcited by 17
  20. 2022Learning Personalized Item-to-Item Recommendation Metric via Implicit Feedbackcited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.