中文
相关论文

相关论文: Learning to Explore in Diverse Reward Settings via…

200 篇论文

In this paper, we propose SEA, a novel approach for active robot exploration through semantic map prediction and a reinforcement learning-based hierarchical exploration policy. Unlike existing learning-based methods that rely on one-step…

机器人学 · 计算机科学 2025-12-12 Hongyu Ding , Xinyue Liang , Yudong Fang , You Wu , Jieqi Shi , Jing Huo , Wenbin Li , Jing Wu , Yu-Kun Lai , Yang Gao

Efficient exploration is a long-standing problem in reinforcement learning since extrinsic rewards are usually sparse or missing. A popular solution to this issue is to feed an agent with novelty signals as intrinsic rewards. In this work,…

机器学习 · 计算机科学 2022-05-20 Jianren Wang , Ziwen Zhuang , Hang Zhao

Exploration is critical for good results in deep reinforcement learning and has attracted much attention. However, existing multi-agent deep reinforcement learning algorithms still use mostly noise-based techniques. Very recently,…

人工智能 · 计算机科学 2021-07-27 Iou-Jen Liu , Unnat Jain , Raymond A. Yeh , Alexander G. Schwing

Exploration remains a key challenge in deep reinforcement learning (RL). Optimism in the face of uncertainty is a well-known heuristic with theoretical guarantees in the tabular setting, but how best to translate the principle to deep…

机器学习 · 计算机科学 2023-06-06 Brendan O'Donoghue

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

Text-based games are a popular testbed for language-based reinforcement learning (RL). In previous work, deep Q-learning is commonly used as the learning agent. Q-learning algorithms are challenging to apply to complex real-world domains…

机器学习 · 计算机科学 2023-06-28 Weichen Li , Rati Devidze , Sophie Fellenz

Model-based deep reinforcement learning has achieved success in various domains that require high sample efficiencies, such as Go and robotics. However, there are some remaining issues, such as planning efficient explorations to learn more…

机器学习 · 计算机科学 2021-07-06 Yao Yao , Li Xiao , Zhicheng An , Wanpeng Zhang , Dijun Luo

Contextual bandit problems are a natural fit for many information retrieval tasks, such as learning to rank, text classification, recommendation, etc. However, existing learning methods for contextual bandit problems have one of two…

信息检索 · 计算机科学 2020-02-06 Rolf Jagerman , Ilya Markov , Maarten de Rijke

Exploration in complex domains is a key challenge in reinforcement learning, especially for tasks with very sparse rewards. Recent successes in deep reinforcement learning have been achieved mostly using simple heuristic exploration…

机器学习 · 计算机科学 2017-03-07 Joshua Achiam , Shankar Sastry

What is a good exploration strategy for an agent that interacts with an environment in the absence of external rewards? Ideally, we would like to get a policy driving towards a uniform state-action visitation (highly exploring) in a minimum…

机器学习 · 计算机科学 2019-12-20 Mirco Mutti , Marcello Restelli

Deep reinforcement learning (DRL) faces significant challenges in addressing the hard-exploration problems in tasks with sparse or deceptive rewards and large state spaces. These challenges severely limit the practical application of DRL.…

机器学习 · 计算机科学 2024-01-03 Guojian Wang , Faguo Wu , Xiao Zhang , Ning Guo , Zhiming Zheng

In reinforcement learning (RL), temporal difference (TD) errors are widely adopted for optimizing value and policy functions. However, since the TD error is defined by a bootstrap method, its computation tends to be noisy and destabilize…

机器学习 · 计算机科学 2026-04-03 Taisuke Kobayashi

We propose a exploration mechanism of policy in Deep Reinforcement Learning, which is exploring more when agent needs, called Add Noise to Noise (AN2N). The core idea is: when the Deep Reinforcement Learning agent is in a state of poor…

机器学习 · 计算机科学 2021-09-29 Youtian Guo , Qi Gao

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

An agent learning through interactions should balance its action selection process between probing the environment to discover new rewards and using the information acquired in the past to adopt useful behaviour. This trade-off is usually…

机器学习 · 计算机科学 2019-07-02 Lucas Beyer , Damien Vincent , Olivier Teboul , Sylvain Gelly , Matthieu Geist , Olivier Pietquin

Deploying deep reinforcement learning in safety-critical settings requires developing algorithms that obey hard constraints during exploration. This paper contributes a first approach toward enforcing formal safety constraints on end-to-end…

人工智能 · 计算机科学 2020-07-03 Nathan Hunt , Nathan Fulton , Sara Magliacane , Nghia Hoang , Subhro Das , Armando Solar-Lezama

Designing optimal prompts for Large Language Models (LLMs) is a complicated and resource-intensive task, often requiring substantial human expertise and effort. Existing approaches typically separate the optimization of prompt instructions…

计算与语言 · 计算机科学 2025-07-15 Wendi Cui , Zhuohang Li , Hao Sun , Damien Lopez , Kamalika Das , Bradley Malin , Sricharan Kumar , Jiaxin Zhang

We propose Structured Exploration with Achievements (SEA), a multi-stage reinforcement learning algorithm designed for achievement-based environments, a particular type of environment with an internal achievement set. SEA first uses offline…

机器学习 · 计算机科学 2023-05-02 Zihan Zhou , Animesh Garg

The objective of a reinforcement learning agent is to discover better actions through exploration. However, typical exploration techniques aim to maximize rewards, often incurring high costs in both exploration and learning processes. We…

机器学习 · 计算机科学 2024-12-24 Akane Tsuboya , Yu Kono , Tatsuji Takahashi

Evolution strategies (ES) are a family of black-box optimization algorithms able to train deep neural networks roughly as well as Q-learning and policy gradient methods on challenging deep reinforcement learning (RL) problems, but are much…

人工智能 · 计算机科学 2018-10-31 Edoardo Conti , Vashisht Madhavan , Felipe Petroski Such , Joel Lehman , Kenneth O. Stanley , Jeff Clune