Arrow Research search
Back to TCS

TCS 2010

Incremental learning with temporary memory

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

In the inductive inference framework of learning in the limit, a variation of the bounded example memory ( Bem ) language learning model is considered. Intuitively, the new model constrains the learner’s memory not only in how much data may be stored, but also in how long those data may be stored without being refreshed. More specifically, the model requires that, if the learner commits an example x to memory, and x is not presented to the learner again thereafter, then eventually the learner forgets x, i. e. , eventually x no longer appears in the learner’s memory. This model is called temporary example memory ( Tem ) learning. Many interesting results concerning the Tem -learning model are presented. For example, there exists a class of languages that can be identified by memorizing k + 1 examples in the Tem sense, but that cannot be identified by memorizing k examples in the Bem sense. On the other hand, there exists a class of languages that can be identified by memorizing just one example in the Bem sense, but that cannot be identified by memorizing any number of examples in the Tem sense. Results are also presented concerning the special case of learning classes of infinite languages.

Authors

Keywords

  • Inductive inference
  • Formal languages
  • Incremental learning

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
683299135274447325
v2026.09.13