Representation Learning via Consistent Assignment of Views to Clusters
원문 초록
We introduce Consistent Assignment for Representation Learning (CARL), an unsupervised learning method to learn visual representations by combining ideas from self-supervised contrastive learning and deep clustering. By viewing contrastive learning from a clustering perspective, CARL learns unsupervised representations by learning a set of general prototypes that serve as energy anchors to enforce different views of a given image to be assigned to the same prototype. Unlike contemporary work on contrastive learning with deep clustering, CARL proposes to learn the set of general prototypes in an online fashion, using gradient descent without the necessity of using non-differentiable algorithms or K-Means to solve the cluster assignment problem. CARL surpasses its competitors in many representations learning benchmarks, including linear evaluation, semi-supervised learning, and transfer learning.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Structural-Spectral Graph Convolution with Evidential Edge Learning for Hyperspectral Image Clustering
Contrastive Self-Supervised Learning As Neural Manifold Packing
Unsupervised Deep Clustering of MNIST with Triplet-Enhanced Convolutional Autoencoders
Robust Variational Contrastive Learning for Partially View-unaligned Clustering
Robust Diversified Graph Contrastive Network for Incomplete Multi-view Clustering
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.