You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

44 lines
1.8 KiB

author = {Bar-Shalom, Y.},
title = {Tracking and Data Association},
year = {1987},
isbn = {0-120-79760-7},
publisher = {Academic Press Professional, Inc.},
address = {San Diego, CA, USA},
author = {Ingemar J. Cox},
title = {A Review of Statistical Data Association Techniques for Motion Correspondence},
journal = {International Journal of Computer Vision},
year = {1993},
volume = {10},
pages = {53--66}
author = {Hans, Alexander and Udluft, Steffen},
booktitle = {International {{Conference}} on {{Artificial Neural Networks}}},
date = {2009},
pages = {70--79},
publisher = {{Springer}},
title = {Efficient Uncertainty Propagation for Reinforcement Learning with Limited Data}
author = {Tresp, Volker},
date = {1994},
journaltitle = {Siemens AG, CT IC 4, Technical Report},
title = {The Wet Game of Chicken}
abstract = {In this paper, we present a Bayesian view on model-based reinforcement learning. We use expert knowledge to impose structure on the transition model and present an efficient learning scheme based on variational inference. This scheme is applied to a heteroskedastic and bimodal benchmark problem on which we compare our results to NFQ and show how our approach yields human-interpretable insight about the underlying dynamics while also increasing data-efficiency.},
author = {Kaiser, Markus and Otte, Clemens and Runkler, Thomas and Ek, Carl Henrik},
date = {2019},
journaltitle = {Computational Intelligence and Machine Learning},
langid = {english},
pages = {6},
title = {Interpretable {{Dynamics Models}} for {{Data}}-{{Efficient Reinforcement Learning}}},
volume = {ESANN 2019 proceedings}