Iterative Learning of Simple External Contextual Languages

It is investigated for which choice of a parameter q, denoting the number of contexts, the class of simple external contextual languages is iteratively learnable. On one hand, the class admits, for all values of q, polynomial time learnability provided an adequate choice of the hypothesis space is given. On the other hand, additional constraints like consistency and conservativeness or the use of a one-one hypothesis space changes the picture — iterative learning limits the long term memory of the learner to the current hypothesis and these constraints further hinder storage of information via padding of this hypothesis. It is shown that if q > 3, then simple external contextual languages are not iteratively learnable using a class preserving one-one hypothesis space, while for q = 1 it is iteratively learnable, even in polynomial time. It is also investigated for which choice of the parameters, the simple external contextual languages can be learnt by a consistent and conservativ...

• Type: Conference
• Year: 2008
• Where: ALT
• Authors: Leonor Becerra-Bonache, John Case, Sanjay Jain, Frank Stephan
• Keywords: ALT 2008, External Contextual Languages, Hypothesis Space, Machine Learning, One-one Hypothesis Space