Challenge: Existing methods for concept expansion in MOOCs are inefficient because of the diversity of MOOC courses and rapid updates.
Approach: They propose an end-to-end hierarchical reinforcement learning (HRL) model for concept expansion in MOOCs that employs a two-level mechanism of seed selection and concept expansion.
Outcome: The proposed model improves on nine real MOOC datasets and maintains competitive performance under different settings.

Similar Papers

Course Concept Expansion in MOOCs with External Knowledge and Interactive Game (P19-1)

Copied to clipboard

Challenge: Existing methods to expand course concepts in MOOCs suffer from semantic drifts and lack of knowledge guidance.
Approach: They propose to use a boundary search method to search for new concepts via external knowledge base and then use heterogeneous features to verify the results.
Outcome: The proposed method improves on the datasets from Coursera and XuetangX.
Distantly Supervised Course Concept Extraction in MOOCs with Academic Discipline (2023.acl-long)

Copied to clipboard

Challenge: Existing methods to extract knowledge concepts from MOOCs are noisy and incomplete because of the limited dictionary and diverse MOOC.
Approach: They propose to automatically extract course concepts using distant supervision to eliminate the heavy work of human annotations.
Outcome: The proposed framework outperforms state-of-the-art methods with 7% absolute improvement in F1 score.
MOOCCube: A Large-scale Data Repository for NLP Applications in MOOCs (2020.acl-main)

Copied to clipboard

Challenge: Massive open online courses (MOOCs) are a popular educational platform for advanced research.
Approach: They propose to use MOOCCube to build a large-scale data repository of over 700 MOOC courses, 100k concepts, 8 million student behaviors with an external resource.
Outcome: The proposed datasets show that they can facilitate research in MOOCs.
End-to-End Reinforcement Learning for Automatic Taxonomy Induction (P18-1)

Copied to clipboard

Challenge: Existing methods for automating taxonomy induction often divide the problem into two subtasks . a novel end-to-end reinforcement learning approach is proposed to improve the accuracy of such methods.
Approach: They propose an end-to-end reinforcement learning approach to automatic taxonomy induction from a set of terms.
Outcome: The proposed approach outperforms state-of-the-art methods on two public datasets of different domains.
Hierarchical Reinforcement Learning with Augmented Step-Level Transitions for LLM Agents (2026.acl-long)

Copied to clipboard

Challenge: Existing Large language model agents rely on increasingly long interaction histories, resulting in high computational cost and limited scalability.
Approach: They propose a hierarchical reinforcement learning framework that enables step-level learning by conditioning only on single-step transitions rather than full interaction histories.
Outcome: The proposed framework outperforms baselines on ScienceWorld and ALFWorld benchmarks in terms of performance and generalization while reducing token usage.
KEHRL: Learning Knowledge-Enhanced Language Representations with Hierarchical Reinforcement Learning (2024.lrec-main)

Copied to clipboard

Challenge: General pre-trained language models (PLMs) leverage relation triples from knowledge graphs (KGs) and integrate external data sources into language models via self-supervised learning.
Approach: They propose to learn Knowledge-Enhanced language representations with Hierarchical Reinforcement Learning (KEHRL) to detect positions for knowledge injection and integrate external knowledge into the model to avoid injecting inaccurate or irrelevant knowledge.
Outcome: The proposed model can detect essential positions in texts for knowledge injection and integrate external knowledge into the model to avoid injecting inaccurate or irrelevant knowledge.
Exploring Dynamic Selection of Branch Expansion Orders for Code Generation (2021.acl-long)

Copied to clipboard

Challenge: Existing code generation models model abstract syntax tree (AST) but not suitable for all multi-branch nodes.
Approach: They propose to equip a Seq2Tree model with a branch selector to determine optimal expansion orders for multi-branch nodes.
Outcome: The proposed model can determine optimal expansion orders of branches for multi-branch nodes.
TemplateRL: Structured Template-Guided Reinforcement Learning for LLM Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing RL methods rely on unstructured self-sampling to fit scalar rewards, resulting in inefficient rollouts.
Approach: They propose a structured template-guided RL framework that augments policy optimization with explicit template guidance.
Outcome: Experiments show that TemplateRL outperforms GRPO and GRPI by 99% on AIME and 41% on AMC with superior stability on weak models and remarkable cross-domain generalization.
PEGRL: Improving Machine Translation by Post-Editing Guided Reinforcement Learning (2026.findings-acl)

Copied to clipboard

Challenge: Reinforcement learning (RL) has shown strong promise for LLM-based machine translation . however, translation-oriented RL remains challenged by high-variance policy gradients induced by Monte Carlo baselines and large trajectory space that favors global exploration over fine-grained local optimization.
Approach: They propose a two-stage RL framework that uses post-editing as an auxiliary task to stabilize training and guide overall optimization.
Outcome: The proposed framework supports global exploration and fine-grained optimization while supporting global exploration.
KnowRL: Exploring Knowledgeable Reinforcement Learning for Factuality (2026.acl-long)

Copied to clipboard

Challenge: Existing Reinforcement Learning approaches rely on outcome-oriented rewards to reinforce fabricated reasoning paths when the final answer is correct.
Approach: They propose a framework that integrates factual supervision directly into reasoning . they propose to decompose chain of thought into atomic facts and verify them against ground-truth knowledge .
Outcome: The proposed framework reduces the Incorrect Rate on SimpleQA by 20.3% while maintaining strong performance on complex reasoning benchmarks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations