Meta-Reinforcement Learning with Self-Modifying Networks
Abstract
Deep Reinforcement Learning has demonstrated the potential of neural networks tuned with gradient descent for solving complex tasks in well-delimited environments.
However, these neural systems are slow learners producing specialized agents with no mechanism to continue learning beyond their training curriculum.
On the contrary, biological synaptic plasticity is persistent and manifold, and has been hypothesized to play a key role in executive functions such as working memory and cognitive flexibility, potentially supporting more efficient and generic learning abilities.
Inspired by this, we propose to build networks with dynamic weights, able to continually perform self-reflexive modification as a function of their current synaptic state and action-reward feedback, rather than a fixed network configuration.
The resulting model, MetODS (for Meta-Optimized Dynamical
Synapses) is a broadly applicable meta-reinforcement learning system able to learn efficient and powerful control rules in the agent policy space.
A single layer with dynamic synapses can perform one-shot learning, generalizes navigation principles to unseen environments and manifests a strong ability to learn adaptive motor policies.
Introduction
The algorithmic shift from hand-designed to learned features characterizing modern Deep Learning has been transformative for Reinforcement Learning (RL), allowing to solve complex problems ranging from video games [1, 2] to multiplayer contests [3] or motor control [4, 5].
Yet, "deep" RL has mostly produced specialized agents unable to cope with rapid contextual changes or tasks with novel or compositional structure [6–8].
The vast majority of models have relied on gradient-based optimization to learn static network parameters adjusted during a predefined curriculum, arguably preventing the emergence of online adaptivity.
A potential solution to this challenge is to meta-learn [9–11] computational mechanisms able to rapidly capture a task structure and automatically operate complex feedback control: Meta-Reinforcement Learning constitutes a promising direction to build more adaptive artificial systems [12] and identify key neuroscience mechanisms that endow humans with their versatile learning abilities [13].
In this work, we draw inspiration from biological fast synaptic plasticity, hypothesized to orchestrate flexible cognitive functions according to context-dependent rules [14–17].
By tuning neuronal selectivity at fast time scales – from fast neural signaling (milliseconds) to experience-based learning
(seconds and beyond) – fast plasticity can support in principle many cognitive faculties including motor and executive control.
From a dynamical system perspective, fast plasticity can serve as an efficient mechanism for information storage and manipulation and has led to modern theories of working memory [18–22].
Despite the fact that the magnitude of the synaptic gain variations may be small, such modifications are capable of profoundly altering the network transfer function [23] and constitute a plausible mechanism for rapidly converting reward and choice history into tuned neural functions [24].
From a machine learning perspective, despite having a long history [25–29], fast weights have most often been investigated in conjunction with recurrent neural activations [30–33] and rarely as a function of an external reward signal or of the current synaptic state itself.
Recently, new proposals have shown that models with dynamic modulation related to fast weights could yield powerful meta-reinforcement learners [34–36].
In this work, we explore an original self-referential update rule that allows the model to form synaptic updates conditionally on information present in its own synaptic memory.
Additionally, environmental reward is injected continually in the model as a rich feedback signal to drive the weight dynamics.
These features endow our model with a unique recursive control scheme, that support the emergence of a self-contained reinforcement learning program.
Contribution: We demonstrate that a neural network trained to continually self-modify its weights as a function of sensory information and its own synaptic state can produce a powerful reinforcement learning program.
The resulting general-purpose meta-RL agent called ’MetODS’ (for MetaOptimized Dynamical Synapses) is theoretically presented as a model-free approach performing stochastic feedback control in the policy space.
In our experimental evaluation, we investigate the reinforcement learning strategies implemented by the model and demonstrate that a single layer with lightweight parametrization can implement a wide spectrum of cognitive functions, from oneshot learning to continuous motor-control.
We hope that MetODS inspires more works around self-optimizing neural networks.
The remainder of the paper is organised as follows:
In Section 2 we introduce our mathematical formulation of the meta-RL problem, which motivates MetODS computational principles presented in Section 3.
In Section 4 we review previous approaches of meta-reinforcement learning and we discuss other models of artificial fast plasticity and their relation to associative memory.
In Section 5 we report experimental results in multiple contexts.
Finally, in Section 6 we summarise the main advantages of MetODS and outline future work directions.
Background 2.1 Notation
Throughout, we refer to “tasks" as Markov decision processes (MDP) defined by the following tuple τ = ( S , A , P , r, ρ 0 ) , where S and A are respectively the state and action sets, P : S×A×S (cid:55)→ [0 , 1] refers to the state transition distribution measure associating a probability to each tuple (state, action, new state), r : A × S (cid:55)→ R is a bounded reward function and ρ 0 is the initial state distribution.
For simplicity, we consider finite-horizon MDP with T time-steps although our discussion can be extended to the infinite horizon case as well as partially observed MDP.
We further specify notation when needed by subscripting symbols with the corresponding task τ or time-step t .
2.2 Meta-Reinforcement learning as an optimal transport problem:
Meta-Reinforcement learning considers the problem of building a program that generates a distribution µ π of policies π ∈ Π that are "adapted" for a distribution µ τ of task τ ∈ T with respect to a given metric R .
For instance, R ( τ, π ) can be the expected cumulative reward for a task τ and policy π , i.e where state transitions are governed by s t +1 ∼ P τ ( .
| s t , a t ) , actions are sampled according to the policy π : a t ∼ π and initial state s 0 follows the distribution ρ 0 ,τ .
Provided the existence of an optimal policy π ∗ for any task τ ∈ T , we can define the distribution measure µ π ∗ of these policies over Π .
Arguably, an ideal system aims at associating to any task τ its optimal policy π ∗ , i.e, finding the transport plan γ in the space Γ( µ T , µ π ∗ ) of coupling distributions with marginals µ T and µ π ∗ that maximizes R .
[Equation]
π
(cid:21)
where R ( τ, π ) =
E π, P τ
(cid:20) T (cid:88)
[Equation]
Most generally, problem (1) is intractable, since µ π ∗ is unknow or has no explicit form.
Instead, previous approaches optimize a surrogate problem, by defining a parametric specialization procedure which builds for any task τ , a sequence ( π t ) t of improving policies (see Fig. 1).
Defining θ some meta-parameters governing the evolution of the sequences ( π t ) t and µ θ ,τ,tπ the distribution measure of the policy π t after learning task τ during some period t , the optimization problem amounts to finding the meta-parameters θ that best adapt π t ∼ µ θ ,τ,tπ over the task distribution.
[Equation]
[Equation]
Equation (2) cast meta-Reinforcement learning as the problem of building automatic policy control in Π .
We discuss below desirable properties of such control for which we show that our proposed meta-learnt synaptic rule has a good potential.
⋄ Efficiency: How "fast" the distribution µ θ ,τ,tπ is transported towards a distribution of highperforming policies.
Arguably, an efficient learning mechanism should require few interaction steps t with the environment to identify the task rule and adapt its policy accordingly.
This can be seen as minimizing the agent’s cumulative regret during learning [37].
This notion is also connected to the policy exploration-exploitation trade-off [38, 39], where the agent learning program should foster rapid discovery of policy improvements while retaining performance gains acquired through exploration.
We show that our learnt synaptic update rule is able to change the agent transfer function drastically in a few updates, and settle to a policy when task structure has been identified, thus supporting one-shot learning of a task-contingent association rule in the Harlow task, adapting a motor policy in a few steps or exploring original environments quickly in the Maze experiment.
⋄ Capacity: That property defines the learner sensitivity to particular task structures and its ability to convert them into precise states in the policy space, which determines the achievable level of performance for a distribution of tasks µ τ .
This notion is linked to the sensitivity of the learner, i.e how the agent captures and retains statistics and structures describing a task.
Precedent work has shown that memory-based Meta-RL models operate a Bayesian task regression problem [40], and further fostering task identification through diverse regularizations [41, 42, 39] benefited performance of the optimized learning strategy.
Because our mechanism is continual, it allows for constant tracking of the environment information and policy update similar to memory-based models.
We particularly test this property in the maze experiment in Section 5, showing that tuned online synaptic updates obtain the best capacity under systematic variation of the environment.
⋄ Generality: We refer here to the overall ability of the meta-learnt policy flow to drive µ θ ,τ,tπ towards high-performing policy regions for a diverse set of tasks ( generic trainability ) but also to how general is the resulting reinforcement learning program and how well it transfers to tasks unseen during training ( transferability ).
In the former case.
since the proposed synaptic mechanism is model-free, it allows for tackling diverse types of policy learning, from navigation to motor control.
Arguably, to build reinforcing agents that learn in open situations, we should strive for generic and efficient computational mechanisms rather than learnt heuristics.
Transferability corresponds to the ability of the meta-learned policy flow to generally yield improving updates even in unseen policy regions of the space Π or conditioned by unseen task properties: new states, actions and transitions, new reward profile.
etc.
We show in a motor-control experiment using the Meta-World benchmark that meta-tuned synaptic updates are a potential candidate to produce a more systematic learner agnostic to environment setting and reward profile.
The generality property remains the hardest for current metaRL approaches, demonstrating the importance of building more stable and invariant control principles.
MetODS: Meta-Optimized Dynamical Synapses 3.1 Learning reflexive weights updates
What if a neural agent could adjust the rule driving the evolution of µ θ ,τ,tπ based on its own knowledge?
In this work, we test a neural computational model that learns to compress experience of a task τ into its dynamic weights W t .
[Equation]
Contrary to gradient-based rules whose analytical expression is a static and predefined function of activations error ( ∆( W t ) =
∂ a ∂ W .
∂
L ∂ a ), we define an update rule that directly depends on the current weight state through a parameterized non-linear recursive scheme, making the expression of the update much more sensitive to weight content itself.
[Equation]
This self-reflexive evolution of the synaptic configuration W t allows for online variation of the learning rule during adaptation for a given task τ and opens an original repertoire of dynamics for the policy evolution µ θ ,τ,tπ .
Specifically, at every time-step t , network inference and learning consists in recursive applications of read and write operations that we define below.
⋄ Read write operations: The core mechanism consists in two simple operations that respectively linearly project neurons activation v through the dynamic weights W followed by an element-wise non-linearity, and build a local weight update with element-wise weighting α :
[Equation]
write
[Equation]
Here, α is a matrix of R N × N , ⊗ denotes the outer-product, ⊙ is the element-wise multiplication, σ is a non-linear activation function.
The read and write operations are motivated by biological synaptic computation:
Reading corresponds to the non-linear response of the neuron population to a specific activation pattern.
Writing consists in an outer product that emulates a local Hebbian rule between neurons.
The element-wise weighting α allows locally tuning synaptic plasticity at every connection consistent with biology [43, 44] which generates a matrix update with potentially more than rank one
as
in the classic hebbian rule
⋄ Recursive update: While a
single iteration of these two operations can only retrieve a similar
activation
pattern (reading) or add unfiltered external
information
into weights (writing)
, recursively
applying these operations offers a much more potent computational
mechanism that
mix
information
between current neural
activation
and previous iterates.
Starting from an initial activation pattern v (0) and previous weight
state
W (
= W
t
−
1 , the model recursively applies equations (5) for s ∈ [1 , S ]
on v
( s )
and
W ( s ) such
that: for s ∈ [1 , S
[Equation]
Parameters κ ( l ) s and β ( l ) s are scalar values learnt along with plasticity parameters α , and correspond to delayed contributions of previous patterns and synaptic states to the current operations.
This is motivated by biological evidence of complex cascades of temporal modulation mechanisms over synaptic efficacy [45, 46].
Finally, ( v ( S ) , W ( S ) ) are respectively used as activation for the next layer, and as the new synaptic state W t .
⋄ Computational interpretation: We note that if S=1 in equation (6), the operation boils down to a simple hebbian update with a synapse-specific weighting α i,j .
This perspective makes MetODS an original form of modern Hopfield network [47] with hetero-associative memory that can dynamically access and edit stored representations driven by observations, rewards and actions.
While pattern retrieval from Hopfield networks has a dense litterature, our recursive scheme is an original proposal to learn automatic updates able to articulate representations across timesteps.
We believe that this mechanism is particularly benefitial for meta-RL to filter external information with respect to past experience.
The promising results shown in our experimental section suggest that such learnt updates can generate useful self-modifications to sequentially adapt to incoming information at runtime.
1: Require: θ = [ f , g , α , κ , β ] and W2: for 1 ≤ t ≤ T do 3: v (0)
← f ( s t , a t − 1 , r t − 1 ) 4:
W (0) ← W t −5: for 1 ≤ s ≤ S do 6: v ( s ) ← s − 1 (cid:80)
[Equation]
0 κ
[Equation]
l
[Equation]
s
[Equation]
l
[Equation]
s
[Equation] [Equation]
[Equation] [Equation]
8: end for 9: a t , v t ← g ( v ( s ) ) 10:
W t ← W ( s ) 11: end for
In this work, we test a single dynamic layer for MetODS and leave the extension of the synaptic plasticity to the full network for future work.
In order for the model to learn a credit assignment strategy, state transition and previous reward information [ s t , a t − 1 , r t − 1 ] are embedded into a vector v t by a feedforward map f as in previous meta-RL approaches [48, 49].
Action and advantage estimate are read-out by a feedforward policy map g .
We meta-learn the plasticity and update coefficients, as well as the embedding and read-out function altogether: θ =
[ f , g , α , κ , β ] .
Additionally, the initial synaptic configuration Wcan be learnt, fixed a priori or sampled from a specified distribution.
Related work
⋄ Meta-Reinforcement learning has recently flourished into several different approaches aiming at learning high-level strategies for capturing task rules and structures.
A direct line of work consists in automatically meta-learning components or parameters of the RL arsenal to improve over heuristic settings [50–52].
Orthogonally, work building on the Turing-completeness of recurrent neural networks has shown that simple recurrent neural networks can be trained to store past information in their persistent activity state to inform current decision, in such a way that the network implements a form of reinforcement learning over each episode [53, 48, 54].
It is believed that vanilla recurrent networks alone are not sufficient to meta-learn the efficient forms of episodic control found in biological agents [55, 13].
Hence additional work has tried to enhance the system with a better episodic memory model [56–58] or by modeling a policy as an attention module over an explicitely stored set of past events [49].
Optimization based approaches have tried to cast episodic adaptation as an explicit optimization procedure either by treating the optimizer as a black-box system [59, 60] or by learning a synaptic configuration such that one or a few gradient steps are sufficient to adapt the input/output mapping to a specific task [61].
⋄ Artificial fast plasticity: Networks with dynamic weights that can adapt as a function of neural activation have shown promising results over regular recurrent neural networks to handle sequential data [62, 29, 31, 63, 32, 34].
However, contrary to our work, these models postulate a persistent neural activity orchestrating weights evolution.
On the contrary, we show that synaptic states are the sole persistent components needed to perform fast adaptation.
Additionally, the possibility of optimizing synaptic dynamics with evolutionary strategies in randomly initialized networks [64] or through gradient descent [65] has been demonstrated, as well as in a time-continuous setting
Recent results have shown that plasticity rules differentially tuned at the synapse level allow to dynamically edit and query networks memory [31, 67].
However another specificity of this work is that our model synaptic rule is a function of reward and synaptic state, allowing to drive weight dynamics conditionally on both an external feedback signal and the current model belief.
⋄ Associative memory: As discussed above, efficient memory storage and manipulation is a crucial feature for building rapidly learning agents.
To improve over vanilla recurrent neural network policies [48], some models have augmented recurrent agents with content-addressable dictionaries able to reinstate previously encoded patterns given the current state [68–70, 13].
However these slot-based memory systems are subject to interference with incoming inputs and their memory cost grows linearly with experience.
Contrastingly, attractor networks can be learnt to produce fast compression of sensory information into a fixed size tensorial representation [71, 72].
One class of such network are Hopfield networks [73–76] which benefit from a large storage capacity [76], can possibly perform hetero-associative concept binding [77, 34] and produce fast and flexible information retrieval [47].
Experiments
In this section, we explore the potential of our meta-learnt synaptic update rule with respect to the three properties of the meta-RL problem exposed in section 2.
Namely, 1) efficiency , 2) capacity and 3) generality of the produced learning algorithm.
We compare it with three state-of-the-art meta-RL models based on different adaptation mechanisms: RL 2 [48] a memory-based algorithm based on training a GRU-cell to perform Reinforcement Learning within the hidden space of its recurrent unit, MAML [61] which performs online gradient descent on the weights of three-layer
MLP and PEARL [78], which performs probabilistic task inference for conditioning policy.
Details for each experimental setting are further discussed in S.I. and the code can be found at https: //github.com/mathieuchal/metods2022 .
5.1 Efficiency: One-shot reinforcement learning and rapid motor control
To first illustrate that learnt synaptic dynamics can support fast behavioral adaptation, we use a classic experiment from the neuroscience literature originally presented by Harlow [79] and recently reintroduced in artificial meta-RL in [54] as well as a heavily-benchmarked MuJoCo directional locomotion task (see Fig. 3).
To behave optimally in both settings, the agent must quickly identify the task rule and implement a relevant policy : The Harlow task consists of five sequential presentations of two random variables placed on a one-dimensional line with random permutation of their positions that an agent must select by reaching the corresponding position.
One value is associated with a positive reward and the other with a negative reward.
The five trials are presented in alternance with periods of fixation where the agent should return to a neutral position between items.
In the MuJoCo robotic Ant-dir experiment, a 4-legged agent must produce a locomotive policy given a random rewarded direction.
⋄ Harlow : Since values location are randomly permuted across presentations within one episode, the learner cannot develop a mechanistic strategy to reach high rewards based on initial position.
Instead, to reach the maximal expected reward over the episode, the agent needs to perform one-shot learning of the task-contingent association rule during the first presentation.
We found that even a very small network of N=20 neurons proved to be sufficient to solve the task perfectly.
We investigated the synaptic mechanism encoding the agent policy.
A principal component analysis reveals a policy differentiation with respect to the initial value choice outcome supported by synaptic specialization in only a few time-steps (see Figure 1-c).
We can further interpret this adaptation in terms of sharp modifications of the Hopfield energy of the dynamic weights (Figure 3-e).
Finally, the largest synaptic variations measured by the sum of absolute synaptic variations occur for states that carry a non-null reward signal (see S.I).
These results suggest that the recursive hebbian update combined with reward feedback is sufficient to support one-shot reinforcement learning of the task association rule.
⋄ MuJoCo
Ant-dir : We trained models for performing the task on an episode of 200 timesteps and found that MetODS can adapt in a few time-steps, similar to memory-based models such as RL 2 , (Figure 3-
f) thanks to its continual adaptation mechanism.
By design, MAML and PEARL do not present such a property, and they need multiple episodes before being able to perform adaptation correctly.
We still report MAML performance after running its gradient adaptation at timestep t=100.
We further note that our agent overall performance in a single episode is still superior to MAML performance reported in [61, 49] when more episodes are accessible for training.
5.2 Capacity : Maze exploration task
We further tested the systematicity of MetODS learnt reinforcement program on a partially observable
Markov decision process (POMDP): An agent must locate a target in a randomly generated maze while starting from random locations and observing a small portion of its environment (depicted in
Figure 4).
While visual navigation has been previously explored in meta-RL [48, 49, 31], we here focus on the mnemonic component of navigation by complexifying the task in two ways, we reduce the agent’s visual field to a small size of 3x3 pix.
and randomize the agent’s position after every reward encounter.
The agent can take discrete actions in the set { up,down,left,right } which moves it accordingly by one coordinate.
The agent’s reward signal is solely received by hitting the target location, thus receiving a reward of 10 .
Each time the agent hits the target, its position is randomly reassigned on the map (orange) and the exploration resumes until 100 steps are accumulated during which the agent must collect as much reward as possible.
Note that the reward is invisible to the agent, and thus the agent only knows it has hit the reward location because of the activation of the reward input.
The reduced observability of the environment and the sparsity of the reward signal (most of the state transitions yield no reward) requires the agent to perform logical binding between distant temporal events to navigate the maze.
Again, this setting rules out PEARL since its latent context encoding mechanism erases crucial temporal dependencies between state transitions for efficient exploration.
Despite having no particular inductive bias for efficient spatial exploration or path memorization, a strong policy emerges spontaneously from training.
Agent 1st rew.
∗ ( ↓ )
Success ( ↑ )
Cum.
Rew.
( ↑ )
Cum.
Rew (Larger) ( ↑ )
Random
[Figure]
8 ±
[Figure]
5 % 3.8 ±
[Figure] [Figure]
7 ±
[Figure]
MAML
[Figure]
±
[Figure]
[Figure] [Figure]
95 ±
[Figure] [Figure]
[Figure]
RL
[Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
MetODS
[Figure] [Figure]
[Figure] [Figure]
[Figure]
⋄ Ablation study and variations:
We explored the contribution of the different features combined in
MetODS update rule, showing that they all contribute to the final performance of our meta-learning model.
First, we tested the importance of the element-wise tuning of plasticity in weight-based learning models and note that while it adversely affects MAML gradient update, it greatly improves
MetODS performance, suggesting different forms of weights update.
Second, we verified that augmenting recursivity depth S was beneficial to performance, consistently with Harlow results.
Third, we noted that transforming the rightmost vector of the writing equation in 5 with a linear projection ( Linear in figure 4, see S.I for full experimental details) yields major improvement while non-linear ( MLP ) does not improve performance.
Finally, we additionally test the capability of the learnt navigation skills to generalize to a larger maze size of 10 × 10 pix.
unseen during training.
We show that MetODS is able to retain its advantage (see figure 4 and table 5 for results).
5.3 Generality : Motor control
Finally, we test the generality of the reinforcement learning program learnt by our model for different continuous control tasks:
MetaWorld:
First, we use the dexterous manipulation benchmark proposed in [81] using the benchmark suite [82], in which a Sawyer robot is tasked with diverse operations.
A full adaptation episode consists in N=10 rollouts of 500 timesteps of the same task across which dynamic weights are carried over.
Observation consists in the robot’s joint angles and velocities, and the actions are its joint torques.
We compare MetODS with baseline methods in terms of meta-training and meta-testing success rate for 3 settings, push, reach and ML-10 .
We show in Fig.
6 the meta-training results for all the methods in the MetaWorld environments.
Due to computational resource constraints, we restrict our experiment to a budget of 10M steps per run.
While we note that our benchmark does not reflect the final performance of previous methods reported in [81] at 300M steps, we note that MetODS test performance outperforms these methods early in training and keeps improving at 10M steps, potentially leaving room for improvement with additional training.
(see S.I for additional discussion).
Finally, we note that all tested approaches performed modestly on ML10 for test tasks, which highlights the limitation of current methods.
We conjecture that this might be due to the absence of inductive bias for sharing knowledge between tasks or fostering systematic exploration of the environment of the tested meta-learning algorithms.
Robot impairment: We also tested the robustness of MetODS learnt reinforcement programs by evaluating the agent ability to perform in a setting not seen during training: specifically, when partially impairing the agent motor capabilities.
We adopt the same experimental setting as section 5.1 for the Ant and Cheetah robots and evaluate the performance when freezing one of the robots torque.
We show that our model policy retains a better proportion of its performance compared to other approaches.
These results suggest that fast synaptic dynamics are not only better suited to support fast adaptation of a motor policy in the continuous domain, but also implement a more robust reinforcement learning program when impairing the agent motor capabilities.
Discussion
In this work, we introduce a novel meta-RL system, MetODS, which leverages a self-referential weight update mechanism for rapid specialization at the episodic level.
Our approach is generic and supports discrete and continuous domains, giving rise to a promising repertoire of skills such as oneshot adaptation, spatial navigation or motor coordination.
MetODS demonstrates that locally tuned synaptic updates whose form depends directly on the network configuration can be meta-learnt for solving complex reinforcement learning tasks.
We conjecture that further tuning the hyperparameters as well as combining MetODS with more sophisticated reinforcement learning techniques can boost its performance.
Generally, the success of the approach provides evidence for the benefits of fast plasticity in artificial neural networks, and the exploration of self-referential networks.
Broader Impact
Our work explores the emergence of reinforcement-learning programs through fast synaptic plasticity.
The proposed pieces of evidence that information memorization and manipulation as well as behavioral specialization can be supported by such computational principles 1) help question the functional role of such mechanisms observed in biology and 2) reaffirms that alternative paradigms to gradient descent might exists for efficient artificial neural network control.
Additionally, the proposed method is of interest for interactive machine learning systems that operates in quickly changing environments and under uncertainty (bayesian optimization, active learning and control theory).
For instance, the meta RL approach proposed in this work could be applied to brain-computer interfaces for tuning controllers to rapidly drifting neural signals.
Improving medical applications and robot control promises positive impact, however deeper theoretical understanding and careful deployment monitoring are required to avoid misuse.
Acknowledgments and Disclosure of Funding
This work was supported by ANR-3IA Artificial and Natural Intelligence Toulouse Institute (ANR19-PI3A-0004), OSCI-DEEP ANR (ANR-19-NEUC-0004), ONR (N00014-19-1-2029), and NSF (IIS-1912280 and EAR-1925481).
Additional support provided by the Carney Institute for Brain
Science and the Center for Computation and Visualization (CCV) via NIH Office of the Director grant S10OD025181.
The authors would like to thank the anonymous reviewers for their thorough comments and suggestions that led to an improved version of this work.
Optimization
Defining the weight parameters W of MetODS as dynamic variables lifts the optimization problem (2) into a functional space of control functions parameterized by θ .
Hence, meta-optimizing the control necessitates the estimation of gradients with respect to θ over the space T and for any possible trajectory π t in Π .
Interestingly, previous meta RL approaches have performed policy gradient optimization by sampling a single policy trajectory π t ∼ M θ ( τ ) over M multiple tasks, showing that it is sufficient to obtain correct gradient estimates on θ .
We proceed in the same way, by estimating the gradient policy update integrated over the space of tasks as mini-batches over tasks.
[Equation]
Additionally, the memory cost of storing synaptic weights trajectories instead of hidden activity in a network of N neurons is O ( N 2 ) instead of O ( N ) .
This might lead to prohibitively large memory requirements for training with BPTT [83] over long episodes.
We present in S.I an alternative solution to train the model through the discrete adjoint sensitivity method, leveraging the work of [84] yielding a memory cost of O (1) .
The agent’s log-policy total derivative with respect to θ can be computed as the solution of an augmented adjoint problem [67].
9.1 Gradient policy update
We define the evolution of the agent policy in task τ up to step T as the stochastic policy process ( π t ) t ≤ T in the space of policy Π with measure µ θ ,τ, 1 ··· T π and write ( W t ) t ≤ T the trajectory of weights, such that:
[Equation]
We also recall the definition of R ( τ, π ) as the average accumulated reward under the realisation of ( π t ) t ≤ T for task τ .
Then, The policy gradient update used to train MetODS can be written as the average gradient of θ with respect to µ T and µ θ ,τ, 1 ··· T π
[Equation]
Then for any t ≤ T , we can rewrite the gradient of the average, using the log-policy trick:
[Equation]
As specified in section 3.3, we do not sample over the policy distribution π t and probability transition
P τ to estimate the inner expectation in (11).
Instead, we rely on a single evaluation, which yield, combining (9) with (10):
[Equation]
By sampling over tasks, this last equation allows us to write the following gradient estimator
[Equation]
9.2 Discrete adjoint system
With the previous notation
[Equation]
let us define the total gradient function ∂ J ∂ θ as the gradient of our objective function:
[Equation]
To clarify
[Equation]
we shall introduce the intermediary cost notation:
[Equation]
and we note the following update equation
[Equation]
This identify a discrete dynamical system with finite sum and differentiable cost, whose gradient can be computed mediating the introduction of an adjoint dynamical system presented in section 2 of [84] .
Defining ( ν t ) t ≤ T the adjoint sequence, the general gradient equation can be computed as:
[Equation]
Applying formula (16) to MetODS yields the following gradient formula:
[Equation]
where ( ν t ) t ≤ T follows the following update rule backwards:
[Equation] [Equation]
Experiment details
General information: As specified in section 3 and 5 , we test a single model definition for all experiments in this work, with one layer of dynamic weights W t .
This layer consists in a dense matrix of size n ∈ N with learnt or random initialization.
Our model lightweight parametrization of the synaptic update rule makes it a very parameter efficient technique, which can perform batchcomputation and be ported to GPU hardware to accelerate training.
We refer readers to table 1 for specific details of each experiment presented in section 5.
In addition to this pdf file, we provide the code for training METODS agents in experiments presented in section 5 at https:/
F EATURE
[Figure]
E XPERIMENT
[Figure]
[ i
[Table]
[Figure] [Table] [Figure]
[Table]
[Figure]
n ] [ i ×
[Table]
[Figure]
[Table] [Table]
n ] [ i ×
[Table]
[Figure] [Table] [Figure]
[Table]
n ] [ i
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table] [Table]
[Figure]
[Table]
[Table] [Table]
[Table]
o ] [
[Table]
[Table] [Table]
[Table] [Figure]
[Table] [Table]
[Figure]
[Table]
[Figure] [Table]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
EARNED
[Table]
EARNED
[Figure]
EARNED #
[Table]
OF EPISODES
[Figure]
[Table]
Meta-training algorithm:
We show in our experiments, that the all meta-parameters θ =
[ α , κ , β , f , g , ] can be jointly optimized with two policy gradient algortihms.
We use policy gradient methods to meta-train the synaptic parameters: Advantage Actor-critic algorithm (A2C) [85] where we consider that temporal dependancies are crucial to solve the task, and we use PPO [86] as a sequential policy optimization over fixed rollouts for the motor control experiment.
Additionally, to reduce noise in policy gradient updates, we further show that it is possible to learn a dynamic advantage estimate of the Generalized Advantage Estimation (GAE) [87] and that we can meta-learn it as a second head of the MetODS layer output v ( s ) .
This fact confirms that tuned hebbian-updates are also a sufficient mechanism to keep track of a policy value estimate.
Plasticity parameters:
In all our experiments, α consists in a real-valued matrix of R n × n initialized with independent normal distribution N ( µ = 0 , σ = 1 e − 3) .
Similarly, multi-step weighting parameters ( κ ( l ) s ) l ≤ s and ( β ( l ) s ) l ≤ s can be stored as entries of triangular inferior matrices of R S × S and are initialized with N ( µ = 0 , σ = 1 e − 2) .
Embedding and read-out: At each time-steps, inputs to the feed-forward embedding function f consist in a concatenation of new observable/state s t as well as previous action and reward a t −and r t − 1 .
After adaptation procedure, policy is read-out from the last activation vector v ( S ) by a feed-forward function g which output statistics of a parameterized distribution in the action space (categorical with Softmax normalization in the discrete case or Gaussian in the continuous case).
Both input and output mappings f and g consist in 2-layer Perceptrons with dense connections initialized with orthogonal initialization and hyperbolic tangent non-linearities.
10.1 Harlow task
This experiment consists in a 1-dimensional simplification of the task presented in [54] and inspired from https://github.com/bkhmsi/Meta-RL-Harlow.
The action space is the discrete set {− 1 , 1 } moving the agent respectively to the left/right on a discretized line.
The state space consist inpositions while the agent receptive field is eight dimensional.
Values are placed at 3 positions from the fixation target position.
The fixation position yields a reward of 0.2 while the values are drawn uniformly from [[0 , 10]] and randomly associated with a reward of − 1 and 1 at the beginning of each episode.
The maximal duration for an episode is 250 steps, although the model solves the 5 trials in ∼ 35 steps on average.
Setting: We consider the directional rewards task proposed in [61] with the Ant and Cheetah robots, as a more complex test of rapid adaptation.
We apply standard RL practice for continuous control by parameterizing the stochastic policy as a product of independent normal distributions with fixed standard deviation σ = 0 .
1 and mean inferred by the agent network.
A training meta-episode consists in a single rollout of 200 steps with random sampling of the reward direction for each episode.
Robot impairment: We partially impaired the agent motor capabilities by "freezing" one of the robot actuator.
Namely we consistently passed a value of zero to the the right_back_leg in Ant (coordinate 8 in OpenAI Gym XML asset files) and ffoot in Cheetah (coordinate 6 in OpenAI
Gym
XML asset files).
Continual adaptation: Finally, we further investigated whether the adaptation mechanism was also adjustable after performing initial adaptation by testing trained agents over 5 consecutive episodes with randomly changing rewarded direction while retaining weight state across episodes.
We show in Fig 10 the average reward profile of the three meta-RL agents over 1000 test episodes, where
MetODS adapt faster and better with respect to reward variations.
10.3 Maze Navigation task
Maze generation: The maze environments are created following Prim’s algorithm [80] which randomly propagates walls on a board of N × N cells.
We additionally add walls to cell location were no walls has been created at any of the neighboring 8 cells to avoid null inputs to the agent.
The reward and agent locations are selected at random at the beginning of an episode.
The reward location does not change during the episode while the agent is restarting from a uniform random location after every encounter with reward.
Models capacity: In this experiment, since model memory capacity seems to directly impact final performance, we specifically control for the number of learnable parameters in order to compare models and fix a training budget of 10M env.
steps.
Since MAML does not have a continual adaptation mechanism, we perform gradient adaptation every 20 time-steps during an episode, in order to balance noisiness of the gradient and rapidity of exploration.
We show in
Table 2 the mean over 1000 episodes of the accumulated reward of agents trained on 8 × 8 mazes and tested on different maze sizes N ∈ (4 , 6 , 8 , 10 , 12) .
Agents performances are highly varying within a size setting due to differences in maze configurations and across maze sizes due to increasing complexity.
However, MetODS and RL 2 are able to generalize at least partially to these new settings (see table 2).
MetODS outperforms RL 2 in every setting, and generalizes better, retaining an advantage of up to 25% in accumulated reward in the biggest maze.
[Table]
Additionally, we investigated the selectivity of neurons of MetODS plastic weight layer with respect to spatial location, to investigate whether there could be emergence of activation patterns resembling those of grid cells found in the mammalian entorhinal cortex.
We measured the selectivity of each neuron for specific agent locations by measuring the average activation rate normalized by the number of agent passages in different maze configurations.
Interestingly, we found that without any explicit regularization, some neurons displayed sparse activation and consistent remapping between maps.
10.4 Meta-world
Experiments: In order to run experiments and baseline of MetaWorld [81], we used the training routines and functions offered in the python library GARAGE [82].
We ran two different types of experiments:
ML1 :
In this setting, we restrict the task distribution to a single type of robotic manipulation while varying the goal location.
The meta-training “tasks” corresponds to 50 random initial agent and goal positions, and meta-testing to 50 heldout positions.
We tested our model on the reach-v2 and push-v2 tasks.
ML10 : This set-up tests generalization to new manipulation tasks, the benchmark provides 10 training tasks and holds out 5 meta-testing tasks.
Training details: We used PPO [86] for training our model, with clip range r = 0 .
2 and 10 inner optimization steps maximum, for its good empirical performance and in order to compare with other methods with recurrent computation scheme.
We kept the experimental settings from the original paper with N=10 episodes of 500 time-steps and sampled proximal gradient update in a meta-batch size of 25 trajectories.
To estimate value function, we both tested a feedforward neural network trained at each iteration of the meta-training or an additional MetODS network, which resulted in similar training results.