Pith. sign in

REVIEW 1 cited by

A Unifying Bayesian View of Continual Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.06494 v1 pith:2ZIVBJS4 submitted 2019-02-18 stat.ML cs.LG

classification stat.MLcs.LG
keywords learningcontinualbayesianposteriorapproachesapproximateapproximationsinstead
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Some machine learning applications require continual learning - where data comes in a sequence of datasets, each is used for training and then permanently discarded. From a Bayesian perspective, continual learning seems straightforward: Given the model posterior one would simply use this as the prior for the next task. However, exact posterior evaluation is intractable with many models, especially with Bayesian neural networks (BNNs). Instead, posterior approximations are often sought. Unfortunately, when posterior approximations are used, prior-focused approaches do not succeed in evaluations designed to capture properties of realistic continual learning use cases. As an alternative to prior-focused methods, we introduce a new approximate Bayesian derivation of the continual learning loss. Our loss does not rely on the posterior from earlier tasks, and instead adapts the model itself by changing the likelihood term. We call these approaches likelihood-focused. We then combine prior- and likelihood-focused methods into one objective, tying the two views together under a single unifying framework of approximate Bayesian continual learning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Online Learning of Modular Bayesian Deep Receivers: Single-Step Adaptation with Streaming Data

    eess.SP 2025-11 conditional novelty 5.0 of 10

    A Kalman-filter-style single-step update, applied module-by-module in a deep neural receiver, can track changing wireless channels with lower latency and error than multi-epoch stochastic gradient descent.

Pith tools