user: text: Write a concise one-sentence TLDR summary of the scientific paper content below.

Title: Self-Attentional Credit Assignment for Transfer in Reinforcement Learning

Paper content:
The ability to transfer knowledge to novel environments and tasks is a sensible desiderata for general learning agents.
Despite the apparent promises, transfer in RL is still an open and little exploited research area.
In this paper, we take a brand-new perspective about transfer: we suggest that the ability to assign credit unveils structural invariants in the tasks that can be transferred to make RL more sample efficient.
Our main contribution is Secret, a novel approach to transfer learning for RL that uses a backward-view credit assignment mechanism based on a self-attentive architecture.
Two aspects are key to its generality: it learns to assign credit as a separate offline supervised process and exclusively modifies the reward function.
Consequently, it can be supplemented by transfer methods that do not modify the reward function and it can be plugged on top of any RL algorithm.
To some, intelligence is measured as the capability of transferring knowledge to unprecedented situations.
While the notion of intellect itself is hard to define, the ability to reuse learned information is a desirable trait for learning agents.
The coffee test (Goertzel et al., 2012) , presented as a way to assess general intelligence, suggests the task of making coffee in a completely unfamiliar kitchen.
It requires a combination of advanced features (planning, control and exploration) that would make the task very difficult if not out of scope for the current state-of-the-art Reinforcement Learning (RL) agents to learn.
On the other hand, it is solved trivially by humans, who exploit the universally invariant structure of coffee-making: one needs to fetch a mug, find coffee, power the coffee machine, add water and launch the brewing process by pushing the adequate buttons.
Thus, to solve the coffee test, transfer learning appears necessary.
Were we to possess a random kitchen simulator and a lot of compute, current transfer methods would still fall short of consistently reusing structural information about the task, hence also falling short of efficient adaptation.
Credit assignment, which in RL refers to measuring the individual contribution of actions to future rewards, is by definition about understanding the structure of the task.
By structure, we mean the relations between elements of the states, actions and environment rewards.
In this work, we investigate what credit assignment can bring to transfer.
Encouraged by recent successes in transfer based on supervised methods, we propose to learn to assign credit through a separate supervised problem and transfer credit assignment capabilities to new environments.
By doing so, we aim at recycling structural information about the underlying task.
To this end, we introduce SECRET (SElf-attentional CREdit assignment for Transfer), a transferable credit assignment mechanism consisting of a self-attentive sequence-to-sequence model whose role is to reconstruct the sequence of rewards from a trajectory of agent-environment interactions.
It assigns credit for future reward proportionally to the magnitude of attention paid to past state-action pairs.
SECRET can be used to incorporate structural knowledge in the reward function without modifying optimal behavior, as we show in various generalization and transfer scenarios that preserve the structure of the task.
Existing backward-view credit assignment methods (Arjona-Medina et al., 2019; Hung et al., 2018) require to add auxiliary terms to the loss function used to train agents, which can have detrimental effects to the learning process (de Bruin et al., 2018) , and rely on an external memory, which hinder the generality of their approach.
SECRET does neither.
Also, as we show in Sec. 3.1, the architecture we consider for SECRET has interesting properties for credit assignment.
We elaborate about our novelty with respect to prior work in Sec. 4.
We insist on the fact that the focus of our work is on transfer and that it is not our point to compete on credit assignment capabilities.
We would like to emphasize several aspects about the generality of SECRET:
1) our method does not require any modification to the RL algorithm used to solve the tasks considered,
2) it does not require any modification to the agent architecture either and
3) it does not alter the set of optimal policies we wish to attain.
Moreover, our method for credit assignment is offline, and as a result, it can use interaction data collected by any mean (expert demonstrations, replay memories (Lin, 1992) , backup agent trajectories.
. . ). We believe that this feature is of importance for real-world use cases where a high number of online interactions is unrealistic but datasets of interactions exist as a byproduct of experimentation.
Background We place ourselves in the classical Markov Decision Process (MDP) formalism (Puterman, 1994 ).
An MDP is a tuple (S, A, γ, R, P ) where S is a state space, A is an action space, γ is a discount factor (γ ∈ [0, 1)), R : S × A × S → R is a bounded reward function that maps state-action pairs to the expected reward for taking such an action in such a state.
Note that we choose a form that includes the resulting state in the definition of the reward function over the typical R : S × A → R. This is for consistency with objects defined later on.
Finally, P : S × A → ∆ S is a Markovian transition kernel that maps state-action pairs to a probability distribution over resulting states, ∆ S denoting the simplex over S.
An RL agent interacts with an MDP at a given timestep t by choosing an action a t ∈ A and receiving a resulting state s t+1 ∼ P (·|s t , a t ) and a reward r t = R(s t , a t , s t+1 ) from the environment.
A trajectory τ = (s i , a i , r i ) i=1,...,T is a set of state-action pairs and resulting rewards accumulated in an episode.
A subtrajectory is a portion of trajectory that starts at the beginning of the episode.
The performance of an agent is evaluated by its expected discounted cumulative reward E ∞ t=0 γ t r t .
In a partially observable MDP (POMDP), the agent receives at each timestep t an observation o t ∼ O(·|s t ) that contains partial information about the underlying state of the environment.
2 SECRET: SELF-ATTENTIONAL CREDIT ASSIGNMENT FOR TRANSFER SECRET uses previously collected trajectories from environments in a source distribution.
A selfattentive sequence model is trained to predict the final reward in subtrajectories from the sequence of observation-action pairs.
The distribution of attention weights from correctly predicted nonzero rewards is viewed as credit assignment.
In target environments, the model gets applied to a small set of trajectories.
We use the credit assigned to build a denser and more informative reward function that reflects the structure of the (PO)MDP.
The case where the target distribution is identical to the source distribution (in which we use held-out environments to assess transfer) will be referred to as generalization or in-domain transfer, as opposed to out-of-domain transfer where the source and the target distributions differ.
In this work, we investigated the role credit assignment could play in transfer learning and came up with SECRET, a novel transfer learning method that takes advantage of the relational properties of self-attention and transfers credit assignment instead of policy weights.
We showed that SECRET led to improved sample efficiency in generalization and transfer scenarios in non-trivial gridworlds and a more complex 3D navigational task.
To the best of our knowledge, this is the first line of work in the exciting direction of credit assignment for transfer.
We think it would be worth exploring how SECRET could be incorporated into online reinforcement learning methods and leave this for future work.

assistant: text: Secret is a transfer method for RL based on the transfer of credit assignment.