Efficiency in the Identification in the Limit Learning Paradigm

Rémi Eyraud (1, 2) , Jeffrey Heinz (3) , Ryo Yoshinaka (4)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille
2 QARMA - éQuipe AppRentissage et MultimediA [Marseille]
3 Dept. of Linguistics and Cognitive Science
4 Graduate School of Informatics [Kyoto]

Two different paths exist when one is interested in validating an idea for a learning algorithm. On the one hand, the practical approach consists in using the available data to test the quality of the learning algorithm (for instance the widely used cross-validation technique). On the other hand, a theoretical approach is possible by using a learning paradigm, which is an attempt to formalize what learning means. Such models provide a framework to study the behavior of learning algorithms and to formally establish their soundness. The most widely used learning paradigm in Grammatical Inference is the one known as identification in the limit. The original definition has been found lacking because no efficiency bound is required. It remains an open problem how to best incorporate a notion of efficiency and tractability in this framework. This chapter surveys the different refinements that have been developed and studied, and the challenges they face. Main results for each formalisation, along with comparisons, are provided.

Domaines: Apprentissage [cs.LG]

Rémi Eyraud, Jeffrey Heinz, Ryo Yoshinaka. Efficiency in the Identification in the Limit Learning Paradigm. Jeffrey Heinz and José M. Sempere. Topics in Grammatical Inference, , pp.25 - 46, 2016, 978-3-662-48395-4. ⟨10.1007/978-3-662-48395-4_2⟩. ⟨hal-01399418⟩