Fisher-Orthogonal Projected Natural Gradient Descent for Continual Learning

Ishir Garg, Neel Kolhe, Andy Peng, Rohan Gopalam
1/19/2026
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Continual learning aims to enable neural networks to acquire new knowledge on sequential tasks. However, the key challenge in such settings is to learn new tasks without catastrophically forgetting previously learned tasks. We propose the Fisher-Orthogonal Projected Natural Gradient Descent (FOPNG) optimizer, which enforces Fisher-orthogonal constraints on parameter updates to preserve old task performance while learning new tasks. Unlike existing methods that operate in Euclidean parameter space, FOPNG projects gradients onto the Fisher-orthogonal complement of previous task gradients. This approach unifies natural gradient descent with orthogonal gradient methods within an information-geometric framework. We provide theoretical analysis deriving the projected update, describe efficient and practical implementations using the diagonal Fisher, and demonstrate strong results on standard continual learning benchmarks such as Permuted-MNIST, Split-MNIST, Rotated-MNIST, Split-CIFAR10, and Split-CIFAR100. Our code is available at https://github.com/ishirgarg/FOPNG.

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. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

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

Similar Papers

Cite this paper

@article{garg2026fisherorthogonal,
  title  = {Fisher-Orthogonal Projected Natural Gradient Descent for Continual Learning},
  author = {Ishir Garg and Neel Kolhe and Andy Peng and Rohan Gopalam},
  year   = {2026},
  eprint = {2601.12816},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.12816v2}
}

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/2601.12816.svg)](https://codeofpaper.com/paper/2601.12816)

Discussion