paper-with-me

Papers

DiscoSG: Towards Discourse-Level Text Scene Graph Parsing through Iterative Graph Refinement

2025-06-18 · Shaoqing Lin, Chong Teng, Fei Li, Donghong Ji, Lizhen Qu, Zhuang Li

Vision-Language Models (VLMs) now generate discourse-level, multi-sentence visual descriptions, challenging text scene graph parsers originally designed for single-sentence caption-to-graph mapping. Current approaches typically merge sentence-level parsing outputs for discourse input, often missing phenomena like cross-sentence coreference, resulting in fragmented graphs and degraded downstream VLM task performance. To address this, we introduce a new task, Discourse-level text Scene Graph parsing (DiscoSG), supported by our dataset DiscoSG-DS, which comprises 400 expert-annotated and 8,430 synthesised multi-sentence caption-graph pairs for images. Each caption averages 9 sentences, and each graph contains at least 3 times more triples than those in existing datasets. While fine-tuning large PLMs (i.e., GPT-4) on DiscoSG-DS improves SPICE by approximately 48% over the best sentence-merging baseline, high inference cost and restrictive licensing hinder its open-source use, and smaller fine-tuned PLMs struggle with complex graphs. We propose DiscoSG-Refiner, which drafts a base graph using one small PLM, then employs a second PLM to iteratively propose graph edits, reducing full-graph generation overhead. Using two Flan-T5-Base models, DiscoSG-Refiner still improves SPICE by approximately 30% over the best baseline while achieving 86 times faster inference than GPT-4. It also consistently improves downstream VLM tasks like discourse-level caption evaluation and hallucination detection. Code and data are available at: https://github.com/ShaoqLin/DiscoSG

📄 PDF Abstract BibTeX arXiv:2506.15583

Code (2)

shaoqlin/discosg 공식 구현 pytorch
zhuang-li/factual pytorch

Tasks

Graph GenerationHallucinationSentence

Methods 이 논문이 사용한 방법론

Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Absolute Position Encodings Absolute Position Encodings are a type of position embeddings for [Transformer-based models] where positional encodings are…
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Transformer A Transformer is a model architecture that eschews recurrence and instead relies entirely on an [attention…

Similar Papers 제목 키워드 기반

Discourse Parsing in Videos: A Multi-modal Appraoch

2019-03-06 · Arjun R. Akula, Song-Chun Zhu

Text-level discourse parsing aims to unmask how two sentences in the text are related to each other. We propose the task of Visual Discourse Parsing, which requires understanding discourse relations among scenes in a vid…

Discourse ParsingVisual DialogVisual Storytelling

Context Tracking Network: Graph-based Context Modeling for Implicit Discourse Relation Recognition

2021-06-01 · NAACL 2021 4 · Yingxue Zhang, Fandong Meng, Peng Li, Ping Jian 외

Implicit discourse relation recognition (IDRR) aims to identify logical relations between two adjacent sentences in the discourse. Existing models fail to fully utilize the contextual information which plays an important…

RelationSentence

DAGN: Discourse-Aware Graph Network for Logical Reasoning

2021-03-26 · NAACL 2021 4 · Yinya Huang, Meng Fang, Yu Cao, LiWei Wang 외

Recent QA with logical reasoning questions requires passage-level relations among the sentences. However, current approaches still focus on sentence-level relations interacting among tokens. In this work, we explore aggr…

Logical ReasoningSentence

G^2C-MT: Graph-Guided Context Selection for Document-Level Machine Translation

2026-06-02 · Baijun Ji, Zixuan Zhou, Xiangyu Duan, Yu Liu 외 arxiv

Effective document-level machine translation (DocMT) requires capturing long-range discourse dependencies. Recent work has explored retrieval-based and discourse-aware context selection. However, these approaches often l…

Machine TranslationSemantic Similarity

Identifying the Discourse Function of News Article Paragraphs

2018-08-01 · COLING 2018 8 · W. Victor Yarlott, Cristina Cornelio, Tian Gao, Mark Finlayson

Discourse structure is a key aspect of all forms of text, providing valuable information both to humans and machines. We applied the hierarchical theory of news discourse developed by van Dijk to examine how paragraphs o…

ArticlesBIG-bench Machine Learning