arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2410.22933math.LO
收藏

对学习代数结构的不同准则进行分类

Classifying different criteria for learning algebraic structures

Nikolay Bazhenov, Vittorio Cipriani, Sanjay Jain, Luca San Mauro, Frank Stephan

AI总结:

针对代数结构学习中经典算法学习理论范式未被探索的问题,提出$E$-可学习性概念,用描述集合论工具比较不同学习准则的能力,给出其无穷公式句法刻画,为判断结构族可学习性提供方法。

摘要:

近年来,人们对与代数结构相关的学习问题研究兴趣日益浓厚。我们使用的框架对如下场景建模:向学习者提供来自某一目标族的结构的越来越大的片段,要求学习者输出关于该结构同构类型的假设。截至目前,研究人员主要关注$\textbf{Ex}$-学习(解释性学习)——即要求学习者最终稳定在正确假设上,以及允许学习者固定次数内更改假设的限制型学习。然而,来自经典算法学习理论的其他学习范式仍未被探索。我们研究了这类准则的“学习能力”,借助$E$-可学习性这一新概念,通过描述集合论工具对它们进行比较。本文的主要成果是,这类准则可以用无穷公式给出自然的句法刻画,类似于文献[6]中针对$\textbf{Ex}$-学习给出的刻画。这类刻画为理解一个结构族是否可按期望准则学习提供了有力方法。

英文摘要:

In the last years there has been a growing interest in the study of learning problems associated with algebraic structures. The framework we use models the scenario in which a learner is given larger and larger fragments of a structure from a given target family and is required to output an hypothesis about the structure's isomorphism type. So far researchers focused on $\mathbf{Ex}$-learning, in which the learner is asked to eventually stabilize to the correct hypothesis, and on restrictions where the learner is allowed to change the hypothesis a fixed number of times. Yet, other learning paradigms coming from classical algorithmic learning theory remained unexplored. We study the "learning power" of such criteria, comparing them via descriptive-set-theoretic tools thanks to the novel notion of $E$-learnability. The main outcome of this paper is that such criteria admit natural syntactic characterizations in terms of infinitary formulas analogous to the one given for $\mathbf{Ex}$-learning in [6]. Such characterizations give a powerful method to understand whether a family of structure is learnable with respect to the desired criterion.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑