Table of Contents
Fetching ...

GraphMASAL: A Graph-based Multi-Agent System for Adaptive Learning

Biqing Zeng, Mengquan Liu, Zongwei Zhen

TL;DR

GraphMASAL addresses the challenge of truly personalized learning by grounding planning and tutoring in a dynamic knowledge graph and coordinating a three-agent workflow (Diagnoser, Planner, Tutor) via LangGraph. It introduces a KG-grounded semantic retrieval stack and a Multi-Source Multi-Sink (MSMS) path optimization engine with a cognitively grounded cost and a (1+\ln|W|) approximation guarantee, evaluated with a PathSim-based scientific paradigm. Automated and human validations show superior cognitive diagnosis accuracy and learning-path structure, with high correlations to expert judgments, illustrating both computational effectiveness and pedagogical plausibility. The approach offers a principled path toward reliable, interpretable, and scalable personalized education, with future work on multimodal resources, affective signals, and longitudinal deployments.

Abstract

The advent of Intelligent Tutoring Systems (ITSs) has marked a paradigm shift in education, enabling highly personalized learning pathways. However, true personalization requires adapting to learners' complex knowledge states (multi-source) and diverse goals (multi-sink); existing ITSs often lack the necessary structural-reasoning capability and knowledge dynamism to generate genuinely effective learning paths, and they lack scientifically rigorous validation paradigms. In this paper we propose GraphMASAL (A Graph-based Multi-Agent System for Adaptive Learning), which integrates (i) a dynamic knowledge graph for persistent, stateful learner modeling; (ii) a LangGraph-orchestrated trio of agents (Diagnostician, Planner, Tutor); (iii) a knowledge-graph-grounded two-stage neural IR component (dual-encoder dense retrieval with cross-encoder listwise re-ranking and calibrated score fusion); and (iv) a multi-source multi-sink (MSMS) planning engine with a cognitively grounded cost and an approximation guarantee via greedy set cover. Under blinded automated evaluations with matched inputs and inference settings across diverse student profiles, GraphMASAL consistently outperforms LLM prompting and structured ablations in planning--achieving stronger structural/sequence alignment of learning paths, higher coverage of weak concepts, and lower learning cost--while also surpassing prompt-based baselines in cognitive diagnosis. Agreement with expert/LLM-proxy ratings further supports the validity of our evaluation protocol. These findings indicate that grounding LLM agents in a dynamic knowledge graph, coupled with optimization under educational constraints, yields reliable, interpretable, and pedagogically plausible learning plans, advancing personalized and goal-oriented education.

GraphMASAL: A Graph-based Multi-Agent System for Adaptive Learning

TL;DR

GraphMASAL addresses the challenge of truly personalized learning by grounding planning and tutoring in a dynamic knowledge graph and coordinating a three-agent workflow (Diagnoser, Planner, Tutor) via LangGraph. It introduces a KG-grounded semantic retrieval stack and a Multi-Source Multi-Sink (MSMS) path optimization engine with a cognitively grounded cost and a (1+\ln|W|) approximation guarantee, evaluated with a PathSim-based scientific paradigm. Automated and human validations show superior cognitive diagnosis accuracy and learning-path structure, with high correlations to expert judgments, illustrating both computational effectiveness and pedagogical plausibility. The approach offers a principled path toward reliable, interpretable, and scalable personalized education, with future work on multimodal resources, affective signals, and longitudinal deployments.

Abstract

The advent of Intelligent Tutoring Systems (ITSs) has marked a paradigm shift in education, enabling highly personalized learning pathways. However, true personalization requires adapting to learners' complex knowledge states (multi-source) and diverse goals (multi-sink); existing ITSs often lack the necessary structural-reasoning capability and knowledge dynamism to generate genuinely effective learning paths, and they lack scientifically rigorous validation paradigms. In this paper we propose GraphMASAL (A Graph-based Multi-Agent System for Adaptive Learning), which integrates (i) a dynamic knowledge graph for persistent, stateful learner modeling; (ii) a LangGraph-orchestrated trio of agents (Diagnostician, Planner, Tutor); (iii) a knowledge-graph-grounded two-stage neural IR component (dual-encoder dense retrieval with cross-encoder listwise re-ranking and calibrated score fusion); and (iv) a multi-source multi-sink (MSMS) planning engine with a cognitively grounded cost and an approximation guarantee via greedy set cover. Under blinded automated evaluations with matched inputs and inference settings across diverse student profiles, GraphMASAL consistently outperforms LLM prompting and structured ablations in planning--achieving stronger structural/sequence alignment of learning paths, higher coverage of weak concepts, and lower learning cost--while also surpassing prompt-based baselines in cognitive diagnosis. Agreement with expert/LLM-proxy ratings further supports the validity of our evaluation protocol. These findings indicate that grounding LLM agents in a dynamic knowledge graph, coupled with optimization under educational constraints, yields reliable, interpretable, and pedagogically plausible learning plans, advancing personalized and goal-oriented education.

Paper Structure

This paper contains 23 sections, 2 equations, 3 figures, 3 tables, 3 algorithms.

Figures (3)

  • Figure 1: System architecture of GraphMASAL showing three phases with modular agent components and data flows.
  • Figure 2: Dynamic Knowledge Graph Structure Physics Concept Network with Prerequisite Dependencies
  • Figure 3: MSMS Algorithm for Multi-Source Multi-Sink Path Optimization via Greedy Set-Cover: Minimizing the Total Number of Emerging Concepts