arXiv:2606. 29639v1 Announce Type: cross Abstract: Automatic prompt optimization is still underexplored for episodic few-shot relation extraction with smaller 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.
arXiv:2606. 15412v1 Announce Type: cross Abstract: Biomedical relation extraction (BioRE) is a key step in transforming biomedical literature into structured knowledge.
arXiv:2606. 26986v1 Announce Type: cross Abstract: Open Relation Extraction (OpenRE) requires a model to extract unseen relations between head and tail entities from unstructured text for real-world applications.
CONSISTRE is a consistency‑aware framework for document‑level relation extraction that tackles contradictions in large language model predictions. It offers two tracks: an inference‑time track that refines black‑box LLM outputs through constraint‑aware prompting, verification, and self‑reflection, and a training‑time track that distills consistency knowledge into smaller open‑source models via supervised fine‑tuning and reinforcement learning. Experiments on DocRED show both tracks outperform baselines, with the inference‑time track matching competitive F1 scores and the training‑time track narrowing the performance gap to proprietary LLMs while reducing inference cost.
Document-level relation extraction (DocRE) aims to extract relations among multiple entities across extended contexts while maintaining consistency across predicted triples. Although large language models (LLMs) show remarkable reasoning capabilities in information extraction, their predictions are typically generated independently for each candidate triple and may violate fundamental relational constraints such as transitivity, symmetry, and functional uniqueness, leading to contradictory and unreliable outputs.
ReHoPER is an inference‑only, zero‑shot method that enhances large language models’ reasoning by generating and answering intermediate questions along multiple paths before producing a final answer. It plans a horizon of candidate intermediate questions, selects one to answer, and replans based on the updated history. The approach is task‑agnostic, using generic instructions across datasets and models without labeled data or task‑specific prompt design, and it outperforms strong baselines on several datasets, notably achieving the largest gains on the new iLLC benchmark for compositional reasoning.
arXiv:2608.30627v1 Announce Type: new Abstract: As language-model compute continues to scale, high-quality training data is becoming an increasingly important bottleneck. Conventional next-token pred...
arXiv:2609.23716v1 Announce Type: cross Abstract: Textual-gradient methods automate prompt optimization through natural-language feedback, but their iterative updates can be unstable. We identify two...
The paper introduces pre‑trained models for extracting variant‑phenotype relations from biomedical text, focusing on the SNPPhenA corpus. Fine‑tuning small BERT‑based models, especially DeBERTa, achieves performance close to the current state‑of‑the‑art. Moreover, careful fine‑tuning of Google’s Gemini Pro 1.0 surpasses existing benchmarks on both sentence‑level and abstract‑level relation extraction tasks.
arXiv:2506.17251v3 Announce Type: replace-cross Abstract: Although large language models (LLMs) have achieved remarkable performance, the inherent stochasticity of their reasoning processes and varyi...
arXiv:2606. 31222v1 Announce Type: new Abstract: Composed image retrieval requires identifying a target image from a gallery by integrating a reference image with a textual modification instruction.
The paper introduces ramework, a blackbox prompt‑minimization framework that identifies the minimal subset of few‑shot prompts necessary for large language models (LLMs). In a case study, the framework reduces few‑shot exemplars by an average of 65.3% in character count while maintaining full propositional output fidelity, revealing that models tend to keep logical identifiers and constraint declarations while discarding natural language prose. The analysis further distinguishes between universal encoder and decoder models, offering insights into prompt compression and structural analysis.