极限学习等价结构
Limit Learning Equivalence Structures
摘要:
虽然大多数研究在黄金风格的学习集中在学习形式语言,我们认为可计算结构的识别,特别是等价结构。在我们的核心模型中,学习者可以获得越来越多的信息,了解结构中哪些元素对是相关的,哪些是不相关的。学习器的目标是找到极限中所呈现的结构的同构类型(的有效描述)。根据语言学习,我们称这种学习标准为InfEx学习(从信息者的解释性学习)。我们的主要贡献是一个完整的表征,其中家庭的等价结构是InfEx学习。这种特性使我们能够推导出一个界的$\mathbf{0''}$的计算复杂性需要学习的等价结构的一致可重复的家庭。我们还研究了InfEx学习的变体,包括从文本中学习(提供的唯一信息是哪些元素相关,而不是哪些元素不相关)和有限学习(学习者的第一个实际猜测必须是正确的)。最后,我们展示了如何学习家庭的结构涉及到学习类的语言,通过映射学习任务的结构,以等效的学习任务的语言。
英文摘要:
While most research in Gold-style learning focuses on learning formal languages, we consider the identification of computable structures, specifically equivalence structures. In our core model the learner gets more and more information about which pairs of elements of a structure are related and which are not. The aim of the learner is to find (an effective description of) the isomorphism type of the structure presented in the limit. In accordance with language learning we call this learning criterion InfEx-learning (explanatory learning from informant). Our main contribution is a complete characterization of which families of equivalence structures are InfEx-learnable. This characterization allows us to derive a bound of $\mathbf{0''}$ on the computational complexity required to learn uniformly enumerable families of equivalence structures. We also investigate variants of InfEx-learning, including learning from text (where the only information provided is which elements are related, and not which elements are not related) and finite learning (where the first actual conjecture of the learner has to be correct). Finally, we show how learning families of structures relates to learning classes of languages by mapping learning tasks for structures to equivalent learning tasks for languages.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。