Cited by 39Reinforcement Learning in RoboticsDomain Adaptation and Few-Shot LearningAdaptive Dynamic Programming Control

Incremental Reinforcement Learning in Continuous Spaces via Policy Relaxation and Importance Weighting

Wang, Zhi, Li, Han-Xiong, Chen, Chunlin·2020·IEEE Transactions on Neural Networks and Learning Systems

Abstract

In this paper, a systematic incremental learning method is presented for reinforcement learning in continuous spaces where the learning environment is dynamic. The goal is to adjust the previously learned policy in the original environment to a new one incrementally whenever the environment changes. To improve the adaptability to the ever-changing environment, we propose a two-step solution incorporated with the incremental learning procedure: policy relaxation and importance weighting. First, the behavior policy is relaxed to a random one in the initial learning episodes to encourage a proper exploration in the new environment. It alleviates the conflict between the new information and the existing knowledge for a better adaptation in the long term. Second, it is observed that episodes receiving higher returns are more in line with the new environment, and hence contain more new information. During parameter updating, we assign higher importance weights to the learning episodes that contain more new information, thus encouraging the previous optimal policy to be faster adapted to a new one that fits in the new environment. Empirical studies on continuous controlling tasks with varying configurations verify that the proposed method achieves a significantly faster adaptation to various dynamic environments than the baselines.

Integrity signals

Registry

Crossref · 10.1109/tnnls.2019.2927320

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The universal applicability of incremental learning makes it occupy an important position in other machine learning fields, such as incremental transfer learning and incremental reinforcement learning.

    “The universal applicability of incremental learning makes it occupy an important position in the research of other machine learning fields, such as incremental transfer learning [102], incremental reinforcement learning [115], and so on.”

    From An Appraisal of Incremental Learning Methods (2020) · cites this paper as [115]

The citation lists haven’t been fetched yet

References 65 · Cited by 39

Authors
Wang, Z., Li, H.-X., & Chen, C.
Affiliations
  • Nanjing University (CN)
  • Central South University (CN)
Venue
IEEE Transactions on Neural Networks and Learning Systems
Published
2020-06
Volume
31
Issue
6
Pages
1870-1883
ISSN
  • 2162-237X (ISSN-L)
  • 2162-2388
OpenAlex
W2965407115
Cited by
39
References
65
Citations by year
2025: 4 · 2024: 6 · 2023: 12 · 2022: 6 · 2021: 8 · 2020: 3
FWCI
1.94
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Neural Networks and Learning Systems (publishedVersion)
  • PubMed (publishedVersion)
Funders
  • General Research Fund Project from the Research Grant Council of Hong Kong SAR (11210719)
  • Project from the City University of Hong Kong (7005092)
  • National Basic Research Program of China (2016YFD0702100)
  • Fundamental Research Funds for the Central Universities (011814380035)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Adaptive Dynamic Programming Control
Keywords
continuous action spaces, policy relaxation, importance weighting, dynamic environments, behavioral public policy, exploration, policy adaptation, continuous control

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review