A deployed tutoring system that enforces answer-withholding as a per-turn, machine-checkable contract, and a method for tuning that withholding against evidence is reported, offering the measure, diagnose, and fix loop as a reusable recipe for any LLM agent that must refuse a capability it has.
Abstract
An effective large language model (LLM) tutor must often decline to give an answer it could easily produce. In a randomized study, students who used an unguarded chatbot scored higher while practicing but lower on a later test taken without it, whereas a Socratically guarded version of the same model kept the practice gain and removed the later loss [4]. Reliable answer-withholding is therefore central to a tutor's value, yet a capable model pressed by a frustrated student does not withhold reliably on a prompt alone. We report a deployed tutoring system that enforces answer-withholding as a per-turn, machine-checkable contract, and a method for tuning that withholding against evidence. A non-LLM policy core, reading only trusted learner state, sets a per-turn ceiling on an eight-rung help ladder; a deterministic detector strips solution code; and a separate LLM judge checks each risky reply against the contract. We tune the behavior with an automated evaluation that uses no human subjects: scripted student personas are driven through the live pipeline and re-scored by a stronger model, and we record each rejection's stated reason so failures are fixed by cause. Doing so revealed an interpretable"over-help ladder,"from blatant solution leaks, to naming the exact bug, to over-citing general facts, with each fix exposing the next. The tutor reached full compliance on all four acceptance criteria. We offer the measure, diagnose, and fix loop as a reusable recipe for any LLM agent that must refuse a capability it has.
Programming tutors should support learners'own explanations rather than immediately providing model answers. We present ExplainRoute, a pre-deployment audit framework for non-answer-giving programming tutors. Given a code line and a learner explanation, it estimates the explanation state and selects one of two bounded...
Y. Gai, Ying-Ying Zhang, Xue-Fei Huang· 0 citations
A proof-of-concept neuro-symbolic architecture for “certified” academic advising that shows how an LLM-based university assistant can be connected to an auditable and reproducible symbolic layer, while preserving a clear separation between linguistic interaction and formal regulatory reasoning.
Giovanni Pilato, Mustafa Sert· International Journal of Sem...· 0 citations
EduClaw-Bench is introduced, a benchmark that places an agent tutor in a continuous 30-day relationship with a simulated learner grounded in knowledge tracing (KT), whose knowledge-concept mastery, from a KT model trained on real-student data, drives its answers and is probed for learning gain across 55 scenarios.
Unggi Lee, Sookbun Lee, Yeil Jeong et al.· 0 citations
The design pairs cognitive adaptivity, realised as mastery-based task selection under configurable parameters, with motivational design grounded in Keller’s ARCS model, and a formalised adaptation logic linking learner states, adaptive responses, and conjectures.
Lajos Toldi, Tünde Lengyel Molnár· Computers· 0 citations
EvalAI grades theory answers on meaning rather than wording, using Sentence-BERT to measure how semantically similar a student's response is to a lecturer-provided reference answer, showing that semantic grading of this quality can be delivered within a deployable web application without specialised machine learning in...
E. Mgbeahuruike, Chris-Esezobor Ejodamen, Nelson-Nwanoneze Samuel et al.· British journal of computer,...· 0 citations
Effective LLM tutoring depends on correctly identifying the specific error in a student's reasoning before generating feedback. We study this problem in propositional-logic proof tutoring, where student actions can be checked against formal inference rules. We introduce a verifier-grounded architecture that separates d...
Tahreem Yasir, A. Mody, Xioayi Tian et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.