中文
相关论文

相关论文: Unifying Count-Based Exploration and Intrinsic Mot…

200 篇论文

We study the problem of safe learning and exploration in sequential control problems. The goal is to safely collect data samples from operating in an environment, in order to learn to achieve a challenging control goal (e.g., an agile…

机器学习 · 计算机科学 2020-06-30 Anqi Liu , Guanya Shi , Soon-Jo Chung , Anima Anandkumar , Yisong Yue

Exploration in sparse reward environments remains one of the key challenges of model-free reinforcement learning. Instead of solely relying on extrinsic rewards provided by the environment, many state-of-the-art methods use intrinsic…

机器学习 · 计算机科学 2020-03-03 Roberta Raileanu , Tim Rocktäschel

Recent work in deep reinforcement learning has allowed algorithms to learn complex tasks such as Atari 2600 games just from the reward provided by the game, but these algorithms presently require millions of training steps in order to…

机器学习 · 计算机科学 2018-01-09 Benjamin Spector , Serge Belongie

Successfully navigating a complex environment to obtain a desired outcome is a difficult task, that up to recently was believed to be capable only by humans. This perception has been broken down over time, especially with the introduction…

机器学习 · 计算机科学 2019-11-12 Joshua Hare

Model-based reinforcement learning is a promising learning strategy for practical robotic applications due to its improved data-efficiency versus model-free counterparts. However, current state-of-the-art model-based methods rely on shaped…

机器学习 · 计算机科学 2023-08-10 Robert McCarthy , Qiang Wang , Stephen J. Redmond

All reinforcement learning algorithms must handle the trade-off between exploration and exploitation. Many state-of-the-art deep reinforcement learning methods use noise in the action selection, such as Gaussian noise in policy gradient…

机器学习 · 计算机科学 2018-04-05 Trevor Barron , Oliver Obst , Heni Ben Amor

Episodic count has been widely used to design a simple yet effective intrinsic motivation for reinforcement learning with a sparse reward. However, the use of episodic count in a high-dimensional state space as well as over a long episode…

机器学习 · 计算机科学 2022-10-12 Daejin Jo , Sungwoong Kim , Daniel Wontae Nam , Taehwan Kwon , Seungeun Rho , Jongmin Kim , Donghoon Lee

Recently, reinforcement learning has been successfully applied to the logical game of Go, various Atari games, and even a 3D game, Labyrinth, though it continues to have problems in sparse reward settings. It is difficult to explore, but…

人工智能 · 计算机科学 2017-03-14 Sungtae Lee , Sang-Woo Lee , Jinyoung Choi , Dong-Hyun Kwak , Byoung-Tak Zhang

We study the problem of exploration in Reinforcement Learning and present a novel model-free solution. We adopt an information-theoretical viewpoint and start from the instance-specific lower bound of the number of samples that have to be…

机器学习 · 计算机科学 2024-07-02 Alessio Russo , Alexandre Proutiere

This paper considers the problem of efficient exploration of unseen environments, a key challenge in AI. We propose a `learning to explore' framework where we learn a policy from a distribution of environments. At test time, presented with…

机器学习 · 计算机科学 2019-10-30 Hanjun Dai , Yujia Li , Chenglong Wang , Rishabh Singh , Po-Sen Huang , Pushmeet Kohli

A key task in Artificial Intelligence is learning effective policies for controlling agents in unknown environments to optimize performance measures. Off-policy learning methods, like Q-learning, allow learners to make optimal decisions…

人工智能 · 计算机科学 2025-09-10 Mingxuan Li , Junzhe Zhang , Elias Bareinboim

One of the most critical challenges in deep reinforcement learning is to maintain the long-term exploration capability of the agent. To tackle this problem, it has been recently proposed to provide intrinsic rewards for the agent to…

机器学习 · 计算机科学 2022-06-02 Mingqi Yuan , Man-on Pun , Dong Wang

Infants are experts at playing, with an amazing ability to generate novel structured behaviors in unstructured environments that lack clear extrinsic reward signals. We seek to replicate some of these abilities with a neural network that…

机器学习 · 计算机科学 2018-02-22 Nick Haber , Damian Mrowca , Li Fei-Fei , Daniel L. K. Yamins

Exploration is a key problem in reinforcement learning, since agents can only learn from data they acquire in the environment. With that in mind, maintaining a population of agents is an attractive method, as it allows data be collected…

机器学习 · 计算机科学 2020-10-08 Jack Parker-Holder , Aldo Pacchiano , Krzysztof Choromanski , Stephen Roberts

Exploration is a crucial and distinctive aspect of reinforcement learning (RL) that remains a fundamental open problem. Several methods have been proposed to tackle this challenge. Commonly used methods inject random noise directly into the…

机器学习 · 计算机科学 2024-11-06 Sebastian Griesbach , Carlo D'Eramo

The utility of learning a dynamics/world model of the environment in reinforcement learning has been shown in a many ways. When using neural networks, however, these models suffer catastrophic forgetting when learned in a lifelong or…

机器学习 · 计算机科学 2019-06-12 Nicholas Ketz , Soheil Kolouri , Praveen Pilly

Understanding how artificial agents model internal mental states is central to advancing Theory of Mind in AI. Evidence points to a unified system for self- and other-awareness. We explore this self-awareness by having reinforcement…

人工智能 · 计算机科学 2026-01-08 Michael Petrowski , Milica Gašić

Boltzmann exploration is a classic strategy for sequential decision-making under uncertainty, and is one of the most standard tools in Reinforcement Learning (RL). Despite its widespread use, there is virtually no theoretical understanding…

机器学习 · 计算机科学 2017-11-08 Nicolò Cesa-Bianchi , Claudio Gentile , Gábor Lugosi , Gergely Neu

We consider the problem of learning by demonstration from agents acting in unknown stochastic Markov environments or games. Our aim is to estimate agent preferences in order to construct improved policies for the same task that the agents…

机器学习 · 计算机科学 2014-08-12 Aristide Tossou , Christos Dimitrakakis

We consider the problem of learning by demonstration from agents acting in unknown stochastic Markov environments or games. Our aim is to estimate agent preferences in order to construct improved policies for the same task that the agents…

机器学习 · 统计学 2013-07-16 Aristide C. Y. Tossou , Christos Dimitrakakis