arXiv:2112.13141
공식 코드 · Papers with Code
On the Unreasonable Efficiency of State Space Clustering in Personalization Tasks
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
High-Throughput Distributed Reinforcement Learning via Adaptive Policy Synchronization
Exploring the robustness of TractOracle methods in RL-based tractography
Deep Reinforcement Learning with Gradient Eligibility Traces
AutoTriton: Automatic Triton Programming with Reinforcement Learning in LLMs
OctoThinker: Mid-training Incentivizes Reinforcement Learning Scaling
Partially Observable Residual Reinforcement Learning for PV-Inverter-Based Voltage Control in Distribution Grids
토론
이 논문과 연결된 포럼 글이 아직 없습니다.