Classifying different criteria for learning algebraic structures Научная публикация
Журнал |
Annals of Pure and Applied Logic
ISSN: 0168-0072 |
||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Вых. Данные | Год: 2026, Том: 177, Номер: 1, Страницы: 103648 Страниц : 25 DOI: 10.1016/j.apal.2025.103648 | ||||||||||||
Ключевые слова | Inductive inference, Algorithmic learning theory, Infinitary logic, Continuous reducibility | ||||||||||||
Авторы |
|
||||||||||||
Организации |
|
Информация о финансировании (1)
1 | Российский научный фонд | 24-11-00227 |
Реферат:
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 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-settheoretic 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 Ex-learning in [8]. Such characterizations give a powerful method to understand whether a family of structures is learnable with respect to the desired criterion.
Библиографическая ссылка:
Bazhenov N.
, Cipriani V.
, Jain S.
, San Mauro L.
, Stephan F.
Classifying different criteria for learning algebraic structures
Annals of Pure and Applied Logic. 2026. V.177. N1. P.103648. DOI: 10.1016/j.apal.2025.103648 WOS Scopus OpenAlex
Classifying different criteria for learning algebraic structures
Annals of Pure and Applied Logic. 2026. V.177. N1. P.103648. DOI: 10.1016/j.apal.2025.103648 WOS Scopus OpenAlex
Даты:
Поступила в редакцию: | 18 сент. 2024 г. |
Принята к публикации: | 18 авг. 2025 г. |
Опубликована online: | 22 авг. 2025 г. |
Опубликована в печати: | 27 авг. 2025 г. |
Идентификаторы БД:
Web of science: | WOS:001562374100001 |
Scopus: | 2-s2.0-105014651632 |
OpenAlex: | W4413427393 |
Цитирование в БД:
Пока нет цитирований