Skip to content
naulon
Not checkedNot checked for notices yet.

Meta-Learning via Weighted Gradient Update

Zhixiong Xu, Lei Cao, Xiliang Chen

IEEE Access · 2019

doi:10.1109/access.2019.2933988 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Despite deep reinforcement learning has attained performance beyond human beings in many domains, including games, dialogue systems and robotics, sample inefficient is still a limitation in the application of deep reinforcement learning. This paper develops a novel and simple gradient-based meta learning method suitable for improving learning efficiency of deep reinforcement learning methods. Rather than designing complex network or adding excessive fine tuning parameters, the proposed method is simple and does not introduce any learned parameters for meta learning. Specifically, according to the characteristic of different trajectories, this paper proposes to weight every trajectory in model-agnostic meta-learning for meta updating gradient effectively. The key idea underlying this method is to take advantage of the relationship between different trajectories and the direction of parameter update. Additionally, an end-to-end training approach is also introduced so that the proposed model can attain good results with a small amount of training data on new tasks. The statistical results of the experiments indicate that the proposed algorithm delivers state-of-the-art performance on both discrete and continuous control tasks.

Abstract licence: CC BY-NC-ND

References33

    33 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.