Abstract Recently, a novel bootstrap method for numerical calculations in matrix models and quantum mechanical systems was proposed. We apply the to certain derived from some well-known local toric Calabi–Yau geometries, where exact quantization conditions have been conjecturally related topological string theory. find that provides promising alternative precision of energy eigenvalues. An impr...

Bootstrapping a classifier from a small set of seed rules can be viewed as the propagation of labels between examples via features shared between them. This paper introduces a novel variant of the Yarowsky algorithm based on this view. It is a bootstrapping learning method which uses a graph propagation algorithm with a well defined objective function. The experimental results show that our pro...

Fully Homomorphic Encryption (FHE) enables us to compute arbitrary circuits over encrypted data without decryption. To evaluate a complex circuit, a time-consuming operation called bootstrapping is required. Reducing the number of bootstrapping operations leads directly to reducing the entire computation time of the circuit. An optimization problem which minimizes the number of bootstrapping op...

This survey considers the optimization of simulated systems. The simulation may be either deterministic or random. The survey reflects the author’s extensive experience with simulationoptimization through Kriging (or Gaussian process) metamodels using a frequentist (non-Bayesian) approach. The analysis of Kriging metamodels may use bootstrapping. The survey discusses both parametric bootstrappi...