Document Set Expansion with Positive-Unlabeled Learning Using Intractable Density Estimation (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing approaches to Document Set Expansion (DSE) rely on the unrealistic assumption of knowing the class prior for positive samples in the collection. |
| Approach: | They propose a novel method that utilizes intractable density estimation models to learn the class prior for positive samples in the collection. |
| Outcome: | The proposed method is based on a set of examples from PubMed and Covid datasets in a transductive setting. |
Similar Papers
Scalable Evaluation and Improvement of Document Set Expansion via Neural Positive-Unlabeled Learning (2021.eacl-main)
Copied to clipboard
| Challenge: | Current methods for document set expansion for large collections are based on word-frequency or bag-of-words document similarity metrics. |
| Approach: | They propose to extend the IR approach by treating the problem as an instance of positive-unlabeled (PU) learning . they propose solutions for each challenge and empirically validate them with ablation tests . |
| Outcome: | The proposed method improves on a PubMed abstract retrieval task . it is compared with existing methods and empirically validated with ablation tests . |
Distantly Supervised Named Entity Recognition using Positive-Unlabeled Learning (P19-1)
Copied to clipboard
| Challenge: | Empirical studies on four public NER datasets demonstrate the effectiveness of our proposed method. |
| Approach: | They propose a method to perform named entity recognition using unlabeled data and named entity dictionaries. |
| Outcome: | The proposed method can estimate task loss as if there is fully labeled data. |
A Unified Positive-Unlabeled Learning Framework for Document-Level Relation Extraction with Different Levels of Labeling (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing document-level relation extraction methods focus on fully supervised scenarios but in real-world, incomplete labeling is a common problem because the number of entity pairs grows quadratically with the number. |
| Approach: | They propose a positive-unlabeled learning framework for document-level relation extraction (RE) that uses shift and squared ranking loss positive- unlabeles (SSR-PU) learning to solve incomplete labeling problem. |
| Outcome: | The proposed framework outperforms state-of-the-art methods under fully supervised and extremely unlabeled conditions and achieves 14 F1 points over the baseline with incomplete labeling. |
PUER: Boosting Few-shot Positive-Unlabeled Entity Resolution with Reinforcement Learning (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to entity resolution focus on supervised learning, but manual annotation is labor-intensive. |
| Approach: | They propose an end-to-end ER solution that leverages Large Language Models in PU learning setting to address low-resource entity resolution. |
| Outcome: | The proposed solution improves the performance of PUER on a positive-unlabeled learning environment. |
Learning Word Embeddings for Low-Resource Languages by PU Learning (N18-1)
Copied to clipboard
| Challenge: | Existing approaches to learn word embedding on a corpus with only a few million tokens are limited to low-resource languages. |
| Approach: | They propose to use a sparse co-occurrence matrix to factorize the co-existence matrix and validate the proposed approaches in four different languages. |
| Outcome: | The proposed model is validated in four different languages. |
CAPSTONE: Curriculum Sampling for Dense Retrieval with Document Expansion (2023.emnlp-main)
Copied to clipboard
| Challenge: | Experimental results show that dense retrieval models are better at obtaining query-informed representations. |
| Approach: | They propose a dual-encoder approach that computes latent representations of query and document independently, but inference replaces the real query with a generated one. |
| Outcome: | The proposed approach outperforms previous dense retrieval models on in-domain and out-of-domain datasets. |
Augmenting Document Representations for Dense Retrieval with Interpolation and Perturbation (2022.acl-short)
Copied to clipboard
| Challenge: | Existing sparse retrieval models rely on term-based matching to retrieve relevant documents. |
| Approach: | They propose a framework which augments the representations of documents with interpolation and perturbation. |
| Outcome: | The proposed framework significantly outperforms baselines on the dense retrieval of both the labeled and unlabeled documents. |
When do Generative Query and Document Expansions Fail? A Comprehensive Study Across Methods, Retrievers, and Datasets (2024.findings-eacl)
Copied to clipboard
| Challenge: | Using large language models (LMs) for query or document expansion can improve generalization in information retrieval. |
| Approach: | They conduct the first comprehensive analysis of large language models (LMs) for query or document expansion. |
| Outcome: | The proposed expansions improve retrieval performance for weaker models but harm stronger models. |
MixLoRA-DSI: Dynamically Expandable Mixture-of-LoRA Experts for Rehearsal-Free Generative Retrieval over Dynamic Corpora (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to update model-based indexes with new documents are expensive and require expensive retraining. |
| Approach: | They propose a framework that combines an expandable mixture of Low-Rank Adaptation experts with a layer-wise out-of-distribution-driven expansion strategy. |
| Outcome: | Experiments on NQ320k and MS MARCO Passage show that the proposed framework outperforms full-model update baselines with minimal parameter overhead and substantially lower training costs. |
Fairness-Aware Online Positive-Unlabeled Learning (2024.emnlp-industry)
Copied to clipboard
| Challenge: | Positive-unlabeled (PU) learning is a new approach to improve text classification by analyzing the impact of the online setting on fairness. |
| Approach: | They propose to extend Positive-Unlabeled (PU) learning to online learning by analyzing the impact of the online setting on fairness. |
| Outcome: | The proposed approach improves fairness in PU learning in both offline and online settings by using only labeled positive and unlabeled samples. |