arXiv Computation and Language

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.

arXiv Computation and Language
Aug 25

A Multi-Domain and Multi-Task Generative Framework with Explicit Task and Domain Conditioning for Cross-Domain Event Extraction

The paper introduces a unified multi-domain and multi-task generative framework for event extraction that incorporates explicit domain conditioning signals and task-specific prompts. This design allows a single model to adapt dynamically to different event schemas without needing full event label sets during inference, supporting both pipeline and end-to-end extraction. Experiments on various benchmarks show competitive performance, strong cross-domain generalization, and practical scalability while maintaining domain-specific precision.

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

A Scalable Cross-Domain Event Extraction System via a Unified Generative Training Framework

The paper introduces a scalable cross‑domain event extraction system built on a unified generative sequence‑to‑sequence framework. It jointly handles event detection and argument extraction, allowing both pipeline and end‑to‑end configurations. By fine‑tuning pretrained language models on multiple event datasets from diverse domains, the system retains domain‑specific semantics while generalizing across large, evolving label spaces, and offers a web‑based application for researchers to upload documents, extract events, visualize triggers and arguments, and compare configurations.

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

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

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.

By Mikel Zubillaga, Oscar Sainz, Oier Lopez de Lacalle, Eneko Agirre
arXiv Machine Learning
Jun 9

ConSteer-RL: Steering Reasoning Capabilities in Large Language Models via Confidence-Aware Reinforcement Learning

arXiv:2606. 08088v1 Announce Type: new Abstract: Reinforcement Learning from Verifiable Rewards (RLVR) has recently become a key paradigm for improving the reasoning abilities of Large Language Models (LLMs), yet it remains limited by sparse binary rewards and its ignorance of model-internal uncertainty.

By Qing Miao, Yiming Zhao, Jing Yang, Chenxi Liu, Yuehai Chen, Yuewen Liu, Shaoyi Du, Badong Chen
arXiv AI
4d ago

Design the Feedback, Not Just the Reward: Environments for Open-Ended Reinforcement Learning

The paper proposes a reinforcement learning framework that emphasizes designing feedback environments rather than solely relying on rewards. It integrates human domain knowledge via rubrics and model reasoning with hierarchical rewards to evaluate complex, partially successful outputs in open‑ended tasks. Applied to interactive web application generation, the model achieves 41.25% pass rate on MiniAppBench and 76.19% on ArtifactsBench, with ablation studies confirming the value of each component.

By Rui Jin, Jikai Chen, Chengyue Yu, Yihan Chen, Hao Zhou, Demin Zhu, Kaichen Yang, Dong Wang, Linjian Mo, Chenyi Zhuang
arXiv AI
Jun 16

STRIDE: Strategic Trajectory Reasoning via Discriminative Estimation for Verifiable Reinforcement Learning

arXiv:2606. 15866v1 Announce Type: new Abstract: Reinforcement Learning with Verifiable Rewards (RLVR) has become an effective post-training paradigm for improving the reasoning abilities of large language models.

By Qinjian Zhao, Zhihao Dou, Dinggen Zhang, Xiangyu Li, Chaoda Song, Zhongwei Wan, Xinpeng Li, Yanyan Zhang, Kaijie Chen, Qingtao Pan, Chengcheng Feng, Zhiqiang Gao, Xiaoyu Xia
arXiv Computation and Language
Oct 8

Judging in Latent Space: Efficient Generative Reward Modeling via Semantics-Preserving Compression

arXiv:2610.09788v1 Announce Type: new Abstract: Reward modeling often requires jointly representing and reasoning over multiple evaluation criteria, yet verbalizing this process token by token can in...

By Mingqing Yuan (Soochow University), Xiaobo Liang (Soochow University), Junwei Yang (University of Cambridge), Ziwei Chen (Chalmers University of Technology), Zeren Zhang (Peking University), Hejin Wang (Tsinghua University), Yubin Wang (The Hong Kong University of Science,Technology), Juntao Li (Soochow University)