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

Title: ProMP: Proximal Meta-Policy Search

Paper content:
Credit assignment in Meta-reinforcement learning (Meta-RL) is still poorly understood.
Existing methods either neglect credit assignment to pre-adaptation behavior or implement it naively.
This leads to poor sample-efficiency during meta-training as well as ineffective task identification strategies.
This paper provides a theoretical analysis of credit assignment in gradient-based Meta-RL.
Building on the gained insights we develop a novel meta-learning algorithm that overcomes both the issue of poor credit assignment and previous difficulties in estimating meta-policy gradients.
By controlling the statistical distance of both pre-adaptation and adapted policies during meta-policy search, the proposed algorithm endows efficient and stable meta-learning.
Our approach leads to superior pre-adaptation policy behavior and consistently outperforms previous Meta-RL algorithms in sample-efficiency, wall-clock time, and asymptotic performance.
A remarkable trait of human intelligence is the ability to adapt to new situations in the face of limited experience.
In contrast, our most successful artificial agents struggle in such scenarios.
While achieving impressive results, they suffer from high sample complexity in learning even a single task, fail to generalize to new situations, and require large amounts of additional data to successfully adapt to new environments.
Meta-learning addresses these shortcomings by learning how to learn.
Its objective is to learn an algorithm that allows the artificial agent to succeed in an unseen task when only limited experience is available, aiming to achieve the same fast adaptation that humans possess (Schmidhuber, 1987; Thrun & Pratt, 1998) .Despite
recent progress, deep reinforcement learning (RL) still relies heavily on hand-crafted features and reward functions as well as engineered problem specific inductive bias. Meta-RL
aims to forego such reliance by acquiring inductive bias in a data-driven manner. Recent
work proves this approach to be promising, demonstrating that Meta-RL allows agents to obtain a diverse set of skills, attain better exploration strategies, and learn faster through meta-learned dynamics models or synthetic returns BID8 Xu et al., 2018; BID14 Saemundsson et al., 2018) .Meta-RL
is a multi-stage process in which the agent, after a few sampled environment interactions, adapts its behavior to the given task. Despite
its wide utilization, little work has been done to promote theoretical understanding of this process, leaving Meta-RL grounded on unstable foundations. Although
the behavior prior to the adaptation step is instrumental for task identification, the interplay between pre-adaptation sampling and posterior performance of the policy remains poorly understood. In fact,
prior work in gradient-based Meta-RL has either entirely neglected credit assignment to the pre-update distribution BID9 or implemented such credit assignment in a naive way BID10 Stadie et al., 2018) .To our knowledge
, we provide the first formal in-depth analysis of credit assignment w.r.t. preadaptation sampling distribution in Meta-RL. Based on our findings
, we develop a novel Meta-RL algorithm. First, we analyze two
distinct methods for assigning credit to pre-adaptation behavior.of MAML, was first introduced by BID9 . We refer to it as formulation
I which can be expressed as maximizing the objective DISPLAYFORM0 In that U denotes the update function which depends on the task T , and performs one VPG step towards maximizing the performance of the policy in T . For national brevity and conciseness
we assume a single policy gradient adaptation step. Nonetheless, all presented concepts
can easily be extended to multiple adaptation steps.Later work proposes a slightly different notion of gradient-based Meta-RL, also known as E-MAML, that attempts to circumvent issues with the meta-gradient estimation in MAML BID10 Stadie et al., 2018) : DISPLAYFORM1 R(τ ) with θ := U (θ, τ 1: DISPLAYFORM2 Formulation II views U as a deterministic function that depends on N sampled trajectories from a specific task. In contrast to formulation I, the expectation
over pre-update trajectories τ is applied outside of the update function. Throughout this paper we refer to π θ as pre-update
policy, and π θ as post-update policy.
In this paper we propose a novel Meta-RL algorithm, proximal meta-policy search (ProMP), which fully optimizes for the pre-update sampling distribution leading to effective task identification.
Our method is the result of a theoretical analysis of gradient-based Meta-RL formulations, based on which we develop the low variance curvature (LVC) surrogate objective that produces low variance meta-policy gradient estimates.
Experimental results demonstrate that our approach surpasses previous meta-reinforcement learning approaches in a diverse set of continuous control tasks.
Finally, we underpin our theoretical contributions with illustrative examples which further justify the soundness and effectiveness of our method.

assistant: text: A novel and theoretically grounded meta-reinforcement learning algorithm