Utility-based Perturbed Gradient Descent: An Optimizer for Continual Learning

Mohamed Elsayed, A. Rupam Mahmood
2/7/2023
cs.LGcs.AI

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

Modern representation learning methods often struggle to adapt quickly under non-stationarity because they suffer from catastrophic forgetting and decaying plasticity. Such problems prevent learners from fast adaptation since they may forget useful features or have difficulty learning new ones. Hence, these methods are rendered ineffective for continual learning. This paper proposes Utility-based Perturbed Gradient Descent (UPGD), an online learning algorithm well-suited for continual learning agents. UPGD protects useful weights or features from forgetting and perturbs less useful ones based on their utilities. Our empirical results show that UPGD helps reduce forgetting and maintain plasticity, enabling modern representation learning methods to work effectively in continual learning.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{elsayed2023utilitybased,
  title  = {Utility-based Perturbed Gradient Descent: An Optimizer for Continual Learning},
  author = {Mohamed Elsayed and A. Rupam Mahmood},
  year   = {2023},
  eprint = {2302.03281},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.03281v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.03281.svg)](https://codeofpaper.com/paper/2302.03281)

Discussion