Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/122360
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.contributorDepartment of Data Science and Artificial Intelligence-
dc.creatorDong, JW-
dc.creatorLin, ZH-
dc.creatorLin, WY-
dc.creatorZhang, MJ-
dc.date.accessioned2026-11-10T03:24:47Z-
dc.date.available2026-11-10T03:24:47Z-
dc.identifier.urihttp://hdl.handle.net/10397/122360-
dc.descriptionAAAI Conference on Artificial Intelligence [AAAI-26]en_US
dc.language.isoenen_US
dc.publisherAAAI Pressen_US
dc.rightsCopyright © 2026, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.en_US
dc.rightsThe following publication Dong, J., Lin, Z., Lin, W., & Zhang, M. (2026). S-DAG: A Subject-Based Directed Acyclic Graph for Multi-Agent Heterogeneous Reasoning. Proceedings of the AAAI Conference on Artificial Intelligence, 40(35), 29394–29402 is available at https://dx.doi.org/10.1609/aaai.v40i35.40180.en_US
dc.titleS-DAG : a subject-based directed acyclic graph for multi-agent heterogeneous reasoningen_US
dc.typeConference Paperen_US
dc.identifier.spage29394-
dc.identifier.epage29402-
dc.identifier.volume40-
dc.identifier.issue35-
dc.identifier.doi10.1609/aaai.v40i35.40180-
dcterms.abstractLarge Language Models (LLMs) have achieved impressive performance in complex reasoning problems. Their effectiveness highly depends on the specific nature of the task, especially the required domain knowledge. Existing approaches, such as mixture-of-experts, typically operate at the task level; they are too coarse to effectively solve the heterogeneous problems involving multiple subjects. This work proposes a novel framework that performs fine-grained analysis at the subject level equipped with a designated multi-agent collaboration strategy for addressing heterogeneous problem reasoning. Specifically, given an input query, we first employ a Graph Neural Network to identify the relevant subjects and infer their interdependencies to generate an Subject-based Directed Acyclic Graph (S-DAG), where nodes represent subjects and edges encode information flow. Then, we profile the LLM models by assigning each model a subject-specific expertise score, and select the top-performing one for matching the corresponding subject of the S-DAG. Such subjectmodel matching enables graph-structured multi-agent collaboration where information flows from the starting model to the ending model over S-DAG. We curate and release multisubject subsets of standard benchmarks (MMLU-Pro, GPQA, MedMCQA) to better reflect complex, real-world reasoning tasks. Extensive experiments show that our approach significantly outperforms existing task-level model selection and multi-agent collaboration baselines in accuracy and efficiency. These results highlight the effectiveness of subjectaware reasoning and structured collaboration in addressing complex and multi-subject problems.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationProceedings of the AAAI Conference on Artificial Intelligence, 2026, v. 40, no. 35, p. 29394-29402-
dcterms.issued2026-
dc.identifier.isiWOS:001769422900012-
dc.relation.conferenceThe 40th Annual AAAI Conference on Artificial Intelligence, January 20 – January 27, 2026, Singapore-
dc.description.validate202610 bcrc-
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_Scopus/WOSen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextInnovation and Technology Fund -Guangdong-Hong Kong Technology Cooperation Funding Scheme (ITF-TCFS); Innovation and Technology Commissionen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryCCen_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
21436-AAAI26.DongJ-MS.pdf312.78 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.