Please use this identifier to cite or link to this item:
|Title:||Robust Behaviorally Correct Learning|
|Citation:||Jain, S. (1999). Robust Behaviorally Correct Learning. Information and Computation 153 (2) : 238-248. ScholarBank@NUS Repository.|
|Abstract:||Intuitively, a class of functions is robustly learnable if not only the class itself, but also all of the transformations of the class under natural transformations (such as via general recursive operators) are learnable. Fulk showed the existence of a nontrivial class which is robustly learnable under the criterion Ex. However, several of the hierarchies (such as the anomaly hierarchies for Ex and Bc) do not stand robustly. Fulk left open the question about whether Bc and Ex can be robustly separated. In this paper we resolve this question positively. © 1999 Academic Press.|
|Source Title:||Information and Computation|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.