Research
On-device research index

arXiv research

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.

168,657 papers · 148 categories

Trend · papers per month

3877741,1601,547 · Jun 202019922001200920172026
48 results for Multi-task Reinforcement Learning

Reliable and effective multi-task learning is a prerequisite for the development of robotic agents that can quickly learn to accomplish related, everyday tasks. However, in the reinforcement learning domain, multi-task learning has not exhibited the same level of success as in other domains, such as computer vision. In…

2018-02-03abs ↗pdf ↗

This work extends HiP-MDPs to robust state abstractions for multi-task and meta-reinforcement learning.

problem Limited observability of state in HiP-MDPs for real-world scenarios with rich observation spaces.
method Inspired by Block MDPs, the work extends HiP-MDPs to enable robust state abstractions for multi-task and meta-reinforcement learning.
result Transfer and generalization bounds based on task and state similarity, and sample complexity bounds that depend on the aggregate number of samples across tasks.

Transferring knowledge across a sequence of reinforcement-learning tasks is challenging, and has a number of important applications. Though there is encouraging empirical evidence that transfer can improve performance in subsequent reinforcement-learning tasks, there has been very little theoretical analysis. In this p…

2013-09-26abs ↗pdf ↗

Multi-task Inverse Reinforcement Learning (IRL) is the problem of inferring multiple reward functions from expert demonstrations. Prior work, built on Bayesian IRL, is unable to scale to complex environments due to computational constraints. This paper contributes a formulation of multi-task IRL in the more computation…

2018-05-22abs ↗pdf ↗

Sharing knowledge between tasks is vital for efficient learning in a multi-task setting. However, most research so far has focused on the easier case where knowledge transfer is not harmful, i.e., where knowledge from one task cannot negatively impact the performance on another task. In contrast, we present an approach…

2019-07-05abs ↗pdf ↗

This paper investigates multi-task reinforcement learning in non-Markovian decision making, showing benefits in sample efficiency.

problem Investigating multi-task reinforcement learning in non-Markovian decision making processes.
method Developed a joint model class for tasks and used the ηη-bracketing number to quantify complexity and similarity.
result Multi-task reinforcement learning can improve sample efficiency in non-Markovian decision making processes.

Soft modularization improves sample efficiency and performance in reinforcement learning.

problem Challenges in training multiple tasks jointly in reinforcement learning.
method Explicit modularization technique on policy representation, soft modularization method.
result Improves sample efficiency and performance over strong baselines in robotics manipulation tasks.

Adversarial online multi-task RL with task separation.

problem Minimize regret in an adversarial online multi-task setting with unknown MDPs.
method Prove minimax and instance-specific lower bounds, develop a clustering algorithm with optimal sample complexity and regret.
result Tight sample complexity and regret bounds for adversarial online multi-task RL.

While deep learning and deep reinforcement learning (RL) systems have demonstrated impressive results in domains such as image classification, game playing, and robotic control, data efficiency remains a major challenge. Multi-task learning has emerged as a promising approach for sharing structure across multiple tasks…

2020-01-19abs ↗pdf ↗

Unified view of federated learning and distributed RL using local stochastic approximation.

problem Finding the root of an operator composed of local operators in a network of agents with dependent data.
method Local stochastic approximation over a network of agents with Markov process-dependent data.
result Convergence rates of local stochastic approximation for both constant and time-varying step sizes, within a logarithmic factor of independent data.

Develops a new method to improve performance in multi-objective learning problems.

problem Gradient bias in multi-objective learning leading to degraded performance.
method Stochastic Multi-objective gradient Correction (MoCo) method that guarantees convergence without increasing batch size.
result Demonstrates effectiveness of MoCo method in simulations on multi-task learning.

Most reinforcement learning algorithms are inefficient for learning multiple tasks in complex robotic systems, where different tasks share a set of actions. In such environments a compound policy may be learnt with shared neural network parameters, which performs multiple tasks concurrently. However such compound polic…

2018-02-27abs ↗pdf ↗

REFIL learns from imagined sub-group interactions to improve multi-agent reinforcement learning.

problem Learning efficiency in multi-agent reinforcement learning settings.
method Randomized Entity-wise Factorization (REFIL) approach.
result REFIL outperforms all strong baselines in challenging multi-task StarCraft settings.

TOPPO improves PPO for MTRL by balancing critic gradients, outperforming SAC.

problem Critic-side gradient ill-conditioning in PPO for MTRL.
method Critic Balancing modules to improve gradient conditioning and balance task updates.
result TOPPO achieves stronger mean and tail-task performance than SAC-family and ARS-family baselines.

We tackle the Multi-task Batch Reinforcement Learning problem. Given multiple datasets collected from different tasks, we train a multi-task policy to perform well in unseen tasks sampled from the same distribution. The task identities of the unseen tasks are not provided. To perform well, the policy must infer the tas…

2019-09-25abs ↗pdf ↗

GDT improves reinforcement learning by matching future state information efficiently.

problem Efficient learning of multi-task policies from trajectory data.
method Generalized Decision Transformer (GDT) for offline hindsight information matching.
result GDT enables effective offline multi-task state-marginal matching and imitation learning.

While robot learning has demonstrated promising results for enabling robots to automatically acquire new skills, a critical challenge in deploying learning-based systems is scale: acquiring enough data for the robot to effectively generalize broadly. Imitation learning, in particular, has remained a stable and powerful…

2020-02-25abs ↗pdf ↗

MixTS uses a mixture prior to analyze Thompson Sampling in multi-task learning.

problem Analyzing Thompson Sampling in environments with uncertain and multi-class problems.
method Developed MixTS by incorporating a mixture prior into Thompson Sampling and using a novel proof technique for mixture distributions.
result Proved Bayes regret bounds for MixTS in linear bandits and finite-horizon reinforcement learning.

One of the key reasons for the high sample complexity in reinforcement learning (RL) is the inability to transfer knowledge from one task to another. In standard multi-task RL settings, low-reward data collected while trying to solve one task provides little to no signal for solving that particular task and is hence ef…

2020-02-26abs ↗pdf ↗

The reinforcement learning community has made great strides in designing algorithms capable of exceeding human performance on specific tasks. These algorithms are mostly trained one task at the time, each new task requiring to train a brand new agent instance. This means the learning algorithm is general, but each solu…

2018-09-12abs ↗pdf ↗

Proposes new stochastic algorithms for multi-objective optimization.

problem Multi-objective optimization in machine learning problems.
method Direction-oriented multi-objective formulation and Stochastic Direction-oriented Multi-objective Gradient descent (SDMGrad).
result Stochastic algorithms converge to Pareto stationary points with improved complexities.

We propose a novel framework for multi-task reinforcement learning (MTRL). Using a variational inference formulation, we learn policies that generalize across both changing dynamics and goals. The resulting policies are parametrized by shared parameters that allow for transfer between different dynamics and goal condit…

2019-06-21abs ↗pdf ↗

CUDC collects diverse data for offline RL by predicting future states.

problem Challenges in collecting task-agnostic data for offline RL.
method Adaptive temporal distances for curiosity-driven data collection.
result CUDC outperforms existing unsupervised methods in offline RL tasks.

Algorithm finds latent structure in value functions for improved reinforcement learning.

problem Finding latent structure in value functions for efficient reinforcement learning.
method Proposes a practical algorithm using two posterior distributions over state abstractions and abstract-state values.
result Substantial performance gains in multi-task settings where tasks share a common, low-dimensional representation.

This study investigates the use of reinforcement learning to guide a general purpose cache manager decisions. Cache managers directly impact the overall performance of computer systems. They govern decisions about which objects should be cached, the duration they should be cached for, and decides on which objects to ev…

2019-09-30abs ↗pdf ↗

In multi-task reinforcement learning there are two main challenges: at training time, the ability to learn different policies with a single model; at test time, inferring which of those policies applying without an external signal. In the case of continual reinforcement learning a third challenge arises: learning tasks…

2019-07-11abs ↗pdf ↗

We introduce a new reinforcement learning approach combining a planning quasi-metric (PQM) that estimates the number of steps required to go from any state to another, with task-specific "aimers" that compute a target state to reach a given goal. This decomposition allows the sharing across tasks of a task-agnostic mod…

2020-02-08abs ↗pdf ↗

Learning policies that generalize across multiple tasks is an important and challenging research topic in reinforcement learning and robotics. Training individual policies for every single potential task is often impractical, especially for continuous task variations, requiring more principled approaches to share and t…

2013-07-02abs ↗pdf ↗

One approach to deal with the statistical inefficiency of neural networks is to rely on auxiliary losses that help to build useful representations. However, it is not always trivial to know if an auxiliary task will be helpful for the main task and when it could start hurting. We propose to use the cosine similarity be…

2018-12-05abs ↗pdf ↗

Many real-world decision problems are characterized by multiple conflicting objectives which must be balanced based on their relative importance. In the dynamic weights setting the relative importance changes over time and specialized algorithms that deal with such change, such as a tabular Reinforcement Learning (RL) …

2018-09-20abs ↗pdf ↗

The paper develops a learning framework for diverse legged robots.

problem General and autonomous learning of core skills in locomotion.
method Data-efficient, off-policy multi-task RL algorithm with semantically identical reward functions.
result The same algorithm can learn diverse and reusable locomotion skills across different legged robots.