Skip to main content

Minimizing Computing Costs of Policy Trees in a POMDP-based Intelligent Tutoring System

  • Conference paper
  • First Online:
  • 783 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 739))

Abstract

Uncertainties exist in intelligent tutoring. The partially observable Markov decision process (POMDP) model may provide useful tools for handling uncertainties. The model may enable an intelligent tutoring system (ITS) to choose optimal actions when uncertainties occur. A major difficulty in applying the POMDP model to intelligent tutoring is its computational complexity. Typically, when a technique of policy trees is used, in making a decision the number of policy trees to evaluate is exponential, and the cost of evaluating a tree is also exponential. To overcome the difficulty, we develop a new technique of policy trees, based on the features of tutoring processes. The technique can minimize the number of policy trees to evaluate in making a decision, and minimize the costs of evaluating individual trees.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Anderson, J.R., Corbett, A.T., Koedinger, K.R., Peeelletier, R.: Cognitive tutors: lessons learned. J. Learn. Sci. 4(2), 167–207 (1995)

    Article  Google Scholar 

  2. Braziunas, D.: POMDP solution methods: a survey. Technical report, Department of Computer Science, University of Toronto (2003)

    Google Scholar 

  3. Carlin, A., Zilberstein, S.: Observation compression in DEC-POMDP policy trees. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multi-agent Systems, pp. 31–45(2008)

    Google Scholar 

  4. Cassandra, A. A survey of POMDP applications. In: Working Notes of AAAI 1998 Fall Symposium on Planning with Partially Observable Markov Decision Process, pp. 17–24(1998)

    Google Scholar 

  5. Cheung, B., Hui, L., Zhang, J., Yiu, S.M.: SmartTutor: an intelligent tutoring system in web-based adult education. J. Syst. Softw. 68, 11–25 (2003). Elsevier

    Article  Google Scholar 

  6. Chinaei, H.R., Chaib-draa, B., Lamontagne, L.: Learning observation models for dialogue POMDPs. In: Kosseim, L., Inkpen, D. (eds.) AI 2012. LNCS, vol. 7310, pp. 280–286. Springer, Heidelberg (2012). doi:10.1007/978-3-642-30353-1_24

    Chapter  Google Scholar 

  7. Folsom-Kovarik, J.T., Sukthankar, G., Schatz, S.: Tractable POMDP representations for intelligent tutoring systems. ACM Trans. Intell. Syst. Technol. (TIST) - Special Section on Agent Communication, Trust in Multiagent Systems, Intelligent Tutoring and Coaching Systems Archive 4(2), 29 (2013)

    Google Scholar 

  8. Jeremic, Z., Jovanovic, J., Gasevic, D.: Evaluating an intelligent tutoring systemfor design patterns: the DEPTHS experience. Educ. Technol. Soc. 12(2), 111–130 (2009)

    Google Scholar 

  9. Littman, M.L.: A tutorial on partially observable Markov decision processes. J. Math. Psychol. 53, 119–125 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. McLaren, B.M., DeLeeuw, K.E., Mayer, R.E.: Polite web-based intelligent tutors: can they improve learning in classrooms? Comput. Educ. 56(3), 574–584 (2011)

    Article  Google Scholar 

  11. McLaren, B.M., van Gog, T., Ganoe, C., Karabinos, M., Yaron, D.: The efficiency of worked examples compared to erroneous examples, tutored problem solving, and problem solving in classroom experiments. Comput. Hum. Behav. 55, 87–99 (2016)

    Article  Google Scholar 

  12. Rafferty, A.N., Brunskill, E., Griffiths, T.L., Shafto, P.: Faster teaching by POMDP planning. In: Biswas, G., Bull, S., Kay, J., Mitrovic, A. (eds.) AIED 2011. LNCS (LNAI), vol. 6738, pp. 280–287. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21869-9_37

    Chapter  Google Scholar 

  13. Theocharous, G., Beckwith, R., Butko, N., Philipose, M.: Tractable POMDP planning algorithms for optimal teaching in SPAIS. In: IJCAI PAIR Workshop (2009)

    Google Scholar 

  14. VanLehn, K.: Intelligent turoring systems for continuous, embedded assessment. In: Dwyer, C. (ed.) The Future of Assessment: Shaping Teaching and Learning, pp. 113–138. Erlbaum, Mahwah (2008)

    Google Scholar 

  15. VanLehn, K., van de Sande, B., Shelby, R., Gershman, S.: The Andes physics tutoring system: an experiment in Freedom. In: Nkambou, R., Bourdeau, J., Mizoguchi, R. (eds.) Advances in Intelligent Tutoring Systems. SCI, vol. 308, pp. 421–443. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14363-2_21

    Chapter  Google Scholar 

  16. Wang, F.: Handling exponential state space in a POMDP-based intelligent tutoring system. In: Proceedings of 6th International Conference on E-Service and Knowledge Management (IIAI ESKM 2015), pp. 67–72 (2015)

    Google Scholar 

  17. Williams, J.D., Poupart, P., Young, S.: Factored partially observable Markov decision processes for dialogue management. In: Proceedings of Knowledge and Reasoning in Practical Dialogue Systems (2005)

    Google Scholar 

  18. Williams, J.D., Young, S.: Partially observable Markov decision processes for spoken dialog systems. Comput. Speech Lang. 21, 393–422 (2007). Elsevier

    Article  Google Scholar 

  19. Woolf, B.P.: Building Intelligent Interactive Tutors. Morgan Kaufmann Publishers, Burlington (2009)

    Google Scholar 

Download references

Acknowledgements.

This research is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fangju Wang .

Editor information

Editors and Affiliations

Appendix I: Sample Concepts and Descriptions

Appendix I: Sample Concepts and Descriptions

  • A binary digit is 0 or 1.

  • A bit is the smallest unit of information on a computer. It can hold one of the two values of binary digits.

  • A byte consists of eight consecutive bits.

  • Data represents information, stored on a computer as sequences of bytes.

  • A word is a fixed-sized piece of data handled as a unit by the instruction set or the hardware of the processor.

  • A file is a collection of data. It has a name.

  • An instruction is a coded command to the computer to perform a specified function.

  • A programming language is an artificial language designed to communicate instructions to a computer.

  • A machine language is a programming language, in which each instruction is represented as binary digits.

  • An assembly language has the same structure and set of instructions as a machine language, with the instructions represented by names.

  • A high-level language is a programming language independent of any particular type of computer, and is closer to human languages than assembly languages.

  • A query language is a high-level language for querying.

  • A program is a sequence of instructions written in a programming language, for performing a specified task with a computer.

  • An application program is a program developed for performing a specific task directly for the user.

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Wang, F. (2017). Minimizing Computing Costs of Policy Trees in a POMDP-based Intelligent Tutoring System. In: Costagliola, G., Uhomoibhi, J., Zvacek, S., McLaren, B. (eds) Computers Supported Education. CSEDU 2016. Communications in Computer and Information Science, vol 739. Springer, Cham. https://doi.org/10.1007/978-3-319-63184-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-63184-4_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-63183-7

  • Online ISBN: 978-3-319-63184-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics