Unsupervised Visual Representation Learning via Mutual Information Regularized Assignment

11/04/2022
by   Dong Hoon Lee, et al.
0

This paper proposes Mutual Information Regularized Assignment (MIRA), a pseudo-labeling algorithm for unsupervised representation learning inspired by information maximization. We formulate online pseudo-labeling as an optimization problem to find pseudo-labels that maximize the mutual information between the label and data while being close to a given model probability. We derive a fixed-point iteration method and prove its convergence to the optimal solution. In contrast to baselines, MIRA combined with pseudo-label prediction enables a simple yet effective clustering-based representation learning without incorporating extra training techniques or artificial constraints such as sampling strategy, equipartition constraints, etc. With relatively small training epochs, representation learned by MIRA achieves state-of-the-art performance on various downstream tasks, including the linear/k-NN evaluation and transfer learning. Especially, with only 400 epochs, our method applied to ImageNet dataset with ResNet-50 architecture achieves 75.6 accuracy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/28/2019

Wasserstein Dependency Measure for Representation Learning

Mutual information maximization has emerged as a powerful learning objec...
research
06/04/2020

Info3D: Representation Learning on 3D Objects using Mutual Information Maximization and Contrastive Learning

A major endeavor of computer vision is to represent, understand and extr...
research
02/20/2020

Neural Bayes: A Generic Parameterization Method for Unsupervised Representation Learning

We introduce a parameterization method called Neural Bayes which allows ...
research
03/23/2021

Group-aware Label Transfer for Domain Adaptive Person Re-identification

Unsupervised Domain Adaptive (UDA) person re-identification (ReID) aims ...
research
05/28/2023

Decoupling Pseudo Label Disambiguation and Representation Learning for Generalized Intent Discovery

Generalized intent discovery aims to extend a closed-set in-domain inten...
research
04/04/2023

Algorithm-Dependent Bounds for Representation Learning of Multi-Source Domain Adaptation

We use information-theoretic tools to derive a novel analysis of Multi-s...
research
02/05/2023

Deep Graph-Level Clustering Using Pseudo-Label-Guided Mutual Information Maximization Network

In this work, we study the problem of partitioning a set of graphs into ...

Please sign up or login with your details

Forgot password? Click here to reset