Knowledge Adaptation as Posterior Correction

Mohammad Emtiyaz KhanarXiv 2025 · DOI · arXiv

Abstract

This paper introduces a unifying framework for knowledge adaptation, termed Posterior Correction. By framing diverse fields such as continual learning, unlearning, and model merging as the correction of Bayesian posteriors, the authors provide a mathematical foundation for understanding how models accommodate new data. The framework quantifies interference through natural-gradient mismatches and demonstrates that increased model flexibility leads to more efficient adaptation, potentially bridging the gap between specialized adaptation silos.

Introduction: The Challenge of Adaptability

Despite the impressive capabilities of modern large-scale models, they often lack the seamless adaptability seen in biological systems. When a model needs to learn a new task or correct an error, the standard approach is often to retrain from scratch—a "scorched earth" strategy that is computationally prohibitive.

Historically, researchers have addressed specific adaptation challenges through specialized sub-fields: Continual Learning for data streams, Federated Learning for distributed data, Unlearning for data privacy, and Model Merging for combining fine-tuned weights. However, these fields have largely operated as separate silos with distinct mathematical formulations. This work addresses this fragmentation by identifying a single fundamental mechanism—Posterior Correction—that governs all forms of machine adaptation.

The Posterior Correction Framework

The core contribution of this paper is the derivation of adaptation as a process of correcting Bayesian posteriors. Traditional adaptation methods typically minimize a loss function composed of a new data term and a regularization term that maintains proximity to the previous model state:

New Model = argmin(New Data Loss + Similarity to Old Model)

The authors demonstrate that this formulation is incomplete if the goal is to recover the "true" joint posterior (the result of training on all data simultaneously). They introduce a third, necessary component:

New Model = argmin(New Data Loss + Similarity to Old Model + Correction Term)

Key Methodological Components

  • Dual Representation: Utilizing the "Bayesian Learning Rule," models are represented not just by global parameters, but by "sites"—local surrogates that capture the influence of specific data subsets on the model.
  • Natural-Gradient Mismatch: The "Correction Term" is defined as the mismatch between old and new natural gradients. This provides a precise mathematical measure of how much existing knowledge "interferes" with new information.
  • Gaussian Hierarchy: The framework analyzes adaptation across varying levels of model flexibility. Moving from simple Isotropic Gaussians (standard fine-tuning) to Diagonal Gaussians (parameter importance) and finally Full Gaussians (complex correlations) significantly reduces the magnitude of required corrections.

Unifying Diverse Adaptation Paradigms

The Posterior Correction framework allows for the re-interpretation of various learning scenarios as specific instances of a single mathematical process.

Figure 1: Schematic representation of Continual Learning and Unlearning. In Continual Learning, parameters evolve sequentially with new data. In Unlearning, the model is adjusted to remove the influence of a specific data subset.

By applying the correction term, the authors show that:

  • Continual Learning is the sequential correction of the posterior as new data arrives.
  • Unlearning is the removal of a specific "site" or surrogate from the posterior to eliminate the influence of data $\mathcal{D}_i$.
  • Model Merging (or Task Arithmetic) can be viewed as an approximation where the correction term is ignored, explaining why simple weight addition often works but remains imperfect compared to true Bayesian arithmetic.
Figure 2: Model Merging viewed through the lens of posterior correction, where individual models fine-tuned from a common base are combined into a single merged model.

Theoretical Insights and Key Results

The paper provides several critical insights into the nature of model adaptation:

  • Adaptation as Correction: Adaptation is not merely the addition of new data; it is the active correction of "stale" approximations of existing data.
  • The Flexibility Bonus: A significant finding is that more flexible posteriors require smaller corrections. Models using full covariance matrices naturally exhibit less interference with new tasks because they capture the intricate relationships between parameters.
  • Mathematical Definition of Interference: For years, "catastrophic forgetting" was a qualitative observation. This work provides a precise characterization of interference as the difference between "stale" and "fresh" natural gradients.
  • Exact Recovery: The authors prove that including the correction term allows for the exact recovery of the joint posterior through sequential adaptation steps, effectively bridging optimization and Bayesian inference.

Conclusion and Future Directions

While the Posterior Correction framework provides a powerful theoretical unification, practical implementation challenges remain. The computational cost of "Full Gaussian" posteriors is high for massive neural networks, necessitating the development of efficient approximations. Furthermore, while the framework explains how to correct, it does not yet prescribe what a model should prioritize remembering or which new experiences are most beneficial for efficient learning. Future research will focus on scaling these correction terms to billion-parameter models to potentially replace expensive full-model fine-tuning.

Summary updated

Abstract

Adaptation is the holy grail of intelligence, but even the best AI models lack the adaptability of toddlers. In spite of great progress, little is known about the mechanisms by which machines can learn to adapt as fast as humans and animals. Here, we cast adaptation as `correction' of old posteriors and show that a wide-variety of existing adaptation methods follow this very principle, including those used for continual learning, federated learning, unlearning, and model merging. In all these settings, more accurate posteriors often lead to smaller corrections and can enable faster adaptation. Posterior correction is derived by using the dual representation of the Bayesian Learning Rule of Khan and Rue (2023), where the interference between the old representation and new information is quantified by using the natural-gradient mismatch. We present many examples demonstrating how machines can learn to adapt quickly by using posterior correction.
BibTeX
@misc{khan2025knowledge,
  author = {Mohammad Emtiyaz Khan},
  title = {{Knowledge Adaptation as Posterior Correction}},
  year = {2025},
  eprint = {2506.14262},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2506.14262},
}
Figure