中文
相关论文

相关论文: Curious Explorer: a provable exploration strategy …

200 篇论文

Efficient exploration remains a central challenge in reinforcement learning, serving as a useful pretraining objective for data collection, particularly when an external reward function is unavailable. A principled formulation of the…

机器学习 · 计算机科学 2026-03-16 Jacob Adamczyk , Adam Kamoski , Rahul V. Kulkarni

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

Despite advancements in deep reinforcement learning algorithms, developing an effective exploration strategy is still an open problem. Most existing exploration strategies either are based on simple heuristics, or require the model of the…

机器学习 · 计算机科学 2021-02-11 Arash Mahyari

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

We present a new model-based algorithm for reinforcement learning (RL) which consists of explicit exploration and exploitation phases, and is applicable in large or infinite state spaces. The algorithm maintains a set of dynamics models…

机器学习 · 计算机科学 2019-12-03 Mikael Henaff

The Exploration-Exploitation tradeoff arises in Reinforcement Learning when one cannot tell if a policy is optimal. Then, there is a constant need to explore new actions instead of exploiting past experience. In practice, it is common to…

机器学习 · 计算机科学 2019-09-10 Lior Shani , Yonathan Efroni , Shie Mannor

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…

Self-supervised goal proposal and reaching is a key component for exploration and efficient policy learning algorithms. Such a self-supervised approach without access to any oracle goal sampling distribution requires deep exploration and…

机器人学 · 计算机科学 2021-04-28 Homanga Bharadhwaj , Animesh Garg , Florian Shkurti

We analyze the efficiency of parallelization and restart mechanisms for stochastic simulations in model-free settings, where the underlying system dynamics are unknown. Such settings are common in Reinforcement Learning (RL) and rare event…

概率论 · 数学 2026-05-07 Ernesto Garcia , Paola Bermolen , Matthieu Jonckheere , Seva Shneer

A precondition for the deployment of a Reinforcement Learning agent to a real-world system is to provide guarantees on the learning process. While a learning algorithm will eventually converge to a good policy, there are no guarantees on…

机器学习 · 统计学 2023-12-27 Paul Daoudi , Mathias Formoso , Othman Gaizi , Achraf Azize , Evrard Garcelon

We study algorithms for average-cost reinforcement learning problems with value function approximation. Our starting point is the recently proposed POLITEX algorithm, a version of policy iteration where the policy produced in each iteration…

机器学习 · 计算机科学 2019-08-29 Yasin Abbasi-Yadkori , Nevena Lazic , Csaba Szepesvari , Gellert Weisz

Real-world applications require RL algorithms to act safely. During learning process, it is likely that the agent executes sub-optimal actions that may lead to unsafe/poor states of the system. Exploration is particularly brittle in…

机器学习 · 统计学 2019-06-17 Elena Smirnova , Elvis Dohmatob , Jérémie Mary

Safe exploration is a key requirement for reinforcement learning (RL) agents to learn and adapt online, beyond controlled (e.g. simulated) environments. In this work, we tackle this challenge by utilizing suboptimal yet conservative…

机器学习 · 计算机科学 2026-02-10 Manuel Wendl , Yarden As , Manish Prajapat , Anton Pollak , Stelian Coros , Andreas Krause

In order to compute near-optimal policies with policy-gradient algorithms, it is common in practice to include intrinsic exploration terms in the learning objective. Although the effectiveness of these terms is usually justified by an…

机器学习 · 计算机科学 2025-08-21 Adrien Bolland , Gaspard Lambrechts , Damien Ernst

How do you incentivize self-interested agents to $\textit{explore}$ when they prefer to $\textit{exploit}$? We consider complex exploration problems, where each agent faces the same (but unknown) MDP. In contrast with traditional…

机器学习 · 计算机科学 2023-02-21 Max Simchowitz , Aleksandrs Slivkins

Actor-critic (AC) algorithms are a class of model-free deep reinforcement learning algorithms, which have proven their efficacy in diverse domains, especially in solving continuous control problems. Improvement of exploration (action…

机器学习 · 计算机科学 2022-10-04 Chayan Banerjee , Zhiyong Chen , Nasimul Noman

Exploration is an essential part of reinforcement learning, which restricts the quality of learned policy. Hard-exploration environments are defined by huge state space and sparse rewards. In such conditions, an exhaustive exploration of…

机器学习 · 计算机科学 2021-09-22 Leonid Ugadiarov , Alexey Skrynnik , Aleksandr I. Panov

Exploration has been a crucial part of reinforcement learning, yet several important questions concerning exploration efficiency are still not answered satisfactorily by existing analytical frameworks. These questions include exploration…

机器学习 · 计算机科学 2016-12-06 Liangpeng Zhang , Ke Tang , Xin Yao

Autonomous exploration of cluttered environments requires efficient exploration strategies that guarantee safety against potential collisions with unknown random obstacles. This paper presents a novel approach combining a graph neural…

机器人学 · 计算机科学 2025-04-23 Gabriele Calzolari , Vidya Sumathy , Christoforos Kanellakis , George Nikolakopoulos

Efficient exploration is a central problem in reinforcement learning and is often formalized as maximizing the entropy of the state-action occupancy measure. While unconstrained maximum-entropy exploration is relatively well understood,…

机器学习 · 计算机科学 2026-05-01 Florian Wolf , Ilyas Fatkhullin , Niao He