On the Unreasonable Efficiency of State Space Clustering in Personalization Tasks

Author name not available (Why is that?)

Publication date: 24 December 2021

Abstract: In this effort we consider a reinforcement learning (RL) technique for solving personalization tasks with complex reward signals. In particular, our approach is based on state space clustering with the use of a simplistic

k

-means algorithm as well as conventional choices of the network architectures and optimization algorithms. Numerical examples demonstrate the efficiency of different RL procedures and are used to illustrate that this technique accelerates the agent's ability to learn and does not restrict the agent's performance.

Has companion code repository: https://github.com/sukiboo/personalization_wain21

This page was built for publication: On the Unreasonable Efficiency of State Space Clustering in Personalization Tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6386659)