中文
相关论文

相关论文: Variance-Based Rewards for Approximate Bayesian Re…

200 篇论文

At the boundary between the known and the unknown, an agent inevitably confronts the dilemma of whether to explore or to exploit. Epistemic uncertainty reflects such boundaries, representing systematic uncertainty due to limited knowledge.…

机器学习 · 计算机科学 2026-03-03 Jianfei Ma , Wee Sun Lee

Existing approaches for improving generalization in deep reinforcement learning (RL) have mostly focused on representation learning, neglecting RL-specific aspects such as exploration. We hypothesize that the agent's exploration strategy…

机器学习 · 计算机科学 2023-06-12 Yiding Jiang , J. Zico Kolter , Roberta Raileanu

In the Bayesian Reinforcement Learning (BRL) setting, agents try to maximise the collected rewards while interacting with their environment while using some prior knowledge that is accessed beforehand. Many BRL algorithms have already been…

人工智能 · 计算机科学 2016-09-28 Michael Castronovo , Damien Ernst , Adrien Couetoux , Raphael Fonteneau

Exploration in reinforcement learning is a challenging problem: in the worst case, the agent must search for high-reward states that could be hidden anywhere in the state space. Can we define a more tractable class of RL problems, where the…

机器学习 · 计算机科学 2021-07-20 Kevin Li , Abhishek Gupta , Ashwin Reddy , Vitchyr Pong , Aurick Zhou , Justin Yu , Sergey Levine

Reward-free exploration is a reinforcement learning setting studied by Jin et al. (2020), who address it by running several algorithms with regret guarantees in parallel. In our work, we instead give a more natural adaptive approach for…

All reinforcement learning algorithms must handle the trade-off between exploration and exploitation. Many state-of-the-art deep reinforcement learning methods use noise in the action selection, such as Gaussian noise in policy gradient…

机器学习 · 计算机科学 2018-04-05 Trevor Barron , Oliver Obst , Heni Ben Amor

Exploration policies in Bayesian bandits maximize the average reward over problem instances drawn from some distribution $\mathcal{P}$. In this work, we learn such policies for an unknown distribution $\mathcal{P}$ using samples from…

机器学习 · 计算机科学 2020-06-11 Craig Boutilier , Chih-Wei Hsu , Branislav Kveton , Martin Mladenov , Csaba Szepesvari , Manzil Zaheer

Bayesian inverse reinforcement learning (IRL) methods are ideal for safe imitation learning, as they allow a learning agent to reason about reward uncertainty and the safety of a learned policy. However, Bayesian IRL is computationally…

机器学习 · 计算机科学 2019-12-11 Daniel S. Brown , Scott Niekum

Reinforcement learning studies how to balance exploration and exploitation in real-world systems, optimizing interactions with the world while simultaneously learning how the world operates. One general class of algorithms for such learning…

机器学习 · 统计学 2018-08-10 Iñigo Urteaga , Chris H. Wiggins

Exploration is essential for reinforcement learning (RL). To face the challenges of exploration, we consider a reward-free RL framework that completely separates exploration from exploitation and brings new challenges for exploration…

机器学习 · 计算机科学 2020-12-11 Chuheng Zhang , Yuanying Cai , Longbo Huang , Jian Li

The practical application of learning agents requires sample efficient and interpretable algorithms. Learning from behavioral priors is a promising way to bootstrap agents with a better-than-random exploration policy or a safe-guard against…

人工智能 · 计算机科学 2022-07-08 Shivansh Beohar , Andrew Melnik

We introduce Random Reward Perturbation (RRP), a novel exploration strategy for reinforcement learning (RL). Our theoretical analyses demonstrate that adding zero-mean noise to environmental rewards effectively enhances policy diversity…

机器学习 · 计算机科学 2025-06-11 Haozhe Ma , Guoji Fu , Zhengding Luo , Jiele Wu , Tze-Yun Leong

Typical models of learning assume incremental estimation of continuously-varying decision variables like expected rewards. However, this class of models fails to capture more idiosyncratic, discrete heuristics and strategies that people and…

机器学习 · 计算机科学 2024-02-27 Carlos G. Correa , Thomas L. Griffiths , Nathaniel D. Daw

Distributional Reinforcement Learning (RL) maintains the entire probability distribution of the reward-to-go, i.e. the return, providing more learning signals that account for the uncertainty associated with policy performance, which may be…

机器学习 · 计算机科学 2021-03-24 Luchen Li , A. Aldo Faisal

Reinforcement learning with sparse rewards is still an open challenge. Classic methods rely on getting feedback via extrinsic rewards to train the agent, and in situations where this occurs very rarely the agent learns slowly or cannot…

机器学习 · 计算机科学 2022-03-04 Simone Parisi , Davide Tateo , Maximilian Hensel , Carlo D'Eramo , Jan Peters , Joni Pajarinen

A major challenge in reinforcement learning is exploration, when local dithering methods such as epsilon-greedy sampling are insufficient to solve a given task. Many recent methods have proposed to intrinsically motivate an agent to seek…

机器学习 · 计算机科学 2021-01-15 Riley Simmons-Edler , Ben Eisner , Daniel Yang , Anthony Bisulco , Eric Mitchell , Sebastian Seung , Daniel Lee

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

Intrinsic motivation and reward shaping guide reinforcement learning (RL) agents by adding pseudo-rewards, which can lead to useful emergent behaviors. However, they can also encourage counterproductive exploits, e.g., fixation with noisy…

机器学习 · 计算机科学 2025-03-25 Aly Lidayan , Michael Dennis , Stuart Russell

For many reinforcement learning (RL) applications, specifying a reward is difficult. This paper considers an RL setting where the agent obtains information about the reward only by querying an expert that can, for example, evaluate…

机器学习 · 计算机科学 2022-02-01 David Lindner , Matteo Turchetta , Sebastian Tschiatschek , Kamil Ciosek , Andreas Krause

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