AAAI 2026

January 23, 2026

Singapore, Singapore

Would you like to see your presentation here, made available to a global audience of researchers?
Add your own presentation or have us affordably record your next conference.

Question generation is the task of natural language processing where the goal is to generate fluent, grammatically correct, error-free questions based on a given input context and optionally an answer. Multi-hop question generation is a more complex task compared to traditional single-hop question generation, as it requires reasoning over multiple information from multiple input contexts in generating multi-hop questions. In this paper, we have addressed the challenge of building a multi-hop question generation system by combining the knowledge graphs with large language models. We have designed a framework KG4QG (Knowledge Graph for Question Generation), where knowledge graphs are generated from the input contexts. For the knowledge graph embedding, we have used Graph Attention Network, and for input text embedding, we have leveraged Sentence Transformer. Finally, we apply BART and T5 models as Large Language Models to generate multi-hop questions from our proposed model. Using HotpotQA dataset to evaluate the performance of our KG4QG framework, our proposed methodology has shown an enhancement of performance over the previous methodologies.

Downloads

SlidesPaperTranscript English (automatic)

Next from AAAI 2026

AEFGL: Reverse Auction and Value Evaluation-Based Federated Graph Learning Incentive Mechanism (Student Abstract)
poster

AEFGL: Reverse Auction and Value Evaluation-Based Federated Graph Learning Incentive Mechanism (Student Abstract)

AAAI 2026

+2
Xin Chang and 4 other authors

23 January 2026

Stay up to date with the latest Underline news!

Select topic of interest (you can select more than one)

PRESENTATIONS

  • All Presentations
  • For Librarians
  • Resource Center
  • Free Trial
Underline Science, Inc.
1216 Broadway, 2nd Floor, New York, NY 10001, USA

© 2025 Underline - All rights reserved