preprints.org > computer science and mathematics > artificial intelligence and machine learning > doi: 10.20944/preprints202408.2225.v1 (registering DOI)

Preprint Article Version 1 This version is not peer-reviewed

Version 1 : Received: 29 August 2024 / Approved: 30 August 2024 / Online: 30 August 2024 (10:36:00 CEST)

This study innovates upon the field of dialog-driven query resolution (DDQR) utilizing knowledge graphs (KGs). Traditional methods in DDQR predominantly depend on fully supervised signals that presuppose the existence of perfect logical forms for queries. This reliance on gold logical forms for answer extraction is impractical in diverse real-world applications. When such forms are absent, contemporary methods, which lean on weak supervisory signals or employ heuristic and reinforcement strategies, recast DDQR as a knowledge graph path optimization problem. Despite the non-availability of gold logical forms, the rich conversational context provided by comprehensive dialog histories and domain-specific knowledge can be leveraged to optimize path selection in KGs effectively. We introduce an advanced method, termed CONVEX (CONVersational EXploration), which utilizes contrastive learning for path ranking. CONVEX addresses critical challenges by enabling learning under weak supervision and integrating the conversational context to enhance the representation quality for more effective path discrimination. Extensive evaluations of CONVEX on established benchmarks demonstrate its superiority across various metrics over current methods, notably improving Mean Reciprocal Rank (MRR) and Hit@5 by up to 20 and 36 percentage points respectively.

natural language processing; question answering; knowledge graphs; contrastive learning

Computer Science and Mathematics, Artificial Intelligence and Machine Learning

* All users must log in before leaving a comment