Skip to Main content Skip to Navigation
Conference papers

Optimization of a Tutoring System from a Fixed Set of Data

Abstract : In this paper, we present a general method for optimizing a tutoring system with a target application in the domain of second language acquisition. More specifically, the optimisation process aims at learning the best sequencing strategy for switching between teaching and evaluation sessions so as to maximise the increase of knowledge of the learner in an adapted manner. The most important feature of the proposed method is that it is able to learn an optimal strategy from a fixed set of data, collected with a hand-crafted strategy. This way, no model (neither cognitive nor probabilistic) of learners is required but only observations of their behavior when interacting with a simple (non-optimal) system. To do so, a particular batch-mode approximate dynamic programming algorithm is used, namely the Least Square Policy Iteration algorithm. Experiments on simulated data provide promising results.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Sébastien van Luchene Connect in order to contact the contributor
Submitted on : Thursday, December 15, 2011 - 12:00:19 PM
Last modification on : Tuesday, December 15, 2020 - 3:32:36 AM
Long-term archiving on: : Monday, December 5, 2016 - 10:55:01 AM


Files produced by the author(s)


  • HAL Id : hal-00652324, version 1



Olivier Pietquin, Lucie Daubigney, Matthieu Geist. Optimization of a Tutoring System from a Fixed Set of Data. SLaTE 2011, Aug 2011, Venice, Italy. pp.1-4. ⟨hal-00652324⟩



Les métriques sont temporairement indisponibles