Challenge: Existing methods for few-shot and zero-shot fact verification require a large set of training data.
Approach: They propose a method to prompt pre-trained language models to be consistent to improve the factuality assessment capability of PLMs.
Outcome: The proposed method outperforms state-of-the-art few-shot fact verification models with a small number of unlabeled instances on zero-shot verification.

Similar Papers

Making Pre-trained Language Models Better Few-shot Learners (2021.acl-long)

Copied to clipboard

Challenge: Recent studies show that the GPT-3 model can perform few-shots on language understanding tasks with a natural-language prompt and a few task demonstrations.
Approach: They propose a technique for fine-tuning language models using a few examples . they propose LM-BFF, which uses prompt-based fine-uning and a pipeline for automating prompt generation .
Outcome: The proposed approach outperforms standard fine-tuning procedures on a range of NLP tasks.
Prompt Consistency for Zero-Shot Task Generalization (2022.findings-emnlp)

Copied to clipboard

Challenge: Recent work has shown that pre-trained language models can perform zero-shot generalization to new tasks without annotated examples.
Approach: They propose to regularize prompt consistency to encourage consistent predictions over a diverse set of prompts.
Outcome: The proposed approach outperforms the state-of-the-art zero-shot learner, T0, on 9 out of 11 datasets across 4 NLP tasks by 10.6 absolute points in terms of accuracy.
Pre-trained Language Models Can be Fully Zero-Shot Learners (2023.acl-long)

Copied to clipboard

Challenge: Existing approaches to pre-trained language models require fine-tuning on labeled datasets or manually constructing proper prompts.
Approach: They propose a nonparametric prompting PLM for fully zero-shot language understanding . they compare it to previous methods for text classification and text entailment .
Outcome: The proposed method outperforms previous methods on diverse tasks.
EICO: Improving Few-Shot Text Classification via Explicit and Implicit Consistency Regularization (2022.findings-acl)

Copied to clipboard

Challenge: Existing methods for few-shot text classification are limited by labeled data.
Approach: They propose to use consistency regularization to improve few-shot text classification by generating pseudo-labels from weakly-augmented and strongly-augmented views.
Outcome: The proposed method achieves competitive performance with 16 labeled examples with prompt and verbalizer.
Prompt-free and Efficient Few-shot Learning with Language Models (2022.acl-long)

Copied to clipboard

Challenge: Existing methods for few-shot fine-tuning of pretrained language models require carefully engineered prompts and verbalizers to convert inputs into a cloze-format that the PLM can score.
Approach: They propose a method for few-shot fine-tuning of pretrained language models that uses task-specific adapters instead of manually engineered prompts and verbalizers.
Outcome: The proposed method outperforms existing state-of-the-art methods on a wide range of few shot NLP tasks.
Continued Pretraining for Better Zero- and Few-Shot Promptability (2022.emnlp-main)

Copied to clipboard

Challenge: Recent language model prompting methods can achieve high accuracy in zero- and few-shot settings while requiring few to no learned task-specific parameters.
Approach: They propose to use a dedicated pretraining stage to improve promptability in zero-shot settings and few-shot tuning.
Outcome: The proposed method improves promptability in zero- and few-shot settings, while the existing method yields subpar performance.
Better Zero-Shot Reasoning with Self-Adaptive Prompting (2023.findings-acl)

Copied to clipboard

Challenge: Modern large language models (LLMs) have demonstrated impressive capabilities at sophisticated tasks, often through step-by-step reasoning similar to humans.
Approach: They propose a new method that uses a set of examples from the LLM zero-shot outputs to improve performance.
Outcome: The proposed method improves performance up to 15% compared to baselines and matches or exceeds few-shot baselines at a range of reasoning tasks.
PPT: Pre-trained Prompt Tuning for Few-shot Learning (2022.acl-long)

Copied to clipboard

Challenge: Prompt tuning for pre-trained language models has shown remarkable performance . however, prompt tuning is still not fully explored .
Approach: They propose to pre-train prompts by adding soft prompts into the pre-training stage to obtain a better initialization.
Outcome: The proposed framework outperforms full-model tuning under full-data and few-shot learning settings.
Zero-Shot Fact Verification via Natural Logic and Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Recent advancements in fact verification systems with natural logic have enhanced their explainability by aligning claims with evidence through set-theoretic operators, providing faithful justifications.
Approach: They propose a method that utilizes the generalization capabilities of instruction-tuned large language models to provide faithful justifications.
Outcome: The proposed method outperforms other systems that were not specifically trained on natural logic data, and achieves an average accuracy improvement of 8.96 points over the baseline.
SparseFit: Few-shot Prompting with Sparse Fine-tuning for Jointly Generating Predictions and Natural Language Explanations (2024.acl-long)

Copied to clipboard

Challenge: Models that generate natural language explanations (NLEs) for their predictions often require large datasets of human-written NLEs at training time, which can be expensive and time-consuming to collect.
Approach: They propose a sparse few-shot fine-tuning strategy that leverages discrete prompts to jointly generate predictions and NLEs.
Outcome: The proposed approach compares sparse few-shot fine-tuning with existing parametric fine- tuning techniques on three sizes of the T5 language model and four datasets and produces competitive results for both task performance and NLE quality.

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