mlsanityData to 14 Oct 2026

An Optimal Transport-driven Approach for Cultivating Latent Space in Online Incremental Learning

arXiv 2211.16780 ↗First posted 30 Nov 2022cs.LG cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

In online incremental learning, data continuously arrives with substantial distributional shifts, creating a significant challenge because previous samples have limited replay value when learning a new task. Prior research has typically relied on either a single adaptive centroid or multiple fixed centroids to represent each class in the latent space. However, such methods struggle when class data streams are inherently multimodal and require continual centroid updates. To overcome this, we introduce an online Mixture Model learning framework grounded in Optimal Transport theory (MMOT), where centroids evolve incrementally with new data. This approach offers two main advantages: (i) it provides a more precise characterization of complex data streams, and (ii) it enables improved class similarity estimation for unseen samples during inference through MMOT-derived centroids. Furthermore, to strengthen representation learning and mitigate catastrophic forgetting, we design a Dynamic Preservation strategy that regulates the latent space and maintains class separability over time. Experimental evaluations on benchmark datasets confirm the superior effectiveness of our proposed method.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 28 of its 68 references that are in the map. First posted on arXiv 30 Nov 2022.

Builds on

28 of 68 references.

References · 28

  1. 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,852
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  3. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  4. 2016Progressive Neural Networkscited by 1,361
  5. 2017Continual Learning with Deep Generative Replaycited by 1,158
  6. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  7. 2018Experience Replay for Continual Learningcited by 1,095
  8. 2018Efficient Lifelong Learning with A-GEMcited by 1,058
  9. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
  10. 2021Co2L: Contrastive Continual Learningcited by 244
  11. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 189
  12. 2019Continual Unsupervised Representation Learningcited by 147
16 more
  1. 2020Continual Prototype Evolution: Learning Online from Non-Stationary Data Streamscited by 144
  2. 2019Multimodal End-to-End Autonomous Drivingcited by 110
  3. 2021On Learning the Geodesic Path for Incremental Learningcited by 85
  4. 2019A Wasserstein-type distance in the space of Gaussian Mixture Modelscited by 75
  5. 2017Sliced Wasserstein Distance for Learning Gaussian Mixture Modelscited by 59
  6. 2020Generalized Variational Continual Learningcited by 56
  7. 2017Optimal transport for Gaussian mixture modelscited by 45
  8. 2018Life-Long Disentangled Representation Learning with Cross-Domain Latent Homologiescited by 43
  9. 2021Co-Transport for Class-Incremental Learningcited by 38
  10. 2020Learning latent representations across multiple data domains using Lifelong VAEGANcited by 35
  11. 2021Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descentcited by 32
  12. 2019BooVAE: Boosting Approach for Continual Learning of VAEcited by 18
  13. 2022Continual Variational Autoencoder Learning via Online Cooperative Memorizationcited by 12
  14. 2015A Fast Incremental Gaussian Mixture Modelcited by 8
  15. 2021Continual Learning of Generative Models with Limited Data: From Wasserstein-1 Barycenter to Adaptive Coalescencecited by 2
  16. 2021From Implicit to Explicit feedback: A deep neural network for modeling sequential behaviours and long-short term preferences of online userscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.