Cited by 57Domain Adaptation and Few-Shot LearningTopic ModelingNatural Language Processing Techniques

PADA: Example-based Prompt Learning for on-the-fly Adaptation to Unseen Domains

Open access
Ben-David, Eyal, Oved, Nadav, Reichart, Roi·2022·Transactions of the Association for Computational Linguistics

Abstract

Natural Language Processing algorithms have made incredible progress, but they still struggle when applied to out-of-distribution examples. We address a challenging and underexplored version of this domain adaptation problem, where an algorithm is trained on several source domains, and then applied to examples from unseen domains that are unknown at training time. Particularly, no examples, labeled or unlabeled, or any other knowledge about the target domain are available to the algorithm at training time. We present PADA: An example-based autoregressive Prompt learning algorithm for on-the-fly Any-Domain Adaptation, based on the T5 language model. Given a test example, PADA first generates a unique prompt for it and then, conditioned on this prompt, labels the example with respect to the NLP prediction task. PADA is trained to generate a prompt that is a token sequence of unrestricted length, consisting of Domain Related Features (DRFs) that characterize each of the source domains. Intuitively, the generated prompt is a unique signature that maps the test example to a semantic space spanned by the source domains. In experiments with 3 tasks (text classification and sequence tagging), for a total of 14 multi-source adaptation scenarios, PADA substantially outperforms strong baselines.1

Integrity signals

Registry

Crossref · 10.1162/tacl_a_00468

Cites

74 of 74 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Ben-David et al. propose a domain adaptation algorithm that trains T5 to generate unique domain relevant features for each input.

    “Ben-David et al. [5] propose a domain adaptation algorithm that trains T5 to generate unique domain relevant features (DRFs) (a set of keywords that characterize domain information) for each input.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Ben-David, E., Oved, N., & Reichart, R.
Affiliations
Technion – Israel Institute of Technology (IL)
Corresponding author
  • Ben-David, Eyal
  • Oved, Nadav
  • Reichart, Roi
Venue
Transactions of the Association for Computational Linguistics
Publisher
MIT Press
Published
2022
Volume
10
Pages
414-433
ISSN
2307-387X (ISSN-L)
OpenAlex
W4225590069
Cited by
54
References
73
Citations by year
2026: 6 · 2025: 8 · 2024: 13 · 2023: 22 · 2022: 5
FWCI
3.95
Type
journal article
Language
en
Open access
Locations
  • Transactions of the Association for Computational Linguistics (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University) (cc-by)
Funders
Israel Science Foundation
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
Keywords
unseen domains, prompt generation, T5, text classification, sequence labeling

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review