ProPRL: Property-Aware Prerequisite Relation Learning in Educational Knowledge Graphs

• URL: http://arxiv.org/abs/2608.03006v1
• Date: Tue, 04 Aug 2026 01:41:01 GMT
• Title: ProPRL: Property-Aware Prerequisite Relation Learning in Educational Knowledge Graphs
• Abstract summary: We propose a ProPRL--the-art on prerequisite relation learning.<n>Experiments on real-world educational datasets show that ProPRL--the-art on prerequisite learning.
• Score: 14.38185691211543
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Prerequisite relation learning is central to adaptive instruction, yet existing methods often formulate it as conventional link prediction, limiting their ability to adaptively integrate complementary educational evidence for individual candidate pairs and to discourage contradictory reverse predictions. We propose ProPRL, a Property-aware Prerequisite Relation Learning framework. ProPRL first learns complementary concept representations from a concept-resource hypergraph and a directed learning-behavior graph, where direction-preserving personalized propagation aggregates multi-hop behavioral evidence. It then employs a Pair-conditioned Gate to adaptively weight and fuse the two views for each candidate ordered concept pair. Finally, an \textit{Irreversibility Constraint} introduces an anti-symmetry regularizer that penalizes simultaneously high confidence in both directions of the same concept pair. Experiments on multiple real-world educational datasets show that ProPRL achieves state-of-the-art performance on prerequisite relation learning.

Related papers

• INSPIRE: An Internalize-Then-Improve Approach for Example-Driven Mathematical Reasoning [61.60016491769943]
  In human mathematics education, example-based reasoning such as constructing counterexamples to test theorem boundaries reflects deep conceptual understanding.<n>We propose INSPIRE, an Internalize-Then-Improve approach combining Reference-Guided Student Internalization (RGSI) with a stage-wise preference training strategy.<n>Experiments across multiple model scales and families demonstrate consistent improvements, even surpassing larger open-source models.
  arXiv  Detail & Related papers  (2026-08-27T03:24:03Z)
• Self-Prophetic Decoding to Unlock Visual Search in LVLMs [108.77389957341586]
  Large Vision-Language Models (LVLMs) are rapidly evolving toward true multimodal reasoning.<n>LVLM visual search faces two key challenges: incompatibility among intrinsic capabilities after post-training, and interference in long multi-step reasoning contexts.<n>We introduce SeProD, a self-prophetic decoding framework that leverages intrinsic single-step capabilities to enable coherent multi-step reasoning.
  arXiv  Detail & Related papers  (2026-05-27T17:01:39Z)
• Uncertainty-aware Generative Learning Path Recommendation with Cognition-Adaptive Diffusion [2.2610361667909835]
  We propose U-GLAD (Uncertainty-aware Generative Learning Path Recommendation with Cognition-Adaptive Diffusion)<n>To address representation bias, the framework models cognitive states as probability distributions, capturing the learner's underlying true state via a Gaussian LSTM.<n>Unlike traditional discriminative ranking approaches, our model employs a generative diffusion model to predict the latent representation of the next optimal concept.
  arXiv  Detail & Related papers  (2026-04-16T04:39:53Z)
• Incomplete Multi-View Multi-Label Classification via Shared Codebook and Fused-Teacher Self-Distillation [39.27376279295644]
  We introduce a more structured mechanism for consistent representation learning.<n>We learn discrete consistent representations through a multi-view shared codebook and cross-view reconstruction.<n>In addition, we introduce a fused-teacher self-distillation framework.
  arXiv  Detail & Related papers  (2026-04-05T16:22:38Z)
• Understanding Self-supervised Contrastive Learning through Supervised Objectives [2.0305676256390934]
  We formulate self-supervised representation learning as an approximation to supervised representation learning objectives.<n>Our derivation naturally introduces the concepts of prototype representation bias and a balanced contrastive loss.<n>We empirically validate the effect of balancing positive and negative pair interactions.
  arXiv  Detail & Related papers  (2025-10-12T12:43:03Z)
• Improving Language Models Meaning Understanding and Consistency by Learning Conceptual Roles from Dictionary [65.268245109828]
  Non-human-like behaviour of contemporary pre-trained language models (PLMs) is a leading cause undermining their trustworthiness. A striking phenomenon is the generation of inconsistent predictions, which produces contradictory results. We propose a practical approach that alleviates the inconsistent behaviour issue by improving PLM awareness.
  arXiv  Detail & Related papers  (2023-10-24T06:15:15Z)
• Hierarchical Decomposition of Prompt-Based Continual Learning: Rethinking Obscured Sub-optimality [55.88910947643436]
  Self-supervised pre-training is essential for handling vast quantities of unlabeled data in practice. HiDe-Prompt is an innovative approach that explicitly optimize the hierarchical components with an ensemble of task-specific prompts and statistics. Our experiments demonstrate the superior performance of HiDe-Prompt and its robustness to pre-training paradigms in continual learning.
  arXiv  Detail & Related papers  (2023-10-11T06:51:46Z)
• Generalized Unbiased Scene Graph Generation [85.22334551067617]
  Generalized Unbiased Scene Graph Generation (G-USGG) takes into account both predicate-level and concept-level imbalance. We propose the Multi-Concept Learning (MCL) framework, which ensures a balanced learning process across rare/ uncommon/ common concepts.
  arXiv  Detail & Related papers  (2023-08-09T08:51:03Z)
• ConMatch: Semi-Supervised Learning with Confidence-Guided Consistency Regularization [26.542718087103665]
  We present a novel semi-supervised learning framework that intelligently leverages the consistency regularization between the model's predictions from two strongly-augmented views of an image, weighted by a confidence of pseudo-label, dubbed ConMatch. We conduct experiments to demonstrate the effectiveness of our ConMatch over the latest methods and provide extensive ablation studies.
  arXiv  Detail & Related papers  (2022-08-18T04:37:50Z)
• R-VGAE: Relational-variational Graph Autoencoder for Unsupervised Prerequisite Chain Learning [83.13634692459486]
  We propose a model called Graph AutoEncoder (VGA-E) to predict concept relations within a graph consisting of concept resource nodes. Results show that our unsupervised approach outperforms graph-based semi-supervised methods and other baseline methods by up to 9.77% and 10.47% in terms of prerequisite relation prediction accuracy and F1 score. Our method is notably the first graph-based model that attempts to make use of deep learning representations for the task of unsupervised prerequisite learning.
  arXiv  Detail & Related papers  (2020-04-22T14:48:03Z)

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.