mlsanityData to 14 Oct 2026

Approximate Bayesian Class-Conditional Models under Continuous Representation Shift

arXiv 2305.19076 ↗First posted 30 May 2023cs.LG stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

For models consisting of a classifier in some representation space, learning online from a non-stationary data stream often necessitates changes in the representation. So, the question arises of what is the best way to adapt the classifier to shifts in representation. Current methods only slowly change the classifier to representation shift, introducing noise into learning as the classifier is misaligned to the representation. We propose DeepCCG, an empirical Bayesian approach to solve this problem. DeepCCG works by updating the posterior of a class conditional Gaussian classifier such that the classifier adapts in one step to representation shift. The use of a class conditional Gaussian classifier also enables DeepCCG to use a log conditional marginal likelihood loss to update the representation. To perform the update to the classifier and representation, DeepCCG maintains a fixed number of examples in memory and so a key part of DeepCCG is selecting what examples to store, choosing the subset that minimises the KL divergence between the true posterior and the posterior induced by the subset. We explore the behaviour of DeepCCG in online continual learning (CL), demonstrating that it performs well against a spectrum of online CL methods and that it reduces the change in performance due to representation shift.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 28 of its 48 references that are in the map. First posted on arXiv 30 May 2023.

Builds on

28 of 48 references.

References · 28

  1. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  3. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  4. 2016Matching Networks for One Shot Learningcited by 2,255
  5. 2016Instance Normalization: The Missing Ingredient for Fast Stylizationcited by 1,198
  6. 2018Efficient Lifelong Learning with A-GEMcited by 1,058
  7. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
  8. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
  9. 2019Three scenarios for continual learningcited by 614
  10. 2019Gradient based sample selection for online continual learningcited by 571
  11. 2019Online Continual Learning with Maximally Interfered Retrievalcited by 379
  12. 2019Orthogonal Gradient Descent for Continual Learningcited by 369
16 more
  1. 2017Variational Continual Learningcited by 339
  2. 2021Rainbow Memory: Continual Learning with a Memory of Diverse Samplescited by 273
  3. 2020Understanding the Role of Training Regimes in Continual Learningcited by 180
  4. 2018Towards Robust Evaluations of Continual Learningcited by 148
  5. 2019Continual Unsupervised Representation Learningcited by 147
  6. 2020Continual Learning in Low-rank Orthogonal Subspacescited by 99
  7. 2019Lifelong Machine Learning with Deep Streaming Linear Discriminant Analysiscited by 92
  8. 2018Task Agnostic Continual Learning Using Online Variational Bayescited by 61
  9. 2022Bayesian Model Selection, the Marginal Likelihood, and Generalizationcited by 57
  10. 2017On Quadratic Penalties in Elastic Weight Consolidationcited by 55
  11. 2021Posterior Meta-Replay for Continual Learningcited by 45
  12. 2022Information-theoretic Online Memory Selection for Continual Learningcited by 42
  13. 2019A Unifying Bayesian View of Continual Learningcited by 38
  14. 2023Error Sensitivity Modulation based Experience Replay: Mitigating Abrupt Representation Drift in Continual Learningcited by 27
  15. 2020Defining Benchmarks for Continual Few-Shot Learningcited by 21
  16. 2023On Sequential Bayesian Inference for Continual Learningcited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 2.

5 papers.