Sampling of the Wiener Process for Remote Estimation over a Channel with Unknown Delay Statistics
share
In this paper, we study an online sampling problem of the Wiener process. The goal is to minimize the mean squared error (MSE) of the remote estimator under a sampling frequency constraint when the transmission delay distribution is unknown. The sampling problem is reformulated into a renewal reward optimization problem, and we propose an online sampling algorithm that can adaptively learn the optimal sampling policy through stochastic approximation. We show that the cumulative MSE regret grows with rate 𝒪(ln k), where k is the number of samples. Through Le Cam's two point method, we show that the worst-case cumulative MSE regret of any online sampling algorithm is lower bounded by Ω(ln k). Hence, the proposed online sampling algorithm is minimax order-optimal. Finally, we validate the performance of the proposed algorithm via numerical simulations.
READ FULL TEXT