DRAFT: Dense Retrieval Augmented Few-shot Topic classifier Framework (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for few-shot topic classification are limited due to the volume of information pouring in from the Internet . a new framework is proposed to train a classifier for few shot topics . |
| Approach: | They propose a framework to train a classifier for few-shot topic classification using a customized dataset and a dense retriever model. |
| Outcome: | The proposed framework shows superior performance on few-shot topic classification tasks compared to baselines that use in-context learning . |
Similar Papers
Human in the Loop: How to Effectively Create Coherent Topics by Manually Labeling Only a Few Documents per Class (2024.lrec-main)
Copied to clipboard
| Challenge: | Few-shot methods for accurate modeling under sparse label-settings are still challenging in document classification. |
| Approach: | They propose to combine supervised few-shot learning with a topic extraction method to generate coherent topics in large text corpora. |
| Outcome: | The proposed method outperforms unsupervised topic modeling methods in document classification. |
Retrieval-Augmented Few-shot Text Classification (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for retrieval-augmented text classification are successful in the few-shot scenario with limited retrieval space. |
| Approach: | They propose to use EM-L and R-L to provide task-specific guidance to retrieval metric . they also propose to incorporate retrieved memory alongside parameters for better generalization . |
| Outcome: | The proposed methods perform better on the few-shot scenario with limited retrieval space. |
Incremental Few-shot Text Classification with Multi-round New Classes: Formulation, Dataset and System (2021.naacl-main)
Copied to clipboard
| Challenge: | Text classification is usually studied by labeling texts with relevant categories from a predefined set. |
| Approach: | They propose a task where a system incrementally handles multiple rounds of new classes . they propose two entailment approaches, ENTAILMENT and HYBRID, which show promise . |
| Outcome: | The proposed task is based on a few-shot text classification task in the NLP domain. |
Few-shot In-context Learning on Knowledge Base Question Answering (2023.acl-long)
Copied to clipboard
| Challenge: | KB-BINDER enables few-shot in-context learning over knowledge base questions . KBQA is a difficult problem due to the heterogeneity of knowledge bases . |
| Approach: | They propose a framework that enables few-shot in-context learning over KBQA tasks. |
| Outcome: | The proposed framework can outperform state-of-the-art models on GraphQA and MetaQA datasets. |
BYOC: Personalized Few-Shot Classification with Co-Authored Class Descriptions (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to text classification require large annotated corpora to train or long context to fit many examples. |
| Approach: | They propose a method to few-shot text classification using an LLM. |
| Outcome: | The proposed approach yields high accuracy classifiers within 79% of the performance of models trained with larger datasets while using only 1% of their training sets. |
Adaptive Meta-learner via Gradient Similarity for Few-shot Text Classification (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for few-shot text classification suffer from overfitting due to the lack of matching between the few amount of samples and complicated models. |
| Approach: | They propose a method to improve model generalization ability to a new task by leveraging a meta-learner via gradient similarity method. |
| Outcome: | The proposed method improves few-shot text classification performance on several benchmarks. |
Few-shot Intent Classification and Slot Filling with Retrieved Examples (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing methods for few-shot learning are based on labeled examples, but they are non-trivial . few-sshot learning is challenging due to the imbalance in the amount of data between the source and target domains. |
| Approach: | They propose retrieval-based methods for intent classification and slot filling tasks . they use a batch-softmax objective to learn similar contextualized representations for spans . |
| Outcome: | The proposed method outperforms previous systems on the CLINC and SNIPS benchmarks. |
On Task-personalized Multimodal Few-shot Learning for Visually-rich Document Entity Retrieval (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Visually-rich document entity retrieval (VDER) is an important topic in industrial NLP applications. |
| Approach: | They propose a task-aware meta-learning framework to tackle the problem of visually-rich document entity retrieval (VDER) they adopt a hierarchical decoder and employ contrastive learning to achieve this goal. |
| Outcome: | The proposed framework significantly improves the robustness of popular meta-learning baselines. |
ReList: A Multi-objective Reasoning Framework for Diversified Listwise Query Recommendation (2026.acl-industry)
Copied to clipboard
| Challenge: | Existing methods for related search have limited semantic redundancy and wasted retrieval quota . generative retrieval approaches lack explicit reasoning, relying on superficial click-through rate rewards . |
| Approach: | They propose a framework that transforms related search into a reasoning-enhanced listwise generation task. |
| Outcome: | Experimental results show that ReList outperforms state-of-the-art methods in query diversity and user engagement. |
Meta-Information Guided Meta-Learning for Few-Shot Relation Classification (2020.coling-main)
Copied to clipboard
| Challenge: | Existing meta-learning models rely on implicit instance statistics and are unreliability and weak interpretability. |
| Approach: | They propose a meta-information guided meta-learning framework that uses semantics to guide meta- learning . experimental results demonstrate the effectiveness of the proposed framework . |
| Outcome: | The proposed framework can establish connections between instance-based information and semantic-based data, enabling faster initialization and adaptation. |