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

Title: Information asymmetry in KL-regularized RL

Paper content:
Many real world tasks exhibit rich structure that is repeated across different parts of the state space or in time.
In this work we study the possibility of leveraging such repeated structure to speed up and regularize learning.
We start from the KL regularized expected reward objective which introduces an additional component, a default policy.
Instead of relying on a fixed default policy, we learn it from data.
But crucially, we restrict the amount of information the default policy receives, forcing it to learn reusable behaviors that help the policy learn faster.
We formalize this strategy and discuss connections to information bottleneck approaches and to the variational EM algorithm.
We present empirical results in both discrete and continuous action domains and demonstrate that, for certain tasks, learning a default policy alongside the policy can significantly speed up and improve learning.
Please watch the video demonstrating learned experts and default policies on several continuous control tasks ( https://youtu.be/U2qA3llzus8 ).
For many interesting reinforcement learning tasks, good policies exhibit similar behaviors in different contexts, behaviors that need to be modified only slightly or occasionally to account for the specific task at hand or to respond to information becoming available.
For example, a simulated humanoid in navigational tasks is usually required to walk -independently of the specific goal it is aiming for.
Similarly, an agent in a simulated maze tends to primarily move forward with occasional left/right turns at intersections.
This intuition has been explored across multiple fields, from cognitive science (e.g. BID22 to neuroscience and machine learning.
For instance, the idea of bounded rationality (e.g. BID46 ) emphasizes the cost of information processing and the presence of internal computational constraints.
This implies that the behavior of an agent minimizes the need to process information, and more generally trades off task reward with computational effort, resulting in structured repetitive patterns.
Computationally, these ideas can be modeled using tools from information and probability theory (e.g. BID50 BID32 BID47 BID40 BID33 BID49 , for instance, via constraints on the channel capacity between past states and future actions in a Markov decision process.
In this paper we explore this idea, starting from the KL regularized expected reward objective (e.g. BID51 BID52 BID19 BID36 BID23 BID48 , which encourages an agent to trade off expected reward against deviations from a prior or default distribution over trajectories.
We explore how this can be used to inject subjective knowledge into the learning problem by using an informative default policy that is learned alongside the agent policy This default policy encodes default behaviours that should be executed in multiple contexts in absence of addi-tional task information and the objective forces the learned policy to be structured in alignment with the default policy.To render this approach effective, we introduce an information asymmetry between the default and agent policies, preventing the default policy from accessing certain information in the state.
This prevents the default policy from collapsing to the agent's policy.
Instead, the default policy is forced to generalize across a subset of states, implementing a form of default behavior that is valid in the absence of the missing information, and thereby exerting pressure that encourages sharing of behavior across different parts of the state space.
FIG0 illustrates the proposed setup, with asymmetry imposed by hiding parts of the state from the default policy.
We investigate the proposed approach empirically on a variety of challenging problems including both continuous action problems such as controlling simulated high-dimensional physical embodied agents, as well as discrete action visual mazes.
We find that even when the agent and default policies are learned at the same time, significant speed-ups can be achieved on a range of tasks.
We consider several variations of the formulation, and discuss its connection to several ideas in the wider literature, including information bottleneck, and variational formulations of the EM algorithm for learning generative models.
In this work we studied the influence of learning the default policy in the KL-regularized RL objective.
Specifically we looked at the scenario where we enforce information asymmetry between the default policy and the main one.
In the continuous control, we showed empirically that in the case of sparse-reward tasks with complex walkers, there is a significant speed-up of learning compared to the baseline.
In addition, we found that there was no significant gain in dense-reward tasks and/or with simple walkers.
Moreover, we demonstrated that significant gains can be achieved in the discrete action spaces.
We provided evidence that these gains are mostly due to the information asymmetry between the agent and the default policy.
Best results are obtained when the default policy sees only a subset of information, allowing it to learn task-agnostic behaviour.
Furthermore, these default polices can be reused to significantly speed-up learning on new tasks.

assistant: text: Limiting state information for the default policy can improvement performance, in a KL-regularized RL framework where both agent and default policy are optimized together