arXiv Computation and Language By Mikel Zubillaga, Oscar Sainz, Oier Lopez de Lacalle, Eneko Agirre

Do not be greedy, Think Twice: Sampling and Selection for Document-level Information Extraction

Read the original on arXiv Computation and Language →

The paper introduces ThinkTwice, a framework that uses sampling and selection to improve document‑level information extraction. Instead of relying on greedy decoding, the method generates multiple candidate templates and selects the best one via an unsupervised agreement‑based approach or a supervised reward model. It also proposes a rejection‑sampling technique to create silver training data for reasoning traces, and experimental results show that ThinkTwice consistently outperforms greedy baselines and the current supervised state‑of‑the‑art.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv Computation and Language
Sep 25

EAGER: Enhancing Generative Event Extraction via Reinforcement Learning with Verifiable Rewards

EAGER is a reinforcement learning framework for generative event extraction that uses fine‑grained verifiable rewards and Schema‑Contrastive Advantage Estimation to address advantage collapse in sparse binary reward settings. The reward design focuses on structural validity, extraction accuracy, groundedness, coverage, over‑generation, and span precision. Across seven benchmark datasets, EAGER outperforms prompting, supervised fine‑tuning, and previous reinforcement learning baselines, achieving a substantial improvement over the strongest prior method.

By Omar Adjali, Siting Liang, Omair Shahzad Bhatti, Daniel Sonntag
arXiv Computation and Language
Aug 25

ConvergeWriter: Data-Driven Bottom-Up Article Construction

ConvergeWriter introduces a bottom‑up, data‑driven framework for long‑form document generation that first retrieves exhaustive knowledge from a source corpus and clusters it into distinct knowledge groups. These clusters then guide the creation of a hierarchical outline and the final text, ensuring the output is strictly grounded in the retrieved material and traceable to its sources. Experiments on 14B and 32B LLMs show that this approach matches or surpasses state‑of‑the‑art baselines, especially in scenarios requiring high factual fidelity and structural coherence.

By Binquan Ji, Jiaqi Wang, Ruiting Li, Xingchen Han, Yiyang Qi, Shichao Wang, Yifei Lu, Yuantao Han, Feiliang Ren
arXiv Computation and Language
Sep 25

CONSISTRE: A Unified Consistency-Aware Framework for Document-Level Relation Extraction with Large Language Models

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.

By Mingxuan Sun
Hugging Face Trending Papers
Jul 27

CONSISTRE: A Unified Consistency-Aware Framework for Document-Level Relation Extraction with Large Language Models

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.

arXiv AI
Aug 5

DocTrace: Towards Traceable Long Document VQA via Hierarchical Evidence Graph Reasoning

arXiv:2608. 03292v1 Announce Type: new Abstract: Long Document Visual Question Answering (LongDocVQA) requires Multimodal Large Language Models (MLLMs) to locate, integrate, and reason over heterogeneous document elements distributed across multiple pages.

By Le Xiang, Zhicheng Guan, Hong Chen, Xiaocong Lin, Zhenghua Lei, Teng Hu, Bolei He, Long Zeng