Efficient Learning of POMDPs with Known Observation Model in Average-Reward Setting
<|reference_start|>Efficient Learning of POMDPs with Known Observation Model in Average-Reward Setting: Dealing with Partially Observable Markov Decision Processes is notably a challenging task. We face an average-reward infinite-horizon POMDP setting with an unknown transition model, where we assume the knowledge of the observation model. Under this assumption, we propose the Observation-Aware Spectral (OAS) estimation technique, which enables the POMDP parameters to be learned from samples collected using a belief-based policy. Then, we propose the OAS-UCRL algorithm that implicitly balances the exploration-exploitation trade-off following the $\textit{optimism in the face of uncertainty}$ principle. The algorithm runs through episodes of increasing length. For each episode, the optimal belief-based policy of the estimated POMDP interacts with the environment and collects samples that will be used in the next episode by the OAS estimation procedure to compute a new estimate of the POMDP parameters. Given the estimated model, an optimization oracle computes the new optimal policy. We show the consistency of the OAS procedure, and we prove a regret guarantee of order $\mathcal{O}(\sqrt{T \log(T)})$ for the proposed OAS-UCRL algorithm. We compare against the oracle playing the optimal stochastic belief-based policy and show the efficient scaling of our approach with respect to the dimensionality of the state, action, and observation space. We finally conduct numerical simulations to validate and compare the proposed technique with other baseline approaches.<|reference_end|>
@article{russo2024efficient,
    title={Efficient Learning of POMDPs with Known Observation Model in
  Average-Reward Setting},
    author={Alessio Russo, Alberto Maria Metelli, Marcello Restelli},
    journal={arXiv preprint arXiv:2410.01331},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.01331},
    primaryClass={cs.LG stat.ML}
}