Papers › Fine-tune Bert for DocRED with Two-step Process
Fine-tune Bert for DocRED with Two-step Process
Hong Wang, Christfried Focke, Rob Sylvester, Nilesh Mishra, William Wang
Modelling relations between multiple entities has attracted increasing attention recently, and a new dataset called DocRED has been collected in order to accelerate the research on the document-level relation extraction. Current baselines for this task uses BiLSTM to encode the whole document and are trained from scratch. We argue that such simple baselines are not strong enough to model to complex interaction between entities. In this paper, we further apply a pre-trained language model (BERT) to provide a stronger baseline for this task. We also find that solving this task in phases can further improve the performance. The first step is to predict whether or not two entities have a relation, the second step is to predict the specific relation.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
1 archive task tag without a task page not shown.
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Relation Extraction | DocRED | Two-Step+BERT-base | F1 | 53.92 | #55 of 62 | Archive leaderboard | report |
| Relation Extraction | DocRED | Two-Step+BERT-base | Ign F1 | 54.42 | #55 of 62 | Archive leaderboard | report |
| Relation Extraction | DocRED | BERT-base | F1 | 53.22 | #57 of 62 | Archive leaderboard | report |
| Relation Extraction | DocRED | BERT-base | Ign F1 | 56.17 | #57 of 62 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections