Pith. sign in

REVIEW 1 cited by

Enhancing Dialogue Generation via Dynamic Graph Knowledge Aggregation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2306.16195 v1 pith:HYGAGIMQ submitted 2023-06-28 cs.CL cs.AI

classification cs.CLcs.AI
keywords graphknowledgeframeworkdialoguegenerationtextaggregationfeature
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Incorporating external graph knowledge into neural chatbot models has been proven effective for enhancing dialogue generation. However, in conventional graph neural networks (GNNs), message passing on a graph is independent from text, resulting in the graph representation hidden space differing from that of the text. This training regime of existing models therefore leads to a semantic gap between graph knowledge and text. In this study, we propose a novel framework for knowledge graph enhanced dialogue generation. We dynamically construct a multi-hop knowledge graph with pseudo nodes to involve the language model in feature aggregation within the graph at all steps. To avoid the semantic biases caused by learning on vanilla subgraphs, the proposed framework applies hierarchical graph attention to aggregate graph features on pseudo nodes and then attains a global feature. Therefore, the framework can better utilise the heterogeneous features from both the post and external graph knowledge. Extensive experiments demonstrate that our framework outperforms state-of-the-art (SOTA) baselines on dialogue generation. Further analysis also shows that our representation learning framework can fill the semantic gap by coagulating representations of both text and graph knowledge. Moreover, the language model also learns how to better select knowledge triples for a more informative response via exploiting subgraph patterns within our feature aggregation process. Our code and resources are available at https://github.com/tangg555/SaBART.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Matching Game Preferences Through Dialogical Large Language Models: A Perspective

    cs.AI 2025-07 conditional novelty 4.0 of 10

    This perspective paper proposes the D-LLM framework, which couples the authors' GRAPHYP knowledge graphs with LLMs to personalize AI responses and make reasoning traceable, but no empirical validation is presented.

Pith tools