paper-with-me

Papers

Topological Continual Learning with Wasserstein Distance and Barycenter

2022-10-06 · Tananun Songdechakraiwut, Xiaoshuang Yin, Barry D. Van Veen

Continual learning in neural networks suffers from a phenomenon called catastrophic forgetting, in which a network quickly forgets what was learned in a previous task. The human brain, however, is able to continually learn new tasks and accumulate knowledge throughout life. Neuroscience findings suggest that continual learning success in the human brain is potentially associated with its modular structure and memory consolidation mechanisms. In this paper we propose a novel topological regularization that penalizes cycle structure in a neural network during training using principled theory from persistent homology and optimal transport. The penalty encourages the network to learn modular structure during training. The penalization is based on the closed-form expressions of the Wasserstein distance and barycenter for the topological features of a 1-skeleton representation for the network. Our topological continual learning method combines the proposed regularization with a tiny episodic memory to mitigate forgetting. We demonstrate that our method is effective in both shallow and deep network architectures for multiple image classification datasets.

📄 PDF Abstract BibTeX arXiv:2210.02661

Code (0)

등록된 구현이 없습니다.

Tasks

Continual Learningimage-classificationImage Classification

Similar Papers 제목 키워드 기반

Fixed Support Tree-Sliced Wasserstein Barycenter

2021-09-08 · Yuki Takezawa, Ryoma Sato, Zornitsa Kozareva, Sujith Ravi 외

The Wasserstein barycenter has been widely studied in various fields, including natural language processing, and computer vision. However, it requires a high computational cost to solve the Wasserstein barycenter problem…

Continual Learning of Generative Models with Limited Data: From Wasserstein-1 Barycenter to Adaptive Coalescence

2021-01-22 · Mehmet Dedeoglu, Sen Lin, Zhaofeng Zhang, Junshan Zhang

Learning generative models is challenging for a network edge node with limited data and computing power. Since tasks in similar environments share model similarity, it is plausible to leverage pre-trained generative mode…

Continual LearningQuantizationTransfer Learning

Fast Topological Clustering with Wasserstein Distance

2021-11-30 · ICLR 2022 4 · Tananun Songdechakraiwut, Bryan M. Krause, Matthew I. Banks, Kirill V. Nourski 외

The topological patterns exhibited by many real-world networks motivate the development of topology-based methods for assessing the similarity of networks. However, extracting topological structure is difficult, especial…

Clustering

Tree-Wasserstein Barycenter for Large-Scale Multilevel Clustering and Scalable Bayes

2019-10-10 · Tam Le, Viet Huynh, Nhat Ho, Dinh Phung 외

We study in this paper a variant of Wasserstein barycenter problem, which we refer to as tree-Wasserstein barycenter, by leveraging a specific class of ground metrics, namely tree metrics, for Wasserstein distance. Drawi…

Clustering

Fast Computation of Wasserstein Barycenters

2013-10-16 · Marco Cuturi, Arnaud Doucet

We present new algorithms to compute the mean of a set of empirical probability measures under the optimal transport metric. This mean, known as the Wasserstein barycenter, is the measure that minimizes the sum of its Wa…

ClusteringConstrained Clustering