中文
相关论文

相关论文: BYOL-Explore: Exploration by Bootstrapped Predicti…

200 篇论文

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

Efficient exploration in complex environments remains a major challenge for reinforcement learning. We propose bootstrapped DQN, a simple algorithm that explores in a computationally and statistically efficient manner through use of…

机器学习 · 计算机科学 2016-07-05 Ian Osband , Charles Blundell , Alexander Pritzel , Benjamin Van Roy

One of the bottlenecks preventing Deep Reinforcement Learning algorithms (DRL) from real-world applications is how to explore the environment and collect informative transitions efficiently. The present paper describes bounded exploration,…

机器学习 · 计算机科学 2024-12-10 Ting Qiao , Henry Williams , David Valencia , Bruce MacDonald

Numerous past works have tackled the problem of task-driven navigation. But, how to effectively explore a new environment to enable a variety of down-stream tasks has received much less attention. In this work, we study how agents can…

机器人学 · 计算机科学 2019-03-06 Tao Chen , Saurabh Gupta , Abhinav Gupta

Solving sparse reward tasks through exploration is one of the major challenges in deep reinforcement learning, especially in three-dimensional, partially-observable environments. Critically, the algorithm proposed in this article uses a…

人工智能 · 计算机科学 2021-06-18 Gabriele Libardi , Gianni De Fabritiis

Efficient exploration is a long-standing problem in sensorimotor learning. Major advances have been demonstrated in noise-free, non-stochastic domains such as video games and simulation. However, most of these formulations either get stuck…

机器学习 · 计算机科学 2019-06-11 Deepak Pathak , Dhiraj Gandhi , Abhinav Gupta

Modern AAA video games feature huge game levels and maps which are increasingly hard for level testers to cover exhaustively. As a result, games often ship with catastrophic bugs such as the player falling through the floor or being stuck…

人工智能 · 计算机科学 2022-09-02 Cong Lu , Raluca Georgescu , Johan Verwey

Achieving efficient and scalable exploration in complex domains poses a major challenge in reinforcement learning. While Bayesian and PAC-MDP approaches to the exploration problem offer strong formal guarantees, they are often impractical…

人工智能 · 计算机科学 2015-11-23 Bradly C. Stadie , Sergey Levine , Pieter Abbeel

Exploration in environments with sparse rewards remains a fundamental challenge in reinforcement learning (RL). Existing approaches such as curriculum learning and Go-Explore often rely on hand-crafted heuristics, while curiosity-driven…

机器学习 · 计算机科学 2026-02-03 Georgios Sotirchos , Zlatan Ajanović , Jens Kober

Exploration-exploitation is a powerful and practical tool in multi-agent learning (MAL), however, its effects are far from understood. To make progress in this direction, we study a smooth analogue of Q-learning. We start by showing that…

计算机科学与博弈论 · 计算机科学 2020-12-16 Stefanos Leonardos , Georgios Piliouras

Humans learn to play video games significantly faster than the state-of-the-art reinforcement learning (RL) algorithms. People seem to build simple models that are easy to learn to support planning and strategic exploration. Inspired by…

人工智能 · 计算机科学 2018-11-27 Ramtin Keramati , Jay Whang , Patrick Cho , Emma Brunskill

LLM-based agents have seen promising advances, yet they are still limited in "hard-exploration" tasks requiring learning new knowledge through exploration. We present GLoW, a novel approach leveraging dual-scale world models, maintaining a…

计算与语言 · 计算机科学 2025-10-01 Minsoo Kim , Seung-won Hwang

In many real-world scenarios, rewards extrinsic to the agent are extremely sparse, or absent altogether. In such cases, curiosity can serve as an intrinsic reward signal to enable the agent to explore its environment and learn skills that…

机器学习 · 计算机科学 2017-05-16 Deepak Pathak , Pulkit Agrawal , Alexei A. Efros , Trevor Darrell

Efficient exploration is necessary to achieve good sample efficiency for reinforcement learning in general. From small, tabular settings such as gridworlds to large, continuous and sparse reward settings such as robotic object manipulation…

机器学习 · 计算机科学 2019-06-20 Zhaohan Daniel Guo , Emma Brunskill

Hierarchical multi-robot exploration commonly decouples frontier allocation from local navigation, which can make the system brittle in dense and dynamic environments. Because the allocator lacks direct awareness of execution difficulty,…

机器人学 · 计算机科学 2026-03-10 Ning Liu , Sen Shen , Zheng Li , Sheng Liu , Dongkun Han , Shangke Lyu , Thomas Braunl

Active learning provides a framework to adaptively query the most informative experiments towards learning an unknown black-box function. Various approaches of active learning have been proposed in the literature, however, they either focus…

机器学习 · 计算机科学 2023-10-03 Upala Junaida Islam , Kamran Paynabar , George Runger , Ashif Sikandar Iquebal

Balancing exploration and conservatism in the constrained setting is an important problem if we are to use reinforcement learning for meaningful tasks in the real world. In this paper, we propose a principled algorithm for safe exploration…

人工智能 · 计算机科学 2023-04-24 Alexander W. Goodall , Francesco Belardinelli

Exploration is widely regarded as one of the most challenging aspects of reinforcement learning (RL), with many naive approaches succumbing to exponential sample complexity. To isolate the challenges of exploration, we propose a new…

机器学习 · 计算机科学 2020-02-10 Chi Jin , Akshay Krishnamurthy , Max Simchowitz , Tiancheng Yu

Inverse Reinforcement Learning (IRL) is a powerful paradigm for inferring a reward function from expert demonstrations. Many IRL algorithms require a known transition model and sometimes even a known expert policy, or they at least require…

机器学习 · 计算机科学 2023-08-23 David Lindner , Andreas Krause , Giorgia Ramponi

We introduce an online active exploration algorithm for data-efficiently learning an abstract symbolic model of an environment. Our algorithm is divided into two parts: the first part quickly generates an intermediate Bayesian symbolic…

人工智能 · 计算机科学 2017-11-02 Garrett Andersen , George Konidaris
‹ 上一页 1 2 3 10 下一页 ›