TY - GEN
T1 - Closedness properties in ex-identification of recursive functions
AU - Apsitis, Kalvis
AU - Freivalds, Rusiņš
AU - Simanovskis, Raimonds
AU - Smotrovs, Juris
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.
PY - 1998
Y1 - 1998
N2 - In this paper we investigate in which cases unions of identifiable classes of recursive functions are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them we find such n that 1) if every union of n — 1 classes out of U1,…,Un is identifiable, so is the union of all n classes; 2) there are such classes U1,…,Un-1 that every union of n — 2 classes out of them is identifiable, while the union of n — 1 classes is not. We show that by finding these n we can distinguish which requirements put on the identifiability of unions of classes are satisfiable and which are not. We also show how our problem is connected with team learning.
AB - In this paper we investigate in which cases unions of identifiable classes of recursive functions are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them we find such n that 1) if every union of n — 1 classes out of U1,…,Un is identifiable, so is the union of all n classes; 2) there are such classes U1,…,Un-1 that every union of n — 2 classes out of them is identifiable, while the union of n — 1 classes is not. We show that by finding these n we can distinguish which requirements put on the identifiability of unions of classes are satisfiable and which are not. We also show how our problem is connected with team learning.
UR - https://www.scopus.com/pages/publications/84961378826
U2 - 10.1007/3-540-49730-7_4
DO - 10.1007/3-540-49730-7_4
M3 - Conference paper
AN - SCOPUS:84961378826
SN - 354065013X
SN - 9783540650133
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 46
EP - 60
BT - Algorithmic Learning Theory - 9th International Conference, ALT 1998, Proceedings
A2 - Richter, Michael M.
A2 - Smith, Carl H.
A2 - Wiehagen, Rolf
A2 - Zeugmann, Thomas
PB - Springer Verlag
T2 - 9th International Conference on Algorithmic Learning Theory, ALT 1998
Y2 - 8 October 1998 through 10 October 1998
ER -