7 citations · 16 across the 3 of their papers we have counts for
3 papers
stat.ME2021★ 2 cited
Ignorable and non-ignorable missing data in hidden Markov models
Maarten Speekenbrink, Ingmar Visser
We consider missing data in the context of hidden Markov models with a focus on situations where data is missing not at random (MNAR) and missingness depends on the identity of the…
stat.AP2016★ 7 cited
Simple trees in complex forests: Growing Take The Best by Approximate Bayesian Computation
Eric Schulz, Maarten Speekenbrink, Björn Meder
How can heuristic strategies emerge from smaller building blocks? We propose Approximate Bayesian Computation as a computational solution to this problem. As a first proof of conce…
stat.AP2016★ 7 cited
Better safe than sorry: Risky function exploitation through safe optimization
Eric Schulz, Quentin J. M. Huys, Dominik R. Bach +2
Exploration-exploitation of functions, that is learning and optimizing a mapping between inputs and expected outputs, is ubiquitous to many real world situations. These situations…