42 citations · 89 across the 10 of their papers we have counts for
Showing stat.MLShow all
2 papers · 1 filter
stat.ML2017★ 8 cited
Optimal Policies for Observing Time Series and Related Restless Bandit Problems
Christopher R. Dance, Tomi Silander
The trade-off between the cost of acquiring and processing data, and uncertainty due to a lack of data is fundamental in machine learning. A basic instance of this trade-off is the…
stat.ML2015★ 3 cited
When are Kalman-filter restless bandits indexable?
Christopher R. Dance, Tomi Silander
We study the restless bandit associated with an extremely simple scalar Kalman filter model in discrete time. Under certain assumptions, we prove that the problem is indexable in t…