Skip to content
aiqbench takeAI Research

aiqbench analysis

This research introduces KRPO, a novel framework for optimizing Large Language Model prompts in open-domain relational triplet extraction without requiring labeled ground-truth data. By leveraging intrinsic feedback from restored textual statements and employing memory-augmented relation canonicalization, the method significantly improves consistency and F1 scores across multiple LLM backbones. The work addresses critical challenges in adapting fixed prompts to varying linguistic contexts while maintaining knowledge graph integrity.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Knowledge Restoration-driven Prompt Optimization: Unlocking LLM Potential for Open-Domain Relational Triplet Extraction

arXiv2 min read

arXiv:2601.15037v2 Announce Type: replace Abstract: Open-domain Relational Triplet Extraction (ORTE) aims to mine structured knowledge without predefined relation schemas. Large Language Models (LLMs) have advanced ORTE toward a prompt-driven paradigm through powerful in-context learning. However, adapting their extraction behavior to varying open-domain contexts remains challenging. Existing methods typically rely on manually crafted prompts that remain fixed across inputs, despite substantial variation in linguistic expressions and contextual structures. This mismatch may lead to unsupported triplets, while the absence of ground-truth annotations makes such deficiencies difficult to identify and correct. Moreover, free-form relation generation produces non-canonical relation surface forms, undermining knowledge graph consistency. To address these challenges, we propose Knowledge Restoration-driven Prompt Optimization (KRPO), a framework for label-free target-corpus adaptation. KRPO restores extracted triplets into textual statements and evaluates their semantic consistency with the source inputs, deriving intrinsic feedback without gold annotations. This feedback is transformed into natural-language optimization guidance for batch-wise prompt optimization and adaptation. KRPO further introduces a Memory-augmented Relation Canonicalizer that aligns free-form relations with a dynamically updated schema memory, improving relation consistency. Experiments on three ORTE benchmarks with multiple LLM backbones demonstrate strong overall performance, with KRPO achieving the best average F1 score across the evaluated settings.

Abstract:Open-domain Relational Triplet Extraction (ORTE) aims to mine structured knowledge without predefined relation schemas. Large Language Models (LLMs) have advanced ORTE toward a prompt-driven paradigm through powerful in-context learning. However, adapting their extraction behavior to varying open-domain contexts remains challenging. Existing methods typically rely on manually crafted prompts that remain fixed across inputs, despite substantial variation in linguistic expressions and contextual structures. This mismatch may lead to unsupported triplets, while the absence of ground-truth annotations makes such deficiencies difficult to identify and correct. Moreover, free-form relation generation produces non-canonical relation surface forms, undermining knowledge graph consistency. To address these challenges, we propose Knowledge Restoration-driven Prompt Optimization (KRPO), a framework for label-free target-corpus adaptation. KRPO restores extracted triplets into textual statements and evaluates their semantic consistency with the source inputs, deriving intrinsic feedback without gold annotations. This feedback is transformed into natural-language optimization guidance for batch-wise prompt optimization and adaptation. KRPO further introduces a Memory-augmented Relation Canonicalizer that aligns free-form relations with a dynamically updated schema memory, improving relation consistency. Experiments on three ORTE benchmarks with multiple LLM backbones demonstrate strong overall performance, with KRPO achieving the best average F1 score across the evaluated settings.

Computation and Language (cs.CL); Artificial Intelligence (cs.AI)

arXiv:2601.15037 [cs.CL]

(or arXiv:2601.15037v2 [cs.CL] for this version)

https://doi.org/10.48550/arXiv.2601.15037 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 290 words

Related coverage