Debugging using Orthogonal Gradient Descent
Not on the map. Why?
Abstract (arXiv)
In this report we consider the following problem: Given a trained model that is partially faulty, can we correct its behaviour without having to train the model from scratch? In other words, can we ``debug" neural networks similar to how we address bugs in our mathematical models and standard computer code. We base our approach on the hypothesis that debugging can be treated as a two-task continual learning problem. In particular, we employ a modified version of a continual learning algorithm called Orthogonal Gradient Descent (OGD) to demonstrate, via two simple experiments on the MNIST dataset, that we can in-fact textitunlearn the undesirable behaviour while retaining the general performance of the model, and we can additionally textitrelearn the appropriate behaviour, both without having to train the model from scratch.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 12 references that are in the map. First posted on arXiv 17 Jun 2022.
Builds on
9 of 12 references.
References · 9
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2019Machine Unlearningcited by 1,020
- 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 599
- 2019Certified Data Removal from Machine Learning Modelscited by 512
- 2019Making AI Forget You: Data Deletion in Machine Learningcited by 447
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
- 2021Remember What You Want to Forget: Algorithms for Machine Unlearningcited by 360
- 2016A Kronecker-factored approximate Fisher matrix for convolution layerscited by 138
- 2020Formalizing Data Deletion in the Context of the Right to be Forgottencited by 46
Built on by
Not cited yet.