Pith. sign in

REVIEW 4 cited by

Revisiting Large Language Models as Zero-shot Relation Extractors

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.05028 v4 pith:DBK5BKOC submitted 2023-10-08 cs.AI cs.CL

classification cs.AIcs.CL
keywords llmszero-shotlanguagerelationdifferentmodelsperformanceprompt
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Relation extraction (RE) consistently involves a certain degree of labeled or unlabeled data even if under zero-shot setting. Recent studies have shown that large language models (LLMs) transfer well to new tasks out-of-the-box simply given a natural language prompt, which provides the possibility of extracting relations from text without any data and parameter tuning. This work focuses on the study of exploring LLMs, such as ChatGPT, as zero-shot relation extractors. On the one hand, we analyze the drawbacks of existing RE prompts and attempt to incorporate recent prompt techniques such as chain-of-thought (CoT) to improve zero-shot RE. We propose the summarize-and-ask (\textsc{SumAsk}) prompting, a simple prompt recursively using LLMs to transform RE inputs to the effective question answering (QA) format. On the other hand, we conduct comprehensive experiments on various benchmarks and settings to investigate the capabilities of LLMs on zero-shot RE. Specifically, we have the following findings: (i) \textsc{SumAsk} consistently and significantly improves LLMs performance on different model sizes, benchmarks and settings; (ii) Zero-shot prompting with ChatGPT achieves competitive or superior results compared with zero-shot and fully supervised methods; (iii) LLMs deliver promising performance in extracting overlapping relations; (iv) The performance varies greatly regarding different relations. Different from small language models, LLMs are effective in handling challenge none-of-the-above (NoTA) relation.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. LA-RL: Label-Aware Self-Reflection for Reinforcement Learning in Information Extraction

    cs.CL 2026-07 conditional novelty 6.0 of 10

    Label-aware diagnostic reflection plus two-stage outcome GRPO improves same-backbone IE F1 over SFT, with larger gains under relation-extraction domain shift.

  2. MicLog: Towards Accurate and Efficient LLM-based Log Parsing via Progressive Meta In-Context Learning

    cs.SE 2026-01 conditional novelty 6.0 of 10

    A small open-source LLM trained with progressive meta in-context learning parses logs more accurately and faster than prior state-of-the-art LLM parsers on Loghub-2.0.

  3. What's on My Network? Using Large Language Models to Identify Real-World IoT Devices at Scale

    cs.LG 2025-09 conditional novelty 6.0 of 10

    An instruction-tuned LLaMA 3.1 8B model, trained on LLM-generated pseudo-labels, is claimed to identify IoT device vendors from passive network metadata with 98.25% top-1 accuracy across 2,015 vendors.

  4. Beyond path selection: Better LLMs for Scientific Information Extraction with MimicSFT and Relevance and Rule-induced(R$^2$)GRPO

    cs.CL 2025-05 conditional novelty 6.0 of 10

    MimicSFT plus R2GRPO improves scientific relation extraction in LLMs, beating supervised baselines and showing RLVR can expand reasoning capacity.

Pith tools