Unsupervised Domain Adaptation for Keyphrase Generation using Citation Contexts (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for keyphrase generation are limited to resource-rich languages. |
| Approach: | They propose to extract silver-standard keyphrases from citation contexts to create synthetic labeled data for domain adaptation. |
| Outcome: | The proposed method produces significant and consistent improvements over baselines across three domains. |
Similar Papers
Data Augmentation for Low-Resource Keyphrase Generation (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing works on keyphrase generation rely on large-scale annotated datasets, which are not easy to acquire. |
| Approach: | They propose to use full text to improve keyphrase generation in resource-constrained domains by using the full text of the articles to augment their methods. |
| Outcome: | The proposed methods improve both present and absent keyphrase generation on three datasets and show that they are cost-effective. |
ERU-KG: Efficient Reference-aligned Unsupervised Keyphrase Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for keyphrase prediction rely on heuristicically defined importance scores . existing methods lack consideration for time efficiency . |
| Approach: | They propose an unsupervised keyphrase generation model that combines informativeness and phraseness modules. |
| Outcome: | The proposed model outperforms baseline models and achieves 89% of the performance of a supervised model for top 10 predictions. |
Unsupervised Open-domain Keyphrase Generation (2023.acl-long)
Copied to clipboard
| Challenge: | Existing models that generate keyphrases without human-labeled data are lacking in this area. |
| Approach: | They propose a model that consists of two modules that can be built in an unsupervised fashion and can perform consistently across domains. |
| Outcome: | The proposed model performs consistently across domains and narrows the gap between supervised and unsupervised models down to about 16%. |
General-to-Specific Transfer Labeling for Domain Adaptable Keyphrase Generation (2023.findings-acl)
Copied to clipboard
| Challenge: | Large distribution shifts among different domains hinder transferability of keyphrase generation models. |
| Approach: | They propose a pipeline which guides KPG models’ learning focus from general syntactical features to domain-related semantics in a data-efficient manner. |
| Outcome: | The proposed pipeline can produce good quality keyphrases in new domains and achieve consistent improvements after adaptation with limited in-domain annotated data. |
Semi-Supervised Learning for Neural Keyphrase Generation (D18-1)
Copied to clipboard
| Challenge: | Existing models for keyphrase generation only use labeled data, which is limited to resource-rich domains. |
| Approach: | They propose semi-supervised keyphrase generation methods by leveraging labeled data and large-scale unlabeled samples for learning. |
| Outcome: | The proposed methods outperform state-of-the-art models trained with labeled data and large-scale unlabeled samples for learning. |
Improving Low-Resource Keyphrase Generation through Unsupervised Title Phrase Generation (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for unsupervised keyphrase generation use phrases extracted from document title instead of phrase bank. |
| Approach: | They propose a method for generating pseudo labels from a document title . they use phrases mined from the document title to generate absent keyphrases . |
| Outcome: | The proposed method outperforms existing methods on human-annotated datasets even with fewer labeled data. |
Automatic Generation of High Quality CCGbanks for Parser Domain Adaptation (P19-1)
Copied to clipboard
| Challenge: | Existing methods for Combinatory Categorial Grammar (CCG) parsing are limited to a specific parser architecture, making it non-trivial to apply to current parsers. |
| Approach: | They propose a domain adaptation method for Combinatory Categorial Grammar (CCG) they propose to generate CCG corpora using cheaper dependency trees. |
| Outcome: | The proposed method improves on speech conversation and math problems. |
Semi-supervised Domain Adaptation for Dependency Parsing via Improved Contextualized Word Representations (2020.coling-main)
Copied to clipboard
| Challenge: | Recent advances in deep neural network models have improved parsing performance on in-domain texts . however, the problem is to improve performance on out-of-domain text data when there is only a small-scale out-domain labeled data. |
| Approach: | They propose to use adversarial learning and fine-tuning BERT to improve contextualized word representations on out-of-domain texts. |
| Outcome: | The proposed models achieve consistent improvement and fine-tune BERT processes boost parsing accuracy by a large margin. |
Representation Learning for Resource-Constrained Keyphrase Generation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | State-of-the-art keyphrase generation methods depend on large annotated datasets, limiting their performance in domains with limited annotation data. |
| Approach: | They propose a method that first identifies salient information using retrieval-based corpus-level statistics and then learns a task-specific intermediate representation based on a pre-trained language model. |
| Outcome: | The proposed method improves keyphrase generation and zero-shot domain adaptation on multiple keyphrase benchmarks. |
GPL: Generative Pseudo Labeling for Unsupervised Domain Adaptation of Dense Retrieval (2022.naacl-main)
Copied to clipboard
| Challenge: | Dense retrieval approaches suffer from the lexical gap and require large amounts of training data. |
| Approach: | They propose an unsupervised method for domain adaptation that uses query generator and pseudo labeling from a cross-encoder to improve retrieval performance. |
| Outcome: | The proposed method outperforms state-of-the-art retrieval methods on domain-specialized datasets by 9.3 points nDCG@10 on six tasks. |