Sequential sampling techniques for algorithmic learning theory

Author: Osamu Watanabe

Source: Theoretical Computer Science Vol. 348, Issue 1, December 2005, pp. 3-14
(Special Issue Algorithmic Learning Theory (ALT 2000)).

Abstract. A sequential sampling algorithm or adaptive sampling algorithm is a sampling algorithm that obtains instances sequentially one by one and determines from these instances whether it has already seen enough number of instances for achieving a given task. In this paper, we present two typical sequential sampling algorithms. By using simple estimation problems for our example, we explain when and how to use such sampling algorithms for designing adaptive learning algorithms.

Keywords: Sequential sampling; Adaptive sampling; Adaptive learning algorithm; Chernoff bound; Hoeffding bound

©Copyright 2005 Elsevier Science B.V.