Stability Enforced Bandit Algorithms for Channel Selection in Remote State Estimation of Gauss-Markov Processes
원문 초록
In this paper we consider the problem of remote state estimation of a Gauss-Markov process, where a sensor can, at each discrete time instant, transmit on one out of M different communication channels. A key difficulty of the situation at hand is that the channel statistics are unknown. We study the case where both learning of the channel reception probabilities and state estimation is carried out simultaneously. Methods for choosing the channels based on techniques for multi-armed bandits are presented, and shown to provide stability. Furthermore, we define the performance notion of estimation regret, and derive bounds on how it scales with time for the considered algorithms.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
From Models To Experiments: Shallow Recurrent Decoder Networks on the DYNASTY Experimental Facility
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
Recursive KalmanNet: Deep Learning-Augmented Kalman Filtering for State Estimation with Consistent Uncertainty Quantification
From Theory to Practice with RAVEN-UCB: Addressing Non-Stationarity in Multi-Armed Bandits through Variance Adaptation
VirnyFlow: A Design Space for Responsible Model Development
Test-Time Scaling of Diffusion Models via Noise Trajectory Search
토론
이 논문과 연결된 포럼 글이 아직 없습니다.