Research
Knowledge Restoration-driven Prompt Optimization: Unlocking LLM Potential for Open-Domain Relational Triplet Extraction
arXiv:2601.15037v2 Announce Type: replace-cross Abstract: Open-domain Relational Triplet Extraction (ORTE) aims to mine structured knowledge without predefined relation schemas. Large Language Models
arXiv:2601.15037v2 Announce Type: replace-cross 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.
Related
- Two-Stage Prompt Optimization for Few-Shot Relation Extraction: From Reasoning-Guided Search to Gradient-Guided Refinement
- LLMs Underperform Graph-Based Parsers on Supervised Relation Extraction for Complex Graphs
- Why LLMs Hallucinate on Structured Knowledge: A Mechanistic Analysis of Reasoning over Linearized Representations
- MO-CAPO: Multi-Objective Cost-Aware Prompt Optimization
Source: arXiv cs.AI | 2026-08-03