paper-with-me

홈 › Papers

Mega-Reward: Achieving Human-Level Play without Extrinsic Rewards

2019-05-12 · Yuhang Song, Jianyi Wang, Thomas Lukasiewicz, Zhenghua Xu, Shangtong Zhang, Andrzej Wojcicki, Mai Xu

Intrinsic rewards were introduced to simulate how human intelligence works; they are usually evaluated by intrinsically-motivated play, i.e., playing games without extrinsic rewards but evaluated with extrinsic rewards. However, none of the existing intrinsic reward approaches can achieve human-level performance under this very challenging setting of intrinsically-motivated play. In this work, we propose a novel megalomania-driven intrinsic reward (called mega-reward), which, to our knowledge, is the first approach that achieves human-level performance in intrinsically-motivated play. Intuitively, mega-reward comes from the observation that infants' intelligence develops when they try to gain more control on entities in an environment; therefore, mega-reward aims to maximize the control capabilities of agents on given entities in a given environment. To formalize mega-reward, a relational transition model is proposed to bridge the gaps between direct and latent control. Experimental studies show that mega-reward (i) can greatly outperform all state-of-the-art intrinsic reward approaches, (ii) generally achieves the same level of performance as Ex-PPO and professional human-level scores, and (iii) has also a superior performance when it is incorporated with extrinsic rewards.

📄 PDF Abstract BibTeX arXiv:1905.04640

Code (1)

YuhangSong/Mega-Reward 공식 구현 pytorch

Similar Papers 제목 키워드 기반

Natural reward as the fundamental macroevolutionary force

2019-03-22

Darwin's theory of evolution by natural selection does not predict long-term progress or advancement, nor does it provide a useful way to define or understand these concepts. Nevertheless, the history of life is marked b…

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback

2023-06-22 · Arnab Maiti, Kevin Jamieson, Lillian J. Ratliff

This paper studies a variant of two-player zero-sum matrix games, where, at each timestep, the row player selects row $i$, the column player selects column $j$, and the row player receives a noisy reward with expected va…

Near-Optimal Online Egalitarian learning in General Sum Repeated Matrix Games

2019-06-04 · Aristide Tossou, Christos Dimitrakakis, Jaroslaw Rzepecki, Katja Hofmann

We study two-player general sum repeated finite games where the rewards of each player are generated from an unknown distribution. Our aim is to find the egalitarian bargaining solution (EBS) for the repeated game, which…

Decision Variance in Online Learning

2018-07-24 · Sattar Vakili, Alexis Boukouvalas, Qing Zhao

Online learning has traditionally focused on the expected rewards. In this paper, a risk-averse online learning problem under the performance measure of the mean-variance of the rewards is studied. Both the bandit and fu…

Hierarchical Cooperative Multi-Agent Reinforcement Learning with Skill Discovery

2019-12-07 · Jiachen Yang, Igor Borovikov, Hongyuan Zha

Human players in professional team sports achieve high level coordination by dynamically choosing complementary skills and executing primitive actions to perform these skills. As a step toward creating intelligent agents…

Multi-agent Reinforcement LearningQ-Learningreinforcement-learningReinforcement Learning+1