Multi-Objective Inverse Reinforcement Learning via Non-Negative Matrix Factorization

Daiko Kishikawa, S. Arai
{"title":"Multi-Objective Inverse Reinforcement Learning via Non-Negative Matrix Factorization","authors":"Daiko Kishikawa, S. Arai","doi":"10.1109/iiai-aai53430.2021.00078","DOIUrl":null,"url":null,"abstract":"In recent years, inverse reinforcement learning, which estimates the reward from the sequence of states followed by an expert (trajectory), has been attracting attention in terms of imitating complex behaviors and estimating the intentions of people or animals. Existing inverse reinforcement learning methods assume that the expert has a single objective. However, it is more natural to assume that experts have multiple objectives in the real world. A previous paper proposed a method for estimating an expert's preferences for each objective (i.e., weights) when the true multi-objective reward vector is known. In this study, we formulated the simultaneous estimation of the multi-objective reward vector and weights as a multi-objective inverse reinforcement learning (MOIRL) problem where both are unknown. In this paper, we propose a MOIRL method based on non-negative matrix factorization. Through the results of computational experiments, we show that the proposed method can estimate the rewards and weights from trajectories obtained in a multi-objective environment.","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iiai-aai53430.2021.00078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In recent years, inverse reinforcement learning, which estimates the reward from the sequence of states followed by an expert (trajectory), has been attracting attention in terms of imitating complex behaviors and estimating the intentions of people or animals. Existing inverse reinforcement learning methods assume that the expert has a single objective. However, it is more natural to assume that experts have multiple objectives in the real world. A previous paper proposed a method for estimating an expert's preferences for each objective (i.e., weights) when the true multi-objective reward vector is known. In this study, we formulated the simultaneous estimation of the multi-objective reward vector and weights as a multi-objective inverse reinforcement learning (MOIRL) problem where both are unknown. In this paper, we propose a MOIRL method based on non-negative matrix factorization. Through the results of computational experiments, we show that the proposed method can estimate the rewards and weights from trajectories obtained in a multi-objective environment.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于非负矩阵分解的多目标逆强化学习
近年来,逆强化学习在模仿复杂行为和估计人或动物的意图方面引起了人们的关注,该学习从专家所遵循的状态序列(轨迹)中估计奖励。现有的逆强化学习方法假设专家只有一个目标。然而,更自然的假设是,专家在现实世界中有多个目标。之前的一篇论文提出了一种方法,当真正的多目标奖励向量已知时,估计专家对每个目标的偏好(即权重)。在本研究中,我们将多目标奖励向量和权重的同时估计制定为一个多目标逆强化学习(MOIRL)问题,其中两者都是未知的。本文提出了一种基于非负矩阵分解的MOIRL方法。通过计算实验结果表明,该方法可以从多目标环境中获得的轨迹中估计出奖励和权重。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An analysis of preferences of convention attendees in the time of Covid-19 pandemic Visual Effects for Real Time Ocean Water Rendering Analysis of commands of Telnet logs illegally connected to IoT devices Design, modeling and parameters identification of rotary-type double inverted pendulum An Improved NSGA-II for Service Provider Composition in Knowledge-Intensive Crowdsourcing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1