|
|
Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2021, Number 6, Pages 14–20
(Mi vmumm4434)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Mathematics
Learning of bounded-weight Boolean functions
A. V. Bistrigova Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
The complexity of exact learning of bounded-weight Boolean functions is considered in the paper using separately four types of queries: membership queries, equivalence queries, extended equivalence queries, and comparation queries. The values of the complexity for the first three types are obtained. Upper and lower bounds of the complexity for comparation queries being of the same order are presented. Moreover, the exact value of the complexity of learning upper bounded-weight Boolean functions with the help of comparation queries is obtained.
Key words:
bounded-weight functions, membership queries, comparation queries, equivalence queries, extended equivalence queries, exact learning.
Received: 23.11.2020
Citation:
A. V. Bistrigova, “Learning of bounded-weight Boolean functions”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 6, 14–20; Moscow University Mathematics Bulletin, 76:6 (2021), 251–258
Linking options:
https://www.mathnet.ru/eng/vmumm4434 https://www.mathnet.ru/eng/vmumm/y2021/i6/p14
|
|