paper-with-me

Papers

The Hidden Uniform Cluster Prior in Self-Supervised Learning

2022-10-13 · Mahmoud Assran, Randall Balestriero, Quentin Duval, Florian Bordes, Ishan Misra, Piotr Bojanowski, Pascal Vincent, Michael Rabbat, Nicolas Ballas

A successful paradigm in representation learning is to perform self-supervised pretraining using tasks based on mini-batch statistics (e.g., SimCLR, VICReg, SwAV, MSN). We show that in the formulation of all these methods is an overlooked prior to learn features that enable uniform clustering of the data. While this prior has led to remarkably semantic representations when pretraining on class-balanced data, such as ImageNet, we demonstrate that it can hamper performance when pretraining on class-imbalanced data. By moving away from conventional uniformity priors and instead preferring power-law distributed feature clusters, we show that one can improve the quality of the learned representations on real-world class-imbalanced datasets. To demonstrate this, we develop an extension of the Masked Siamese Networks (MSN) method to support the use of arbitrary features priors.

📄 PDF Abstract BibTeX arXiv:2210.07277

Code (1)

lightly-ai/lightly pytorch

Tasks

ClusteringRepresentation LearningSelf-Supervised Learning

Methods 이 논문이 사용한 방법론

ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…
Batch Normalization 설명 없음
Residual Connection 설명 없음
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Residual Block Residual Blocks are skip-connection blocks that learn residual functions with reference to the layer inputs, instead of learning unreferenced functions. They were introduced…
Kaiming Initialization 설명 없음
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…

Similar Papers 제목 키워드 기반

Improving ClusterGAN Using Self-Augmented Information Maximization of Disentangling Latent Spaces

2021-07-27 · Tanmoy Dam, Sreenatha G. Anavatti, Hussein A. Abbass

Since their introduction in the last few years, conditional generative models have seen remarkable achievements. However, they often need the use of large amounts of labelled information. By using unsupervised conditiona…

Clustering

PREDICT & CLUSTER: Unsupervised Skeleton Based Action Recognition

2019-11-27 · CVPR 2020 6 · Kun Su, Xiulong Liu, Eli Shlizerman

We propose a novel system for unsupervised skeleton-based action recognition. Given inputs of body keypoints sequences obtained during various movements, our system associates the sequences with actions. Our system is ba…

Action RecognitionDecoderSelf-Supervised Human Action RecognitionSelf-supervised Skeleton-based Action Recognition+2

HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units

2021-06-14 · Wei-Ning Hsu, Benjamin Bolte, Yao-Hung Hubert Tsai, Kushal Lakhotia 외

Self-supervised approaches for speech representation learning are challenged by three unique problems: (1) there are multiple sound units in each input utterance, (2) there is no lexicon of input sound units during the p…

ClusteringLanguage ModellingRepresentation LearningSpeech Recognition+1

A deep matrix factorization method for learning attribute representations

2015-09-10 · George Trigeorgis, Konstantinos Bousmalis, Stefanos Zafeiriou, Bjoern W. Schuller

Semi-Non-negative Matrix Factorization is a technique that learns a low-dimensional representation of a dataset that lends itself to a clustering interpretation. It is possible that the mapping between this new represent…

AttributeClustering

THESAURUS: Contrastive Graph Clustering by Swapping Fused Gromov-Wasserstein Couplings

2024-12-16 · Bowen Deng, Tong Wang, Lele Fu, Sheng Huang 외

Graph node clustering is a fundamental unsupervised task. Existing methods typically train an encoder through selfsupervised learning and then apply K-means to the encoder output. Some methods use this clustering result …

ClusteringGraph ClusteringNode Clustering