Papers with Code 아카이브
Montezuma's Revenge
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 1
- 보존된 평가 기록
- 3
Montezuma's Revenge is an ATARI 2600 Benchmark game that is known to be difficult to perform on for reinforcement learning algorithms. Solutions typically employ algorithms that incentivise environment exploration in different ways.
For the state-of-the art tables, please consult the parent Atari Games task.
<span style="color:grey; opacity: 0.6">( Image credit: Q-map )</span>
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Exploration by Random Network Distillation
Learning Representations in Model-Free Hierarchical Reinforcement Learning
Empowerment-driven Exploration using Mutual Information Estimation
Scaling All-Goals Updates in Reinforcement Learning Using Convolutional Neural Networks
Deep Curiosity Search: Intra-Life Exploration Can Improve Performance on Challenging Deep Reinforcement Learning Problems
Playing hard exploration games by watching YouTube
Observe and Look Further: Achieving Consistent Performance on Atari
Hierarchical Imitation and Reinforcement Learning
Learning High-level Representations from Demonstrations
Rainbow: Combining Improvements in Deep Reinforcement Learning
Exploration in Feature Space for Reinforcement Learning
Deep Abstract Q-Networks
Feature Control as Intrinsic Motivation for Hierarchical Reinforcement Learning
Beating Atari with Natural Language Guided Reinforcement Learning
Micro-Objective Learning : Accelerating Deep Reinforcement Learning through the Discovery of Continuous Subgoals
Count-Based Exploration with Neural Density Models
Playing Atari Games with Deep Reinforcement Learning and Human Checkpoint Replay
Unifying Count-Based Exploration and Intrinsic Motivation
Hierarchical Deep Reinforcement Learning: Integrating Temporal Abstraction and Intrinsic Motivation
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.