Adaptive Importance Sampling from Probabilistic Tree Automata

Christoph Teichmann, Kasimir Wansing, Alexander Koller

Abstract

We present a general importance sampling technique for approximating expected values based on samples from probabilistic finite tree automata. The algorithm uses the samples it produces to adapt rule probabilities for the automaton in order to improve sample quality.
BibTeX
@misc{teichmann2016adaptive,
  author = {Christoph Teichmann and Kasimir Wansing and Alexander Koller},
  title = {{Adaptive Importance Sampling from Probabilistic Tree Automata}},
  year = {2016},
  doi = {10.18653/v1/w16-2402},
}

Loading related content...

Figure