Approximately Optimal Teaching of Approximately Optimal Learners

被引:13
|
作者
Whitehill, Jacob [1 ]
Movellan, Javier [2 ]
机构
[1] Worcester Polytech Inst, Dept Comp Sci, Worcester, MA 01609 USA
[2] Univ Calif San Diego, Inst Neural Computat, La Jolla, CA 92093 USA
来源
关键词
Intelligent tutoring systems; stochastic optimal control; partially observable Markov decision processes; DISTRIBUTED PRACTICE; VALUE-ITERATION; MODEL;
D O I
10.1109/TLT.2017.2692761
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We propose a method of generating teaching policies for use in intelligent tutoring systems (ITS) for concept learning tasks [1], e.g., teaching students the meanings of words by showing images that exemplify their meanings a la Rosetta Stone [2] and Duo Lingo [3]. The approach is grounded in control theory and capitalizes on recent work by [4], [5] that frames the leaching" problem as that of finding approximately optimal teaching policies for approximately optimal learners (AOTAOL). Our work expands on [4], [5] in several ways: (1) We develop a novel student model in which the teacher's actions can partially eliminate hypotheses about the curriculum. (2) With our student model, inference can be conducted analytically rather than numerically, thus allowing computationally efficient planning to optimize learning. (3) We develop a reinforcement learning-based hierarchical control technique that allows the teaching policy to search through deeper learning trajectories. We demonstrate our approach in a novel ITS for foreign language learning similar to Rosetta Stone and show that the automatically generated AOTAOL teaching policy performs favorably compared to two hand-crafted teaching policies.
引用
收藏
页码:152 / 164
页数:13
相关论文
共 50 条
  • [21] Computing an Approximately Optimal Agreeable Set of Items
    Manurangsi, Pasin
    Suksompong, Warut
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 338 - 344
  • [22] Approximately optimal spatial design: How good is it?
    Wang, Yu
    Le, Nhu D.
    Zidek, James V.
    SPATIAL STATISTICS, 2020, 37
  • [23] Approximately counting locally-optimal structures
    Goldberg, Leslie Ann
    Gysel, Rob
    Lapinskas, John
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2016, 82 (06) : 1144 - 1160
  • [24] OPTIMAL SEARCH FOR ROOT OF A FUNCTION COMPUTED APPROXIMATELY
    CHERNOUS.FL
    DOKLADY AKADEMII NAUK SSSR, 1967, 177 (01): : 48 - &
  • [25] Approximately optimal assignment for unequal loss protection
    Mohr, AE
    Ladner, RE
    Riskin, EA
    2000 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL I, PROCEEDINGS, 2000, : 367 - 370
  • [26] A Simple and Approximately Optimal Mechanism for an Additive Buyer
    Babaioff, Moshe
    Immorlica, Nicole
    Lucier, Brendan
    Weinberg, S. Matthew
    ACM SIGECOM EXCHANGES, 2014, 13 (02) : 31 - 35
  • [27] Simple and Approximately Optimal Pricing for Proportional Complementarities
    Cai, Yang
    Devanur, Nikhil R.
    Goldner, Kira
    Mcafee, R. Preston
    ACM EC '19: PROCEEDINGS OF THE 2019 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2019, : 239 - 240
  • [28] A Simple and Approximately Optimal Mechanism for a Buyer with Complements
    Eden, Alon
    Feldman, Michal
    Friedler, Ophir
    Talgam-Cohen, Inbal
    Weinberg, S. Matthew
    EC'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2017, : 323 - 323
  • [29] Approximately Counting Locally-Optimal Structures
    Goldberg, Leslie Ann
    Gysel, Rob
    Lapinskas, John
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2015, 9134 : 654 - 665
  • [30] Optimal, Approximately Optimal, and Fair Play of the Fowl Play Card Game
    Neller, Todd W.
    Malec, Marcin
    Presser, Clifton G. M.
    Jacobs, Forrest
    COMPUTERS AND GAMES, CG 2013, 2014, 8427 : 233 - 243