A Comprehensive Graph Framework for Question Answering with Mode-Seeking Preference Alignment

• URL: http://arxiv.org/abs/2506.17951v1
• Date: Sun, 22 Jun 2025 09:08:44 GMT
• Title: A Comprehensive Graph Framework for Question Answering with Mode-Seeking Preference Alignment
• Authors: Quanwei Tang, Sophia Yat Mei Lee, Junshuang Wu, Dong Zhang, Shoushan Li, Erik Cambria, Guodong Zhou,
• Abstract summary: We propose GraphMPA, a comprehensive graph-based framework with mode-seeking preference alignment.<n>Our approach constructs a hierarchical document graph using a general similarity measurement, mimicking human cognitive processes for information understanding and synthesis.
• Score: 45.23744113809382
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent advancements in retrieval-augmented generation (RAG) have enhanced large language models in question answering by integrating external knowledge. However, challenges persist in achieving global understanding and aligning responses with human ethical and quality preferences. To address these issues, we propose GraphMPA, a comprehensive graph-based framework with mode-seeking preference alignment. Our approach constructs a hierarchical document graph using a general similarity measurement, mimicking human cognitive processes for information understanding and synthesis. Additionally, we introduce mode-seeking preference optimization to better align model outputs with human preferences through probability-matching constraints. Extensive experiments on six datasets demonstrate the effectiveness of our \href{https://github.com/tangquanwei/GraphMPA}{GraphMPA}.

Related papers

• Contrastive General Graph Matching with Adaptive Augmentation Sampling [5.3459881796368505]
  We introduce a novel Graph-centric Contrastive framework for Graph Matching (GCGM) GCGM capitalizes on a vast pool of graph augmentations for contrastive learning, yet without needing any side information. Our GCGM surpasses state-of-the-art self-supervised methods across various datasets.
  arXiv  Detail & Related papers  (2024-06-25T01:08:03Z)
• GPT4Rec: Graph Prompt Tuning for Streaming Recommendation [30.604441550735494]
  We present GPT4Rec, a Graph Prompt Tuning method for streaming Recommendation. In particular, GPT4Rec disentangles the graph patterns into multiple views. It guides the model across varying interaction patterns within the user-item graph.
  arXiv  Detail & Related papers  (2024-06-12T13:59:31Z)
• APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendation [86.29366168836141]
  We propose a graph-driven framework, named Adaptive and Personalized Graph Learning for Sequential Recommendation (APGL4SR) APGL4SR incorporates adaptive and personalized global collaborative information into sequential recommendation systems. As a generic framework, APGL4SR can outperform other baselines with significant margins.
  arXiv  Detail & Related papers  (2023-11-06T01:33:24Z)
• LUKE-Graph: A Transformer-based Approach with Gated Relational Graph Attention for Cloze-style Reading Comprehension [13.173307471333619]
  We propose the LUKE-Graph, a model that builds a heterogeneous graph based on the intuitive relationships between entities in a document. We then use the Attention reading (RGAT) to fuse the graph's reasoning information and the contextual representation encoded by the pre-trained LUKE model. Experimental results demonstrate that the LUKE-Graph achieves state-of-the-art performance with commonsense reasoning.
  arXiv  Detail & Related papers  (2023-03-12T14:31:44Z)
• GUESR: A Global Unsupervised Data-Enhancement with Bucket-Cluster Sampling for Sequential Recommendation [58.6450834556133]
  We propose graph contrastive learning to enhance item representations with complex associations from the global view. We extend the CapsNet module with the elaborately introduced target-attention mechanism to derive users' dynamic preferences. Our proposed GUESR could not only achieve significant improvements but also could be regarded as a general enhancement strategy.
  arXiv  Detail & Related papers  (2023-03-01T05:46:36Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Optimal Propagation for Graph Neural Networks [51.08426265813481]
  We propose a bi-level optimization approach for learning the optimal graph structure. We also explore a low-rank approximation model for further reducing the time complexity.
  arXiv  Detail & Related papers  (2022-05-06T03:37:00Z)
• A Robust and Generalized Framework for Adversarial Graph Embedding [73.37228022428663]
  We propose a robust framework for adversarial graph embedding, named AGE. AGE generates the fake neighbor nodes as the enhanced negative samples from the implicit distribution. Based on this framework, we propose three models to handle three types of graph data.
  arXiv  Detail & Related papers  (2021-05-22T07:05:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.