Evidence map›Paper›PMID 40149208›Full record

ArticleEntropy (Basel, Switzerland)2025

A Reinforcement Learning-Based Generative Approach for Event Temporal Relation Extraction.

Zhonghua Wu, Wenzhong Yang, Meng Zhang, Fuyuan Wei, Xinfang Liu

Abstract read
In one paragraph

Article in Entropy (Basel, Switzerland), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Zhonghua WuSchool of Computer Science and Technology, Xinjiang University, Urumqi 830017, China.
Wenzhong YangSchool of Computer Science and Technology, Xinjiang University, Urumqi 830017, China.ORCID 0009-0000-9351-8738
Meng ZhangSchool of Computer Science and Technology, Xinjiang University, Urumqi 830017, China.ORCID 0009-0000-0212-1605
Fuyuan WeiSchool of Computer Science and Technology, Xinjiang University, Urumqi 830017, China.
Xinfang LiuSchool of Computer Science and Technology, Xinjiang University, Urumqi 830017, China.

Funding

Autonomous Region Science and Technology Program 20220412033Central Guiding Local Special Projects ZYYD2022C19National Natural Science Foundation of China 62262065National Natural Science Foundation of China 62341206"Tianshan Talent" Research Project of Xinjiang 2022TSYCLJ0037
6 · The paper itself

Abstract

Event temporal relation extraction is a crucial task in natural language processing, aimed at recognizing the temporal relations between event triggers in a text. Despite extensive efforts in this area, the existing methods face two main issues. Firstly, the previous models for event temporal relation extraction mainly rely on a classification framework, which fails to output the crucial contextual words necessary for predicting the temporal relations between two event triggers. Secondly, the prior research that formulated natural language processing tasks as text generation problems usually trained the generative models by maximum likelihood estimation. However, this approach encounters potential difficulties when the optimization objective is misaligned with the task performance metrics. To resolve these limitations, we introduce a reinforcement learning-based generative framework for event temporal relation extraction. Specifically, to output the important contextual words from the input sentence for temporal relation identification, we introduce dependency path generation as an auxiliary task to complement event temporal relation extraction. This task is solved alongside temporal relation prediction to enhance model performance. To achieve this, we reformulate the event temporal relation extraction task as a text generation problem, aiming to generate both event temporal relation labels and dependency path words based on the input sentence. To bridge the gap between the optimization objective and task performance metrics, we employ the REINFORCE algorithm to optimize our generative model, designing a novel reward function to simultaneously capture the accuracy of temporal prediction and the quality of generation. Lastly, to mitigate the high variance issue encountered when using the REINFORCE algorithm in multi-task generative model training, we propose a baseline policy gradient algorithm to improve the stability and efficiency of the training process. Experimental results on two widely used datasets, MATRES and TB-DENSE, show that our approach exhibits competitive performance.

Indexed as

dependency pathgenerative modelsmulti-task learningpolicy gradient methodreinforcement learningtemporal relation extraction

Identifiers

PMID40149208
PMCPMC11940891

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.