提出新方法,让无目标网络算法兼具低内存与高性能。
Bridging the Performance Gap Between Target-Free and Target-Based Reinforcement Learning
- 用在线网络最后一层的副本作目标网络,共享其余参数
- 结合迭代Q学习,提升无目标算法的采样效率
- 仅用一个Q网络就接近有目标网络的效果,适合资源受限场景
深度强化学习中,目标网络能缓解半梯度方法的不稳定性并稳定训练,但会增加内存开销并延迟贝尔曼更新。本文跳出有无目标网络的二元选择,提出一种新方法:使用在线网络最后线性层的副本作为目标网络,其余参数与在线网络共享。这一简单修改在保持无目标方法低内存占用的同时,可利用目标网络的成熟技术。进一步结合迭代Q学习(即并行学习连续贝尔曼更新),显著提升无目标方法的样本效率。所提方法迭代共享Q学习(iS-QL)在多种任务上缩小了无目标与有目标方法间的性能差距,仅使用单个Q网络,迈向资源高效的强化学习算法。
原文摘要 · Abstract (English)
The use of target networks in deep reinforcement learning is a widely popular solution to mitigate the brittleness of semi-gradient approaches and stabilize learning. However, target networks notoriously require additional memory and delay the propagation of Bellman updates compared to an ideal target-free approach. In this work, we step out of the binary choice between target-free and target-based algorithms. We introduce a new method that uses a copy of the last linear layer of the online network as a target network, while sharing the remaining parameters with the up-to-date online network. This simple modification enables us to keep the target-free's low-memory footprint while leveraging the target-based literature. We find that combining our approach with the concept of iterated $Q$-learning, which consists of learning consecutive Bellman updates in parallel, helps improve the sample-efficiency of target-free approaches. Our proposed method, iterated Shared $Q$-Learning (iS-QL), bridges the performance gap between target-free and target-based approaches across various problems while using a single $Q$-network, thus stepping towards resource-efficient reinforcement learning algorithms.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。