A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Develops HMRL for sparse reward RL problems, improving meta policy efficiency and transferability.
Action guidance helps agents learn true objectives in games with sparse rewards.
Reinforcement learning usually uses the feedback rewards of environmental to train agents. But the rewards in the actual environment are sparse, and even some environments will not rewards. Most of the current methods are difficult to get good performance in sparse reward or non-reward environments. Although using shap…
Dealing with sparse rewards is a longstanding challenge in reinforcement learning. The recent use of hindsight methods have achieved success on a variety of sparse-reward tasks, but they fail on complex tasks such as stacking multiple blocks with a robot arm in simulation. Curiosity-driven exploration using the predict…
The paper tackles reward-relevance in offline RL with sparse decision dynamics.
Transforming sparse outcomes into dense process rewards for efficient reinforcement learning.
New approach uses unlabeled prior data to accelerate exploration in sparse reward tasks.
Paper proposes RRD to learn proxy rewards for sparse delayed rewards in episodic reinforcement learning.
While recent progress in deep reinforcement learning has enabled robots to learn complex behaviors, tasks with long horizons and sparse rewards remain an ongoing challenge. In this work, we propose an effective reward shaping method through predictive coding to tackle sparse reward problems. By learning predictive repr…
Self-supervised reward prediction improves RL in sparse reward settings.
Imitation learning is an effective alternative approach to learn a policy when the reward function is sparse. In this paper, we consider a challenging setting where an agent and an expert use different actions from each other. We assume that the agent has access to a sparse reward function and state-only expert observa…
ETGL-DDPG improves DDPG for sparse reward control with new exploration and replay techniques.
A new EM framework for goal-conditioned RL improves performance on sparse reward tasks.
PixL2R maps natural language to pixel-based rewards for RL, improving sample efficiency.
A new reward shaping method balances learning efficiency and effectiveness for robot manipulation.
PlanGAN uses GANs to plan efficient trajectories for multi-goal tasks in sparse reward environments.
SAIL learns from sub-optimal demonstrations to improve sample efficiency in sparse reward tasks.
New RL agent learns sparse rewards efficiently.
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 shape reward function to guide policy optimization. This limits the applicability of…
New bandit algorithms improve sparse reward learning.
New RL method MAC improves performance in sparse reward settings.
We consider the problem of learning from sparse and underspecified rewards, where an agent receives a complex input, such as a natural language instruction, and needs to generate a complex response, such as an action sequence, while only receiving binary success-failure feedback. Such success-failure rewards are often …
The success of popular algorithms for deep reinforcement learning, such as policy-gradients and Q-learning, relies heavily on the availability of an informative reward signal at each timestep of the sequential decision-making process. When rewards are only sparsely available during an episode, or a rewarding feedback i…
We propose Scheduled Auxiliary Control (SAC-X), a new learning paradigm in the context of Reinforcement Learning (RL). SAC-X enables learning of complex behaviors - from scratch - in the presence of multiple sparse reward signals. To this end, the agent is equipped with a set of general auxiliary tasks, that it attempt…
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 learn at all. Similarly, if the agent receives also rewards that create suboptimal m…
This paper explores how environmental properties can simplify reinforcement learning in non-episodic settings.
Reinforcement Learning(RL) with sparse rewards is a major challenge. We propose \emph{Hindsight Trust Region Policy Optimization}(HTRPO), a new RL algorithm that extends the highly successful TRPO algorithm with \emph{hindsight} to tackle the challenge of sparse rewards. Hindsight refers to the algorithm's ability to l…
Successfully navigating a complex environment to obtain a desired outcome is a difficult task, that up to recently was believed to be capable only by humans. This perception has been broken down over time, especially with the introduction of deep reinforcement learning, which has greatly increased the difficulty of tas…
Align-RUDDER improves reinforcement learning with few demonstrations by redistributing rewards.
HyperX uses reward bonuses to enable efficient exploration in meta-learning.
Actor critic methods with sparse rewards in model-based deep reinforcement learning typically require a deterministic binary reward function that reflects only two possible outcomes: if, for each step, the goal has been achieved or not. Our hypothesis is that we can influence an agent to learn faster by applying an ext…
We propose Deep Q-Networks (DQN) with model-based exploration, an algorithm combining both model-free and model-based approaches that explores better and learns environments with sparse rewards more efficiently. DQN is a general-purpose, model-free algorithm and has been proven to perform well in a variety of tasks inc…
A framework helps reinforcement learning agents understand and decompose tasks from human demonstrations.
The most data-efficient algorithms for reinforcement learning in robotics are model-based policy search algorithms, which alternate between learning a dynamical model of the robot and optimizing a policy to maximize the expected return given the model and its uncertainties. However, the current algorithms lack an effec…
Exploration in environments with continuous control and sparse rewards remains a key challenge in reinforcement learning (RL). Recently, surprise has been used as an intrinsic reward that encourages systematic and efficient exploration. We introduce a new definition of surprise and its RL implementation named Variation…
BeBold improves exploration in sparse-reward tasks by regulating visitation counts.
Deep reinforcement learning has obtained significant breakthroughs in recent years. Most methods in deep-RL achieve good results via the maximization of the reward signal provided by the environment, typically in the form of discounted cumulative returns. Such reward signals represent the immediate feedback of a partic…
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 their state spaces; however, applying these techniques naively to the multi-age…
Many cooperative multiagent reinforcement learning environments provide agents with a sparse team-based reward, as well as a dense agent-specific reward that incentivizes learning basic skills. Training policies solely on the team-based reward is often difficult due to its sparsity. Furthermore, relying solely on the a…
TLRS improves predictive power of mined formulaic alpha factors.
Capsule Networks improve autonomous navigation in sparse environments.
ESPD improves learning efficiency in sparse reward reinforcement learning.
Sparse reward is one of the biggest challenges in reinforcement learning (RL). In this paper, we propose a novel method called Generative Exploration and Exploitation (GENE) to overcome sparse reward. GENE automatically generates start states to encourage the agent to explore the environment and to exploit received rew…
New conditions show proxy data can improve policy learning in sparse expert data contexts.
This paper proposes a new algorithm for learning guidance rewards in RL.
PRISM integrates diverse rewards in MORL, improving sample efficiency and Pareto coverage.
PopArt efficiently solves sparse linear bandits with tighter recovery guarantees.
The paper explores a Multi-Objective RL approach for trading that generalizes reward functions.