Inductive Inference with Procrastination: Back to Definitions (1999)
| Venue: | Fundamenta Informaticae |
| Citations: | 8 - 2 self |
BibTeX
@ARTICLE{Ambainis99inductiveinference,
author = {Andris Ambainis and Rusins Freivalds and Carl H. Smith},
title = {Inductive Inference with Procrastination: Back to Definitions},
journal = {Fundamenta Informaticae},
year = {1999},
volume = {40},
pages = {1--16}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we reconsider the denition of procrastinating learning machines. In the original denition of Freivalds and Smith [FS93], constructive ordinals are used to bound mindchanges. We investigate possibility of using arbitrary linearly ordered sets to bound mindchanges in similar way. It turns out that using certain ordered sets it is possible to dene inductive inference types dierent from the previously known ones. We investigate properties of the new inductive inference types and compare them to other types. This research was supported by Latvian Science Council Grant No.93.599 and NSF Grant 9421640. Some of the results from this paper were presented earlier [AFS96]. y The third author was supported in part by NSF Grant 9301339. 1 Introduction We study inductive inference using the model developed by Gold [Gol67]. There is a well known hierarchy of larger and larger classes of learnable sets of phenomena based on the number of time a learning machine is all...
