English
Related papers

Related papers: Self-Supervised Exploration via Disagreement

200 papers

This paper investigates the automatic exploration problem under the unknown environment, which is the key point of applying the robotic system to some social tasks. The solution to this problem via stacking decision rules is impossible to…

Robotics · Computer Science 2020-07-24 Haoran Li , Qichao Zhang , Dongbin Zhao

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…

Robotics · Computer Science 2019-03-06 Tao Chen , Saurabh Gupta , Abhinav Gupta

A default assumption in the design of reinforcement-learning algorithms is that a decision-making agent always explores to learn optimal behavior. In sufficiently complex environments that approach the vastness and scale of the real world,…

Machine Learning · Computer Science 2024-07-23 Dilip Arumugam , Saurabh Kumar , Ramki Gummadi , Benjamin Van Roy

Intrinsically motivated goal exploration processes enable agents to autonomously sample goals to explore efficiently complex environments with high-dimensional continuous actions. They have been applied successfully to real world robots to…

Machine Learning · Computer Science 2018-11-06 Adrien Laversanne-Finot , Alexandre Péré , Pierre-Yves Oudeyer

Reinforcement Learning has emerged as a strong alternative to solve optimization tasks efficiently. The use of these algorithms highly depends on the feedback signals provided by the environment in charge of informing about how good (or…

Machine Learning · Computer Science 2022-12-01 Alain Andres , Esther Villar-Rodriguez , Javier Del Ser

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…

Robotics · Computer Science 2019-08-13 Miroslav Bogdanovic , Ludovic Righetti

Solving tasks with sparse rewards is one of the most important challenges in reinforcement learning. In the single-agent setting, this challenge is addressed by introducing intrinsic rewards that motivate agents to explore unseen regions of…

Machine Learning · Computer Science 2021-05-25 Shariq Iqbal , Fei Sha

Efficient exploration remains a challenging problem in reinforcement learning, especially for tasks where extrinsic rewards from environments are sparse or even totally disregarded. Significant advances based on intrinsic motivation show…

Machine Learning · Computer Science 2024-04-03 Chenjia Bai , Peng Liu , Kaiyu Liu , Lingxiao Wang , Yingnan Zhao , Lei Han

Developing autonomous agents that quickly explore an environment and adapt their behavior online is a canonical challenge in robotics and machine learning. While humans are able to achieve such fast online exploration and adaptation, often…

Machine Learning · Computer Science 2025-07-15 Andrew Wagenmaker , Zhiyuan Zhou , Sergey Levine

An effective approach to exploration in reinforcement learning is to rely on an agent's uncertainty over the optimal policy, which can yield near-optimal exploration strategies in tabular settings. However, in non-tabular settings that…

Efficient exploration remains a challenging research problem in reinforcement learning, especially when an environment contains large state spaces, deceptive local optima, or sparse rewards. To tackle this problem, we present a…

Artificial Intelligence · Computer Science 2018-10-30 Zhang-Wei Hong , Tzu-Yun Shann , Shih-Yang Su , Yi-Hsiang Chang , Chun-Yi Lee

Unsupervised skill learning objectives (Gregor et al., 2016, Eysenbach et al., 2018) allow agents to learn rich repertoires of behavior in the absence of extrinsic rewards. They work by simultaneously training a policy to produce…

Machine Learning · Computer Science 2022-05-13 DJ Strouse , Kate Baumli , David Warde-Farley , Vlad Mnih , Steven Hansen

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…

Machine Learning · Computer Science 2019-06-20 Zhaohan Daniel Guo , Emma Brunskill

Exploration in environments with sparse rewards has been a persistent problem in reinforcement learning (RL). Many tasks are natural to specify with a sparse reward, and manually shaping a reward function can result in suboptimal…

Machine Learning · Computer Science 2018-02-27 Ashvin Nair , Bob McGrew , Marcin Andrychowicz , Wojciech Zaremba , Pieter Abbeel

We study the problem of learning exploration-exploitation strategies that effectively adapt to dynamic environments, where the task may change over time. While RNN-based policies could in principle represent such strategies, in practice…

Exploration in unknown environments is a fundamental problem in reinforcement learning and control. In this work, we study task-guided exploration and determine what precisely an agent must learn about their environment in order to complete…

Machine Learning · Computer Science 2021-07-13 Andrew Wagenmaker , Max Simchowitz , Kevin Jamieson

One effective approach for equipping artificial agents with sensorimotor skills is to use self-exploration. To do this efficiently is critical, as time and data collection are costly. In this study, we propose an exploration mechanism that…

Robotics · Computer Science 2021-02-18 Melisa Sener , Yukie Nagai , Erhan Oztop , Emre Ugur

In recent years Landmark Complexes have been successfully employed for localization-free and metric-free autonomous exploration using a group of sensing-limited and communication-limited robots in a GPS-denied environment. To ensure rapid…

Robotics · Computer Science 2022-09-27 Xiatao Sun , Yuwei Wu , Subhrajit Bhattacharya , Vijay Kumar

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…

Machine Learning · Computer Science 2018-07-06 Fabio Pardo , Vitaly Levdik , Petar Kormushev

Numerous heuristics and advanced approaches have been proposed for exploration in different settings for deep reinforcement learning. Noise-based exploration generally fares well with dense-shaped rewards and bonus-based exploration with…

Machine Learning · Computer Science 2025-10-22 Sebastian Griesbach , Carlo D'Eramo
‹ Prev 1 2 3 10 Next ›