ONG: Orthogonal Natural Gradient Descent
Yajat Yadav, Patrick Mendoza, Jathin Korrapati

TL;DR
This paper introduces ONG, a novel continual learning method that integrates natural gradients with orthogonal projections to improve convergence and performance across tasks.
Contribution
It proposes the Orthogonal Natural Gradient Descent (ONG) algorithm, combining natural gradient preconditioning with orthogonal projections for continual learning.
Findings
Preliminary results on MNIST benchmarks show potential of ONG.
Naive combination of natural gradients and orthogonal projections has issues.
Future work aims to improve theoretical foundations and empirical validation.
Abstract
Orthogonal Gradient Descent (OGD) has emerged as a powerful method for continual learning. However, its Euclidean projections do not leverage the underlying information-geometric structure of the problem, which can lead to suboptimal convergence in learning tasks. To address this, we propose incorporating the natural gradient into OGD and present \textbf{ONG (Orthogonal Natural Gradient Descent)}. ONG preconditions each new task-specific gradient with an efficient EKFAC approximation of the inverse Fisher information matrix, yielding updates that follow the steepest descent direction under a Riemannian metric. To preserve performance on previously learned tasks, ONG projects these natural gradients onto the orthogonal complement of prior tasks' natural gradients. We provide an initial theoretical justification for this procedure, introduce the Orthogonal Natural Gradient Descent (ONG)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
