title: Fingerprint resampling: A generic method for efficient resampling.
abstract: In resampling methods, such as bootstrapping or cross validation, a very similar computational problem (usually an optimization procedure) is solved over and over again for a set of very similar data sets. If it is computationally burdensome to solve this computational problem once, the whole resampling method can become unfeasible. However, because the computational problems and data sets are so similar, the speed of the resampling method may be increased by taking advantage of these similarities in method and data. As a generic solution, we propose to learn the relation between the resampled data sets and their corresponding optima. Using this learned knowledge, we are then able to predict the optima associated with new resampled data sets. First, these predicted optima are used as starting values for the optimization process. Once the predictions become accurate enough, the optimization process may even be omitted completely, thereby greatly decreasing the computational burden. The suggested method is validated using two simple problems (where the results can be verified analytically) and two real-life problems (i.e., the bootstrap of a mixed model and a generalized extreme value distribution). The proposed method led on average to a tenfold increase in speed of the resampling method.
authors.affiliation: University of Leuven, Oude Markt 13, 3000 Leuven, Belgium.
authors.forename: Merijn
authors.initials: M
authors.lastname: Mestdagh
authors.affiliation: University of Leuven, Oude Markt 13, 3000 Leuven, Belgium.
authors.forename: Stijn
authors.initials: S
authors.lastname: Verdonck
authors.affiliation: University of Leuven, Oude Markt 13, 3000 Leuven, Belgium.|Leiden University, Rapenburg 70, 2311 EZ Leiden, Netherlands.
authors.forename: Kevin
authors.initials: K
authors.lastname: Duisters
authors.affiliation: University of Leuven, Oude Markt 13, 3000 Leuven, Belgium.
authors.forename: Francis
authors.initials: F
authors.lastname: Tuerlinckx