HiPPO: Enhancing proximal policy optimization with highlight replay

IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pattern Recognition Pub Date : 2025-06-01 Epub Date: 2025-01-31 DOI:10.1016/j.patcog.2025.111408
Shutong Zhang , Xing Chen , Zhaogeng Liu , Hechang Chen , Yi Chang
{"title":"HiPPO: Enhancing proximal policy optimization with highlight replay","authors":"Shutong Zhang ,&nbsp;Xing Chen ,&nbsp;Zhaogeng Liu ,&nbsp;Hechang Chen ,&nbsp;Yi Chang","doi":"10.1016/j.patcog.2025.111408","DOIUrl":null,"url":null,"abstract":"<div><div>Sample efficiency remains a paramount challenge in policy gradient methods within reinforcement learning. The success of experience replay demonstrates the importance of leveraging historical experiences, often through off-policy methods to enhance approximate policy learning algorithms that aim to maximize current interaction sample reuse, aligning approximate policies with target objectives. However, the inaccurate approximation can negatively affect actual optimization, leading to poorer current experiences than past ones. We propose Highlight Replay Enhanced Proximal Policy Optimization (HiPPO) to address the challenge. Specifically, HiPPO optimizes by highlighting policies and introducing a penalty reward function for constrained optimization, which alleviates the constraints of policy similarity and boosts adaptability to historical experiences. Empirical studies show HiPPO outperforming state-of-the-art algorithms in MuJoCo continuous tasks in performance and learning speed. An in-depth analysis of the experimental results validates the effectiveness of employing highlight replay and penalty reward functions in our proposed method.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"162 ","pages":"Article 111408"},"PeriodicalIF":7.6000,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0031320325000688","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/31 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Sample efficiency remains a paramount challenge in policy gradient methods within reinforcement learning. The success of experience replay demonstrates the importance of leveraging historical experiences, often through off-policy methods to enhance approximate policy learning algorithms that aim to maximize current interaction sample reuse, aligning approximate policies with target objectives. However, the inaccurate approximation can negatively affect actual optimization, leading to poorer current experiences than past ones. We propose Highlight Replay Enhanced Proximal Policy Optimization (HiPPO) to address the challenge. Specifically, HiPPO optimizes by highlighting policies and introducing a penalty reward function for constrained optimization, which alleviates the constraints of policy similarity and boosts adaptability to historical experiences. Empirical studies show HiPPO outperforming state-of-the-art algorithms in MuJoCo continuous tasks in performance and learning speed. An in-depth analysis of the experimental results validates the effectiveness of employing highlight replay and penalty reward functions in our proposed method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
HiPPO:增强近端策略优化与高亮回放
样本效率仍然是强化学习中策略梯度方法的最大挑战。经验回放的成功证明了利用历史经验的重要性,通常通过非策略方法来增强近似策略学习算法,旨在最大化当前交互样本重用,使近似策略与目标目标保持一致。然而,不准确的近似会对实际的优化产生负面影响,导致当前的体验比过去的更差。我们提出了高亮回放增强近端策略优化(HiPPO)来解决这一挑战。具体来说,HiPPO通过突出策略进行优化,并引入奖惩函数进行约束优化,缓解了策略相似性的约束,增强了对历史经验的适应性。实证研究表明,在MuJoCo连续任务中,HiPPO在性能和学习速度上都优于最先进的算法。通过对实验结果的深入分析,验证了采用重播和奖惩函数的方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Pattern Recognition
Pattern Recognition 工程技术-工程:电子与电气
CiteScore
14.40
自引率
16.20%
发文量
683
审稿时长
5.6 months
期刊介绍: The field of Pattern Recognition is both mature and rapidly evolving, playing a crucial role in various related fields such as computer vision, image processing, text analysis, and neural networks. It closely intersects with machine learning and is being applied in emerging areas like biometrics, bioinformatics, multimedia data analysis, and data science. The journal Pattern Recognition, established half a century ago during the early days of computer science, has since grown significantly in scope and influence.
期刊最新文献
IrisMAE: Structure-aware masked image modeling for iris recognition Minimizing the pretraining gap: Domain-aligned text-based person retrieval Stealthy backdoor attack method targeting group fairness in self-supervised learning Single-domain generalization for fastener detection via sample reconstruction and class-wise domain contrast EdgeFusionNet: Edge information-guided small object detection for remote sensing images
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1