中文
相关论文

相关论文: Scalable Online Exploration via Coverability

200 篇论文

Large Language Models (LLMs) can self-improve through reinforcement learning, where they generate trajectories to explore and discover better solutions. However, this exploration process is computationally expensive, often forcing current…

机器学习 · 计算机科学 2025-10-01 Ziniu Li , Congliang Chen , Tianyun Yang , Tian Ding , Ruoyu Sun , Ge Zhang , Wenhao Huang , Zhi-Quan Luo

Offline Reinforcement Learning (RL) aims to learn a near-optimal policy from a fixed dataset of transitions collected by another policy. This problem has attracted a lot of attention recently, but most existing methods with strong…

机器学习 · 计算机科学 2023-05-23 Germano Gabbianelli , Gergely Neu , Nneka Okolo , Matteo Papini

The exploration--exploitation trade-off in reinforcement learning (RL) is a well-known and much-studied problem that balances greedy action selection with novel experience, and the study of exploration methods is usually only considered in…

机器学习 · 计算机科学 2022-10-13 Jonathan C Balloch , Julia Kim , and Jessica L Inman , Mark O Riedl

We study the problem of deployment efficient reinforcement learning (RL) with linear function approximation under the \emph{reward-free} exploration setting. This is a well-motivated problem because deploying new policies is costly in…

机器学习 · 计算机科学 2023-02-23 Dan Qiao , Yu-Xiang Wang

Model-based reinforcement learning (RL) is appealing because (i) it enables planning and thus more strategic exploration, and (ii) by decoupling dynamics from rewards, it enables fast transfer to new reward functions. However, learning an…

Collaborative multi-agent exploration of unknown environments is crucial for search and rescue operations. Effective real-world deployment must address challenges such as limited inter-agent communication and static and dynamic obstacles.…

机器人学 · 计算机科学 2024-12-31 Gabriele Calzolari , Vidya Sumathy , Christoforos Kanellakis , George Nikolakopoulos

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

This paper is an initial endeavor to bridge the gap between powerful Deep Reinforcement Learning methodologies and the problem of exploration/coverage of unknown terrains. Within this scope, MarsExplorer, an openai-gym compatible…

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

Sequential decision making using Markov Decision Process underpins many realworld applications. Both model-based and model free methods have achieved strong results in these settings. However, real-world tasks must balance reward…

机器学习 · 计算机科学 2026-04-01 Janaka Chathuranga Brahmanage , Akshat Kumar

We investigate robustness to strong data corruption in offline sparse reinforcement learning (RL). In our setting, an adversary may arbitrarily perturb a fraction of the collected trajectories from a high-dimensional but sparse Markov…

机器学习 · 统计学 2026-05-13 Nam Phuong Tran , Andi Nika , Goran Radanovic , Long Tran-Thanh , Debmalya Mandal

Curiosity has established itself as a powerful exploration strategy in deep reinforcement learning. Notably, leveraging expected future novelty as intrinsic motivation has been shown to efficiently generate exploratory trajectories, as well…

机器学习 · 计算机科学 2023-11-29 Marco Bagatella , Georg Martius

Exploration bonuses in reinforcement learning guide long-horizon exploration by defining custom intrinsic objectives. Several exploration objectives like count-based bonuses, pseudo-counts, and state-entropy maximization are non-stationary…

机器学习 · 计算机科学 2024-04-24 Roger Creus Castanyer , Joshua Romoff , Glen Berseth

In tabular Markov decision processes (MDPs) with perfect state observability, each trajectory provides active samples from the transition distributions conditioned on state-action pairs. Consequently, accurate model estimation depends on…

机器学习 · 计算机科学 2026-02-25 Xihe Gu , Urbashi Mitra , Tara Javidi

We analyze the problem of using Explore-Exploit techniques to improve precision in multi-result ranking systems such as web search, query autocompletion and news recommendation. Adopting an exploration policy directly online, without…

机器学习 · 计算机科学 2015-04-30 Dragomir Yankov , Pavel Berkhin , Lihong Li

Multi-objective Markov decision processes are a special kind of multi-objective optimization problem that involves sequential decision making while satisfying the Markov property of stochastic processes. Multi-objective reinforcement…

机器学习 · 计算机科学 2023-08-22 Sherif Abdelfattah , Kathryn Kasmarik , Jiankun Hu

We present a new approach for efficient exploration which leverages a low-dimensional encoding of the environment learned with a combination of model-based and model-free objectives. Our approach uses intrinsic rewards that are based on the…

机器学习 · 计算机科学 2022-04-18 Ruo Yu Tao , Vincent François-Lavet , Joelle Pineau

Effective exploration is a key challenge in reinforcement learning for large language models: discovering high-quality trajectories within a limited sampling budget from the vast natural language sequence space. Existing methods face…

机器学习 · 计算机科学 2026-02-17 Yiran Guo , Zhongjian Qiao , Yingqi Xie , Jie Liu , Dan Ye , Ruiqing Zhang , Shuang Qiu , Lijie Xu

In continuous control, exploration is often performed through undirected strategies in which parameters of the networks or selected actions are perturbed by random noise. Although the deep setting of undirected exploration has been shown to…

机器学习 · 计算机科学 2022-10-04 Baturay Saglam , Suleyman S. Kozat

We introduce the community exploration problem that has many real-world applications such as online advertising. In the problem, an explorer allocates limited budget to explore communities so as to maximize the number of members he could…

机器学习 · 计算机科学 2018-11-20 Xiaowei Chen , Weiran Huang , Wei Chen , John C. S. Lui