Challenge: Existing methods for multi-hop QA with open-domain questions require a large number of labeled question-document pairs for retrieval.
Approach: They propose a language-based prompt for multi-hop path reranking that relies on language model prompting to generate a relevance score between a question and the path.
Outcome: The proposed method yields strong retrieval performance on HotpotQA with only 128 training examples compared to state-of-the-art methods trained on thousands of examples.

Similar Papers

Few-Shot Data Synthesis for Open Domain Multi-Hop Question Answering (2024.eacl-long)

Copied to clipboard

Challenge: Recent approaches to multi-hop question answering rely on in-context learning . however, these models contain billions of parameters making them inefficient at inference time.
Approach: They propose a framework that allows for improving smaller language models with less than 10 human-annotated QA pairs by synthesizing millions of multi-hop questions and claims to fine tune language models.
Outcome: The proposed framework improves model performance on multi-hop question answering and fact verification benchmarks while being almost one-third the size in parameter count.
DynRank: Improve Passage Retrieval with Dynamic Zero-Shot Prompting Based on Question Classification (2025.coling-main)

Copied to clipboard

Challenge: Existing approaches to enhancing passage retrieval rely on static prompts and pre-defined templates.
Approach: They propose a dynamic question classification framework for open-domain question-answering systems that generates contextually relevant prompts.
Outcome: The proposed framework improves passage retrieval in open-domain questionanswering systems by generating contextually relevant prompts.
Prompt-and-Rerank: A Method for Zero-Shot and Few-Shot Arbitrary Textual Style Transfer with Small Language Models (2022.emnlp-main)

Copied to clipboard

Challenge: a new method for textual style transfer is proposed for text with a limited set of style choices . textual styles are a complex task that requires specialized models to perform .
Approach: They propose a method for arbitrary textual style transfer using pre-trained language models . they use a mathematical formulation of the TST task, decomposing it into three components .
Outcome: The proposed method performs on par with state-of-the-art large-scale models while using less compute and memory.
Noisy Channel Language Model Prompting for Few-Shot Text Classification (2022.acl-long)

Copied to clipboard

Challenge: Prior work has suggested methods for finding better prompt or scoring of the output from the model.
Approach: They propose a noisy channel approach for language model prompting in few-shot text classification by in-context demonstration or prompt tuning.
Outcome: The proposed model outperforms direct models in both demonstration and prompt tuning.
Prompt-Based Meta-Learning For Few-shot Text Classification (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods to learn text labels require large amounts of data to build many few-shot tasks.
Approach: They propose a Prompt-Based Meta-Learning model that adds the prompting mechanism to the meta-learning method.
Outcome: The proposed method improves on four text classification datasets with high accuracy and robustness.
Exploiting Language Model Prompts Using Similarity Measures: A Case Study on the Word-in-Context Task (2022.acl-short)

Copied to clipboard

Challenge: Existing few-shot approaches fail on the semantic distinction task of the Word-in-Context dataset.
Approach: They propose a prompt-based approach which boosts few-shot performance to the level of fully supervised methods by using similarity metrics.
Outcome: The proposed technique boosts few-shot performance to the level of fully supervised methods.
Discrete Prompt Optimization via Constrained Generation for Zero-shot Re-ranker (2023.findings-acl)

Copied to clipboard

Challenge: Existing studies suggest re-rankers by fine-tuning pre-trained language models . however, manual search for discrete prompts is expensive and sub-optimal in transferability .
Approach: They propose a discrete prompt optimization method that guides the generated texts toward optimal prompts . they propose to use large-scale language models as a zero-shot re-ranker .
Outcome: The proposed method improves the performance of the re-ranker against baselines and human prompts.
PromptReps: Prompting Large Language Models to Generate Dense and Sparse Representations for Zero-Shot Document Retrieval (2024.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) excel in zero-shot document ranking tasks.
Approach: They propose a prompt-based re-ranking method that requires no further training but is only feasible for reranking a handful of candidates due to computational costs.
Outcome: The proposed method can retrieve documents from the entire corpus without training and with a large amount of paired text data.
Zero-shot Approach to Overcome Perturbation Sensitivity of Prompts (2023.acl-long)

Copied to clipboard

Challenge: Recent studies have demonstrated that natural-language prompts can help to leverage the knowledge learned by pre-trained language models for the binary sentence-level sentiment classification task.
Approach: They propose to use few-shot learning settings to fine-tune the sentiment classification model using manual or automatically generated prompts.
Outcome: The proposed method outperforms the base prompt and the prompts generated using few-shot learning for the binary sentence-level sentiment classification task.
Automatic Multi-Label Prompting: Simple and Interpretable Few-Shot Classification (2022.naacl-main)

Copied to clipboard

Challenge: Prompt-based learning is an emerging paradigm for exploiting knowledge learned by a pretrained language model.
Approach: They propose a method to automatically select label mappings for few-shot text classification with prompting.
Outcome: The proposed method achieves competitive performance on the GLUE benchmark without human effort or external resources.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations