When are Kalman-filter restless bandits indexable?

09/15/2015
by   Christopher R. Dance, et al.
0

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 the sense that the Whittle index is a non-decreasing function of the relevant belief state. In spite of the long history of this problem, this appears to be the first such proof. We use results about Schur-convexity and mechanical words, which are particular binary strings intimately related to palindromes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2020

An Explicit Probabilistic Derivation of Inflation in a Scalar Ensemble Kalman Filter for Finite Step, Finite Ensemble Convergence

This paper uses a probabilistic approach to analyze the converge of an e...
research
01/04/2021

Kalman Filter from the Mutual Information Perspective

Kalman filter is a best linear unbiased state estimator. It is also comp...
research
05/11/2021

Stochastic Formulation of Causal Digital Twin: Kalman Filter Algorithm

We provide some basic and sensible definitions of different types of dig...
research
09/27/2022

Design of experiments for the calibration of history-dependent models via deep reinforcement learning and an enhanced Kalman filter

Experimental data is costly to obtain, which makes it difficult to calib...
research
07/27/2022

UltimateKalman: Flexible Kalman Filtering and Smoothing Using Orthogonal Transformations

UltimateKalman is a flexible linear Kalman filter and smoother implement...
research
08/28/2019

Intuitive Neuromyoelectric Control of a Dexterous Bionic Arm Using a Modified Kalman Filter

Multi-articulate prosthetic hands are capable of performing dexterous ha...

Please sign up or login with your details

Forgot password? Click here to reset