Mind Change Speed-up for Learning Languages from Positive Data

Authors Sanjay Jain, Efim Kinber



PDF
Thumbnail PDF

File

LIPIcs.STACS.2012.350.pdf
  • Filesize: 0.54 MB
  • 12 pages

Document Identifiers

Author Details

Sanjay Jain
Efim Kinber

Cite AsGet BibTex

Sanjay Jain and Efim Kinber. Mind Change Speed-up for Learning Languages from Positive Data. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 350-361, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/LIPIcs.STACS.2012.350

Abstract

Within the frameworks of learning in the limit of indexed classes of recursive languages from positive data and automatic learning in the limit of indexed classes of regular languages (with automatically computable sets of indices), we study the problem of minimizing the maximum number of mind changes F_M(n) by a learner M on all languages with indices not exceeding n. For inductive inference of recursive languages, we establish two conditions under which F_M(n) can be made smaller than any recursive unbounded non-decreasing function. We also establish how F_M(n) is affected if at least one of these two conditions does not hold. In the case of automatic learning, some partial results addressing speeding up the function F_M(n) are obtained.
Keywords
  • Algorithmic and automatic learning
  • mind changes
  • speedup

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail