Learning Representations on the Unit Sphere: Investigating Angular Gaussian and Von Mises-Fisher Distributions for Online Continual Learning
Nicolas Michel, Giovanni Chierchia, Romain Negrel, Jean-François Bercher
Abstract
We use the maximum a posteriori estimation principle for learning representations distributed on the unit sphere. We propose to use the angular Gaussian distribution, which corresponds to a Gaussian projected on the unit-sphere and derive the associated loss function. We also consider the von Mises-Fisher distribution, which is the conditional of a Gaussian in the unit-sphere. The learned representations are pushed toward fixed directions, which are the prior means of the Gaussians; allowing for a learning strategy that is resilient to data drift. This makes it suitable for online continual learning, which is the problem of training neural networks on a continuous data stream, where multiple classification tasks are presented sequentially so that data from past tasks are no longer accessible, and data from the current task can be seen only once. To address this challenging scenario, we propose a memory-based representation learning technique equipped with our new loss functions. Our approach does not require negative data or knowledge of task boundaries and performs well with smaller batch sizes while being computationally efficient. We demonstrate with extensive experiments that the proposed method outperforms the current state-of-the-art methods on both standard evaluation scenarios and realistic scenarios with blurry task boundaries. For reproducibility, we use the same training pipeline for every compared method and share the code at https://github.com/Nicolas1203/ocl-fd .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 92723b4b-1bc3-4022-bc08-9d63af435570Cited by top-tier papers3
- Rethinking Momentum Knowledge Distillation in Online Continual LearningNicolas Michel, Maorong Wang, Ling Xiao, Toshihiko YamasakiICML 2024 · 26 citations
- Distribution Guidance Network for Weakly Supervised Point Cloud Semantic SegmentationZhiyi Pan, Wei Gao, Shan Liu, Ge LiNeurIPS 2024 · 7 citations
- Beyond Distributions: Geometric Action Control for Continuous Reinforcement LearningZhihao LinICLR 2026 · 1 citation
Builds on16
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- Bootstrap Your Own Latent - A New Approach to Self-Supervised LearningJean-Bastien Grill, Florian Strub, Florent Altché, Corentin Tallec et al.NeurIPS 2020 · 9,171 citations
- Supervised Contrastive LearningPrannay Khosla, Piotr Teterwak, Chen Wang, Aaron Sarna et al.NeurIPS 2020 · 7,049 citations
- Barlow Twins: Self-Supervised Learning via Redundancy ReductionJure Zbontar, Li Jing, Ishan Misra, Yann LeCun et al.ICML 2021 · 2,942 citations
- Understanding Contrastive Representation Learning through Alignment and Uniformity on the HypersphereTongzhou Wang, Phillip IsolaICML 2020 · 2,360 citations
Related papers
- Online Boundary-Free Continual Learning by Scheduled Data PriorHyunseo Koh, Minhyuk Seo, Jihwan Bang, Hwanjun Song et al.ICLR 2023
- Kalman Filter for Online Classification of Non-Stationary DataMichalis K. Titsias, Alexandre Galashov, Amal Rannen-Triki, Razvan Pascanu et al.ICLR 2024 · 14 citations
- Continual Learning with Bayesian Neural Networks for Non-Stationary DataRichard Kurle, Botond Cseke, Alexej Klushyn, Patrick van der Smagt et al.ICLR 2020 · 82 citations
- General Incremental Learning with Domain-aware Categorical RepresentationsJiangwei Xie, Shipeng Yan, Xuming HeCVPR 2022 · 37 citations
- Improving Task-free Continual Learning by Distributionally Robust Memory EvolutionZhenyi Wang, Li Shen, Le Fang, Qiuling Suo et al.ICML 2022 · 52 citations
