Cited by 3Topic ModelingNatural Language Processing TechniquesAdvanced Graph Neural Networks

ODDA: An OODA-Driven Diverse Data Augmentation Framework for Low-Resource Relation Extraction

Open access
Zhong, Yijie, Gao, Yunfan, Zhang, Xiaolian, Wang, Haofen·2025·Findings of the Association for Computational Linguistics: ACL 2025

Abstract

Data Augmentation (DA) has emerged as a promising solution to address the scarcity of high-quality annotated data in low-resource relation extraction (LRE).Leveraging large language models (LLMs), DA has significantly improved the performance of RE models with considerably fewer parameters.However, existing DA methods struggle with diversity misalignments, as they neglect the diversity required by the model and generate homogeneous augmentations that do not cover the inter-sample and inter-relation variability, leading to suboptimal performance.Inspired by the Observe-Orient-Decide-Act (OODA) framework, which provides a robust theoretical foundation for iterative decision-making under dynamic conditions, we propose an OODA-driven Diverse DA method (ODDA), guiding the data generation and selection process.ODDA first observes the RE model's behavior to select effective demonstrations for LLMs.Next, it orients LLMs towards generating diverse data by replacing schema constraints with attribute constraints.Then ODDA decides on the final augmented dataset with overall diversity from a global search and finally acts to train the RE model.Extensive experiments on three widely-used benchmarks demonstrate that ODDA consistently outperforms state-of-the-art baselines, achieving average F1 improvements of 3.1% across various LRE scenarios while maintaining enhanced model stability.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/2025.findings-acl.15

Cites

44 of 44 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Existing long-term memory methods typically follow two directions: continuously recording, summarizing, and updating dialogue histories as memory, or transforming conversations into structured graph-based memory using OpenIE.

    “These approaches typically follow two directions: (i) continuously recording, summarizing, and updating dialogue histories as memory [2, 23, 39, 44], or (ii) transforming conversations into structured graphbased memory using techniques such as OpenIE [19, 40, 57, 58].”

    From HingeMem: Boundary Guided Long-Term Memory with Query Adaptive Retrieval for Scalable Dialogues (2026) · cites this paper as [57]

    The Related Work section discusses data augmentation for low-resource relation extraction, not methods for maintaining long-term dialogue memory. Searches for recording and summarizing dialogue histories and for OpenIE-based graph memory found no passage addressing either direction in our copy. (LLM, conf=0.77)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

7 of the 51 references couldn’t be matched to a known paper.

Research works printed but not linked: 9

  1. Huajun Chen. 2024. Large knowledge model: Perspec- tives and challenges. Data Intelligence, 6(3):587- 620.
  2. Alexander R. Fabbri, Simeng Han, Haoyuan Li, Hao- ran Li, Marjan Ghazvininejad, Shafiq R. Joty, Dragomir R. Radev, and Yashar Mehdad. 2021. Im- proving zero and few-shot abstractive summariza- tion with intermediate fine-tuning and data augmenta- tion. In NAACL-HLT, pages 704-717. Association for Computational Linguistics.
  3. Guozheng Li, Peng Wang, and Wenjun Ke. 2023b. Re- visiting large language models as zero-shot relation extractors. In EMNLP (Findings), pages 6877-6892. Association for Computational Linguistics.
  4. Francesco Molfese, Simone Conia, Riccardo Orlando, and Roberto Navigli. 2024. ZEBRA: zero-shot example-based retrieval augmentation for common- sense question answering. In EMNLP, pages 22429- 22444. Association for Computational Linguistics.
  5. Rosel Oida-Onesa and Melvin A. Ballera. 2024. Fine tuning language models: A tale of two low-resource languages. Data Intelligence, 6(4):946-967.
  6. ACL.
  7. Krishna Pillutla, Lang Liu, John Thickstun, Sean Welleck, Swabha Swayamdipta, Rowan Zellers, Se- woong Oh, Yejin Choi, and Zaid Harchaoui. 2023. MAUVE Scores for Generative Models: Theory and Practice. JMLR.
  8. Swabha Swayamdipta, Roy Schwartz, Nicholas Lourie, Yizhong Wang, Hannaneh Hajishirzi, Noah A. Smith, and Yejin Choi. 2020. Dataset cartography: Map- ping and diagnosing datasets with training dynamics. In EMNLP (1), pages 9275-9293. Association for Computational Linguistics.
  9. "He is being charged with murder," the detective stated during the press conference.

Cited by

Sorted by citations

Authors
Zhong, Y., Gao, Y., Zhang, X., & Wang, H.
Affiliations
  • Tongji University (CN)
  • Huawei Technologies (China) (CN)
Venue
Findings of the Association for Computational Linguistics: ACL 2025
Published
2025
Pages
267-285
OpenAlex
W4412888960
Cited by
3
References
51
Citations by year
2026: 3
FWCI
2.84
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
Findings of the Association for Computational Linguistics: ACL (Findings of ACL) (publishedVersion, cc-by)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
Keywords
data augmentation, large language models, schema constraints, attribute constraints, demonstration selection

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review