中文
相关论文

相关论文: Episodic Curiosity through Reachability

200 篇论文

In environments with sparse rewards, finding a good inductive bias for exploration is crucial to the agent's success. However, there are two competing goals: novelty search and systematic exploration. While existing approaches such as…

机器学习 · 计算机科学 2023-08-31 Stefan Sylvius Wagner , Peter Arndt , Jan Robine , Stefan Harmeling

We propose a curiosity reward based on information theory principles and consistent with the animal instinct to maintain certain critical parameters within a bounded range. Our experimental validation shows the added value of the additional…

人工智能 · 计算机科学 2018-02-08 Ildefons Magrans de Abril , Ryota Kanai

In recent years, a number of reinforcement learning (RL) methods have been proposed to explore complex environments which differ across episodes. In this work, we show that the effectiveness of these methods critically relies on a…

机器学习 · 计算机科学 2023-01-06 Mikael Henaff , Roberta Raileanu , Minqi Jiang , Tim Rocktäschel

Exploration in environments with sparse feedback remains a challenging research problem in reinforcement learning (RL). When the RL agent explores the environment randomly, it results in low exploration efficiency, especially in robotic…

机器人学 · 计算机科学 2020-11-19 Boyao Li , Tao Lu , Jiayi Li , Ning Lu , Yinghao Cai , Shuo Wang

Curiosity is one of the main motives in many of the natural creatures with measurable levels of intelligence for exploration and, as a result, more efficient learning. It makes it possible for humans and many animals to explore efficiently…

机器学习 · 计算机科学 2023-08-01 Amir Ramezani Dooraki , Alexandros Iosifidis

A major challenge in reinforcement learning is the design of exploration strategies, especially for environments with sparse reward structures and continuous state and action spaces. Intuitively, if the reinforcement signal is very scarce,…

机器学习 · 计算机科学 2021-06-15 Susan Amin , Maziar Gomrokchi , Hossein Aboutalebi , Harsh Satija , Doina Precup

A strong preference for novelty emerges in infancy and is prevalent across the animal kingdom. When incorporated into reinforcement-based machine learning algorithms, visual novelty can act as an intrinsic reward signal that vastly…

神经元与认知 · 定量生物学 2019-01-10 Andrew Jaegle , Vahid Mehrpour , Nicole Rust

This work presents an architecture that generates curiosity-driven goal-directed exploration behaviours for an image sensor of a microfarming robot. A combination of deep neural networks for offline unsupervised learning of low-dimensional…

Standard computer vision systems assume access to intelligently captured inputs (e.g., photos from a human photographer), yet autonomously capturing good observations is a major challenge in itself. We address the problem of learning to…

计算机视觉与模式识别 · 计算机科学 2019-06-28 Santhosh K. Ramakrishnan , Dinesh Jayaraman , Kristen Grauman

Learning in sparse reward settings remains a challenge in Reinforcement Learning, which is often addressed by using intrinsic rewards. One promising strategy is inspired by human curiosity, requiring the agent to learn to predict the…

机器学习 · 计算机科学 2018-10-02 Gino Brunner , Manuel Fritsche , Oliver Richter , Roger Wattenhofer

Exploration under sparse reward is a long-standing challenge of model-free reinforcement learning. The state-of-the-art methods address this challenge by introducing intrinsic rewards to encourage exploration in novel states or uncertain…

机器学习 · 计算机科学 2021-02-05 Daochen Zha , Wenye Ma , Lei Yuan , Xia Hu , Ji Liu

Consider the problem of exploration in sparse-reward or reward-free environments, such as in Montezuma's Revenge. In the curiosity-driven paradigm, the agent is rewarded for how much each realized outcome differs from their predicted…

机器学习 · 统计学 2023-07-21 Daniel Jarrett , Corentin Tallec , Florent Altché , Thomas Mesnard , Rémi Munos , Michal Valko

The sparsity of extrinsic rewards poses a serious challenge for reinforcement learning (RL). Currently, many efforts have been made on curiosity which can provide a representative intrinsic reward for effective exploration. However, the…

人工智能 · 计算机科学 2023-11-21 Zijian Gao , YiYing Li , Kele Xu , Yuanzhao Zhai , Dawei Feng , Bo Ding , XinJun Mao , Huaimin Wang

Exploration algorithms for reinforcement learning typically replace or augment the reward function with an additional ``intrinsic'' reward that trains the agent to seek previously unseen states of the environment. Here, we consider an…

机器学习 · 计算机科学 2025-09-30 Kevin McKee , Eric Alt , Andrew Grebenisan , Mick van Gelderen , Gary Miguel

The study of exploration in the domain of decision making has a long history but remains actively debated. From the vast literature that addressed this topic for decades under various points of view (e.g., developmental psychology,…

机器学习 · 计算机科学 2021-01-14 Léonard Hussenot , Robert Dadashi , Matthieu Geist , Olivier Pietquin

Efficient exploration in deep cooperative multi-agent reinforcement learning (MARL) still remains challenging in complex coordination problems. In this paper, we introduce a novel Episodic Multi-agent reinforcement learning with…

机器学习 · 计算机科学 2021-11-23 Lulu Zheng , Jiarui Chen , Jianhao Wang , Jiamin He , Yujing Hu , Yingfeng Chen , Changjie Fan , Yang Gao , Chongjie Zhang

We present a new computing model for intrinsic rewards in reinforcement learning that addresses the limitations of existing surprise-driven explorations. The reward is the novelty of the surprise rather than the surprise norm. We estimate…

机器学习 · 计算机科学 2024-02-01 Hung Le , Kien Do , Dung Nguyen , Svetha Venkatesh

Agents that can learn to imitate given video observation -- \emph{without direct access to state or action information} are more applicable to learning in the natural world. However, formulating a reinforcement learning (RL) agent that…

机器学习 · 计算机科学 2023-07-14 Glen Berseth , Florian Golemo , Christopher Pal

Exploration is a difficult challenge in reinforcement learning and even recent state-of-the art curiosity-based methods rely on the simple epsilon-greedy strategy to generate novelty. We argue that pure random walks do not succeed to…

机器学习 · 计算机科学 2018-07-06 Fabio Pardo , Vitaly Levdik , Petar Kormushev

One of the main problems of evolutionary algorithms is the convergence of the population to local minima. In this paper, we explore techniques that can avoid this problem by encouraging a diverse behavior of the agents through a shared…

神经与进化计算 · 计算机科学 2022-08-04 David Herel , Dominika Zogatova , Matej Kripner , Tomas Mikolov