Saved in:
Bibliographic Details
Main Authors: Li, Yuke, Zheng, Yujia, Xiong, Tianyi, Wang, Zhenyi, Huang, Heng
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2509.23027
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912633055084544
author Li, Yuke
Zheng, Yujia
Xiong, Tianyi
Wang, Zhenyi
Huang, Heng
author_facet Li, Yuke
Zheng, Yujia
Xiong, Tianyi
Wang, Zhenyi
Huang, Heng
contents Catastrophic interference, also known as catastrophic forgetting, is a fundamental challenge in machine learning, where a trained learning model progressively loses performance on previously learned tasks when adapting to new ones. In this paper, we aim to better understand and model the catastrophic interference problem from a latent representation learning point of view, and propose a novel theoretical framework that formulates catastrophic interference as an identification problem. Our analysis demonstrates that the forgetting phenomenon can be quantified by the distance between partial-task aware (PTA) and all-task aware (ATA) setups. Building upon recent advances in identifiability theory, we prove that this distance can be minimized through identification of shared latent variables between these setups. When learning, we propose our method \ourmeos with two-stage training strategy: First, we employ maximum likelihood estimation to learn the latent representations from both PTA and ATA configurations. Subsequently, we optimize the KL divergence to identify and learn the shared latent variables. Through theoretical guarantee and empirical validations, we establish that identifying and learning these shared representations can effectively mitigate catastrophic interference in machine learning systems. Our approach provides both theoretical guarantees and practical performance improvements across both synthetic and benchmark datasets.
format Preprint
id arxiv_https___arxiv_org_abs_2509_23027
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Understanding Catastrophic Interference: On the Identifibility of Latent Representations
Li, Yuke
Zheng, Yujia
Xiong, Tianyi
Wang, Zhenyi
Huang, Heng
Machine Learning
Catastrophic interference, also known as catastrophic forgetting, is a fundamental challenge in machine learning, where a trained learning model progressively loses performance on previously learned tasks when adapting to new ones. In this paper, we aim to better understand and model the catastrophic interference problem from a latent representation learning point of view, and propose a novel theoretical framework that formulates catastrophic interference as an identification problem. Our analysis demonstrates that the forgetting phenomenon can be quantified by the distance between partial-task aware (PTA) and all-task aware (ATA) setups. Building upon recent advances in identifiability theory, we prove that this distance can be minimized through identification of shared latent variables between these setups. When learning, we propose our method \ourmeos with two-stage training strategy: First, we employ maximum likelihood estimation to learn the latent representations from both PTA and ATA configurations. Subsequently, we optimize the KL divergence to identify and learn the shared latent variables. Through theoretical guarantee and empirical validations, we establish that identifying and learning these shared representations can effectively mitigate catastrophic interference in machine learning systems. Our approach provides both theoretical guarantees and practical performance improvements across both synthetic and benchmark datasets.
title Understanding Catastrophic Interference: On the Identifibility of Latent Representations
topic Machine Learning
url https://arxiv.org/abs/2509.23027