Technical Program

Paper Detail

Paper: PS-2B.65
Session: Poster Session 2B
Location: H Fl├Ąche 1.OG
Session Time: Sunday, September 15, 17:15 - 20:15
Presentation Time:Sunday, September 15, 17:15 - 20:15
Presentation: Poster
Publication: 2019 Conference on Cognitive Computational Neuroscience, 13-16 September 2019, Berlin, Germany
Paper Title: Identifiability of Gaussian Bayesian bandit models
Manuscript:  Click here to view manuscript
License: Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
DOI: https://doi.org/10.32470/CCN.2019.1335-0
Authors: Maarten Speekenbrink, University College London, United Kingdom
Abstract: The Kalman filter, combined with heuristic choice rules such as softmax, UCB, and Thompson sampling, has been a popular model to identify the role of uncertainty in exploration in human reinforcement learning. Here we show that the Kalman filter combined with a softmax or UCB choice rule is not fully identifiable. By this structural identifiability, we mean that with unlimited data, the true parameter values are determinable. Perhaps surprisingly, the Kalman filter with Thompson sampling is fully identifiable.