中文
相关论文

相关论文: Accelerating Exploration with Unlabeled Prior Data

200 篇论文

Reinforcement learning (RL) in sparse-reward environments remains a significant challenge due to the lack of informative feedback. We propose a simple yet effective method that uses a small number of successful demonstrations to initialize…

机器学习 · 计算机科学 2025-10-29 Seyed Mahdi Basiri Azad , Joschka Boedecker

The exploration-exploitation dilemma in reinforcement learning (RL) is a fundamental challenge to efficient RL algorithms. Existing algorithms for finite state and action discounted RL problems address this by assuming sufficient…

机器学习 · 计算机科学 2025-12-09 Caleb Ju , Guanghui Lan

Offline reinforcement learning (RL) learns policies from a fixed dataset, but often requires large amounts of data. The challenge arises when labeled datasets are expensive, especially when rewards have to be provided by human labelers for…

机器学习 · 计算机科学 2025-05-30 Yen-Ru Lai , Fu-Chieh Chang , Pei-Yuan Wu

Intelligent agents must pursue their goals in complex environments with partial information and often limited computational capacity. Reinforcement learning methods have achieved great success by creating agents that optimize engineered…

机器学习 · 计算机科学 2021-06-07 Alejandro Daniel Noel , Charel van Hoof , Beren Millidge

Deep learning has achieved remarkable successes in solving challenging reinforcement learning (RL) problems when dense reward function is provided. However, in sparse reward environment it still often suffers from the need to carefully…

机器学习 · 计算机科学 2019-02-19 Hao Liu , Alexander Trott , Richard Socher , Caiming Xiong

This paper reviews exploration techniques in deep reinforcement learning. Exploration techniques are of primary importance when solving sparse reward problems. In sparse reward problems, the reward is rare, which means that the agent will…

机器学习 · 计算机科学 2022-05-03 Pawel Ladosz , Lilian Weng , Minwoo Kim , Hyondong Oh

Reinforcement learning (RL) agents improve through trial-and-error, but when reward is sparse and the agent cannot discover successful action sequences, learning stagnates. This has been a notable problem in training deep RL agents to…

人工智能 · 计算机科学 2018-02-27 Evan Zheran Liu , Kelvin Guu , Panupong Pasupat , Tianlin Shi , Percy Liang

Improving sample efficiency is central to Reinforcement Learning (RL), especially in environments where the rewards are sparse. Some recent approaches have proposed to specify reward functions as manually designed or learned reward…

机器学习 · 计算机科学 2024-01-26 Shuai Han , Mehdi Dastani , Shihan Wang

While reinforcement learning (RL) has been successful in natural language processing (NLP) domains such as dialogue generation and text-based games, it typically faces the problem of sparse rewards that leads to slow or no convergence.…

计算与语言 · 计算机科学 2020-10-07 Ameet Deshpande , Eve Fleisig

Realistic environments often provide agents with very limited feedback. When the environment is initially unknown, the feedback, in the beginning, can be completely absent, and the agents may first choose to devote all their effort on…

To achieve sample efficiency in reinforcement learning (RL), it necessitates efficiently exploring the underlying environment. Under the offline setting, addressing the exploration challenge lies in collecting an offline dataset with…

机器学习 · 计算机科学 2022-02-15 Shuang Qiu , Jieping Ye , Zhaoran Wang , Zhuoran Yang

Meta reinforcement learning (meta-RL) extracts knowledge from previous tasks and achieves fast adaptation to new tasks. Despite recent progress, efficient exploration in meta-RL remains a key challenge in sparse-reward tasks, as it requires…

人工智能 · 计算机科学 2021-11-15 Jin Zhang , Jianhao Wang , Hao Hu , Tong Chen , Yingfeng Chen , Changjie Fan , Chongjie Zhang

Current reinforcement learning (RL) in robotics often experiences difficulty in generalizing to new downstream tasks due to the innate task-specific training paradigm. To alleviate it, unsupervised RL, a framework that pre-trains the agent…

机器人学 · 计算机科学 2022-10-13 Daesol Cho , Jigang Kim , H. Jin Kim

Model free reinforcement learning suffers from the high sampling complexity inherent to robotic manipulation or locomotion tasks. Most successful approaches typically use random sampling strategies which leads to slow policy convergence. In…

机器人学 · 计算机科学 2019-08-13 Miroslav Bogdanovic , Ludovic Righetti

We introduce Random Latent Exploration (RLE), a simple yet effective exploration strategy in reinforcement learning (RL). On average, RLE outperforms noise-based methods, which perturb the agent's actions, and bonus-based exploration, which…

机器学习 · 计算机科学 2025-02-28 Srinath Mahankali , Zhang-Wei Hong , Ayush Sekhari , Alexander Rakhlin , Pulkit Agrawal

Mastering robotic manipulation skills through reinforcement learning (RL) typically requires the design of shaped reward functions. Recent developments in this area have demonstrated that using sparse rewards, i.e. rewarding the agent only…

机器学习 · 计算机科学 2021-11-12 Ozsel Kilinc , Giovanni Montana

Reinforcement learning (RL) algorithms typically start tabula rasa, without any prior knowledge of the environment, and without any prior skills. This however often leads to low sample efficiency, requiring a large amount of interaction…

机器学习 · 计算机科学 2020-07-13 Matthias Hutsebaut-Buysse , Kevin Mets , Steven Latré

Exploration is a fundamental challenge in reinforcement learning (RL). Many of the current exploration methods for deep RL use task-agnostic objectives, such as information gain or bonuses based on state visitation. However, many practical…

机器学习 · 计算机科学 2018-02-21 Abhishek Gupta , Russell Mendonca , YuXuan Liu , Pieter Abbeel , Sergey Levine

In reinforcement learning (RL), value-based algorithms learn to associate each observation with the states and rewards that are likely to be reached from it. We observe that many self-supervised image pre-training methods bear similarity to…

机器学习 · 计算机科学 2025-06-16 Dibya Ghosh , Sergey Levine

Reward-free reinforcement learning (RL) considers the setting where the agent does not have access to a reward function during exploration, but must propose a near-optimal policy for an arbitrary reward function revealed only after…

机器学习 · 计算机科学 2022-06-22 Andrew Wagenmaker , Yifang Chen , Max Simchowitz , Simon S. Du , Kevin Jamieson