Implicit Two-Tower Policies
원문 초록
We present a new class of structured reinforcement learning policy-architectures, Implicit Two-Tower (ITT) policies, where the actions are chosen based on the attention scores of their learnable latent representations with those of the input states. By explicitly disentangling action from state processing in the policy stack, we achieve two main goals: substantial computational gains and better performance. Our architectures are compatible with both: discrete and continuous action spaces. By conducting tests on 15 environments from OpenAI Gym and DeepMind Control Suite, we show that ITT-architectures are particularly suited for blackbox/evolutionary optimization and the corresponding policy training algorithms outperform their vanilla unstructured implicit counterparts as well as commonly used explicit policies. We complement our analysis by showing how techniques such as hashing and lazy tower updates, critically relying on the two-tower structure of ITTs, can be applied to obtain additional computational improvements.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
HDDLGym: A Tool for Studying Multi-Agent Hierarchical Problems Defined in HDDL with OpenAI Gym
Improving the Data-efficiency of Reinforcement Learning by Warm-starting with LLM
Mining-Gym: A Configurable RL Benchmarking Environment for Truck Dispatch Scheduling
A quantum-classical reinforcement learning model to play Atari games
Creating Hierarchical Dispositions of Needs in an Agent
Double Successive Over-Relaxation Q-Learning with an Extension to Deep Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.