Papers › Invariant Information Clustering for Unsupervised Image Classification and Segmentation

Invariant Information Clustering for Unsupervised Image Classification and Segmentation

17 Jul 2018ICCV 2019 10arXiv:1807.06653archive 2025-07-28

Xu Ji, João F. Henriques, Andrea Vedaldi

We present a novel clustering objective that learns a neural network classifier from scratch, given only unlabelled data samples. The model discovers clusters that accurately match semantic classes, achieving state-of-the-art results in eight unsupervised clustering benchmarks spanning image classification and segmentation. These include STL10, an unsupervised variant of ImageNet, and CIFAR10, where we significantly beat the accuracy of our closest competitors by 6.6 and 9.5 absolute percentage points respectively. The method is not specialised to computer vision and operates on any paired dataset samples; in our experiments we use random transforms to obtain a pair from each image. The trained network directly outputs semantic labels, rather than high dimensional representations that need external processing to be usable for semantic clustering. The objective is simply to maximise mutual information between the class assignments of each pair. It is easy to implement and rigorously grounded in information theory, meaning we effortlessly avoid degenerate solutions that other clustering methods are susceptible to. In addition to the fully unsupervised mode, we also test two semi-supervised settings. The first achieves 88.8% accuracy on STL10 classification, setting a new global state-of-the-art over all existing methods (whether supervised, semi-supervised or unsupervised). The second shows robustness to 90% reductions in label coverage, of relevance to applications that wish to make use of small amounts of labels. github.com/xu-ji/IIC

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1807.06653")

Code

Syntology Ran 2 of 18 code samples harvested from 4 repositories linked to this paper; 16 have no recorded run. Of those that ran: 2 ran · our draft was wrong.

By repository: official repository: 2 samples from 1 repository, 2 ran; community (archive-listed): 16 samples from 3 repositories, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

xu-ji/IIC officialmentioned in papermentioned on GitHubpytorch report
ThmCuong/IIC-alter mentioned on GitHubtf report
astirn/IIC mentioned on GitHubtfMIT report
nathanin/IIC mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

18 samples harvested; 2 ran; 0 honoured the contract we drafted; 16 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · our draft was wrong
16unverified

Licence: 0 of the 18 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 4 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

IID_loss xu-ji/IIC/code/utils/cluster/IID_losses.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · b2399f01716e7765 · report
compute_joint xu-ji/IIC/code/utils/cluster/IID_losses.py official repository ran · our draft was wrong fingerprinted MIT (permissive) · 76deff4b3537c768 · report
IID_alpha_plus_loss willi-menapace/acids-clustering-domain-shift/codebase/utils/cluster/IID_losses.py community (archive-listed) unverified MIT (permissive) · d9b2528f3dc09ca2 · report
IID_loss nathanin/IIC/tensorflow/IID_losses.py community (archive-listed) unverified MIT (permissive) · eafc9f12c5ea5696 · report
IID_loss nathanin/IIC/tensorflow/IID_losses_tf.py community (archive-listed) unverified MIT (permissive) · aeaf2fa6a05b6904 · report
IID_plus_loss willi-menapace/acids-clustering-domain-shift/codebase/utils/cluster/IID_losses.py community (archive-listed) unverified MIT (permissive) · 1217b85cf4046007 · report
compute_cluster_confusion_matrix willi-menapace/acids-clustering-domain-shift/codebase/utils/cluster/cluster_eval.py community (archive-listed) unverified MIT (permissive) · 66416b36a224f011 · report
convex_combo nathanin/IIC/tensorflow/mnist_draw.py community (archive-listed) unverified MIT (permissive) · 7c744f563f3b9f6c · report
convolution_layer astirn/IIC/graphs.py community (archive-listed) unverified MIT (permissive) · 1d13a626952e713c · report
fully_connected_layer astirn/IIC/graphs.py community (archive-listed) unverified MIT (permissive) · 839dfd8e8303304d · report
genclust nathanin/IIC/tensorflow/generate_clusterings.py community (archive-listed) unverified MIT (permissive) · d17d2c856e1674fc · report
get_iterator nathanin/IIC/tensorflow/data.py community (archive-listed) unverified MIT (permissive) · 95b736abab569c08 · report
get_subhead_using_loss willi-menapace/acids-clustering-domain-shift/codebase/utils/cluster/cluster_eval.py community (archive-listed) unverified MIT (permissive) · 99bb4dfc8b575f7e · report
max_pooling_layer astirn/IIC/graphs.py community (archive-listed) unverified MIT (permissive) · d73cf3ab592ee3f1 · report
mnist_gx astirn/IIC/data.py community (archive-listed) unverified MIT (permissive) · c7ef0b467f726ba3 · report
mnist_x astirn/IIC/data.py community (archive-listed) unverified MIT (permissive) · b8622cc70f86e3ba · report
pre_process_data astirn/IIC/data.py community (archive-listed) unverified MIT (permissive) · 7bd08b02a79cc9c7 · report
unsupervised_labels astirn/IIC/utils.py community (archive-listed) unverified MIT (permissive) · 9ce81c4ed4d32382 · report

Tasks

ClusteringGeneral ClassificationImage ClassificationImage ClusteringSemantic SegmentationUnsupervised Image ClassificationUnsupervised MNISTUnsupervised Semantic Segmentationimage-classification

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Image Classification STL-10 IIC Percentage correct 88.8 #41 of 117 Archive leaderboard report
Image Clustering CIFAR-10 IIC ARI 0.411 #32 of 40 Archive leaderboard report
Image Clustering CIFAR-10 IIC Accuracy 0.617 #32 of 40 Archive leaderboard report
Image Clustering CIFAR-10 IIC Backbone ResNet-34 #32 of 40 Archive leaderboard report
Image Clustering CIFAR-10 IIC NMI 0.511 #32 of 40 Archive leaderboard report
Image Clustering CIFAR-10 IIC Train set Train+Test #32 of 40 Archive leaderboard report
Semi-Supervised Image Classification STL-10 IIC Accuracy 88.8 #2 of 3 Archive leaderboard report
Unsupervised Image Classification CIFAR-10 IIC Accuracy 61.7 #8 of 9 Archive leaderboard report
Unsupervised Image Classification CIFAR-20 IIC Accuracy 25.7 #14 of 14 Archive leaderboard report
Unsupervised Image Classification MNIST IIC Accuracy 99.3 #1 of 10 Archive leaderboard report
Unsupervised Image Classification STL-10 IIC Accuracy 61.00 #8 of 9 Archive leaderboard report
Unsupervised Semantic Segmentation COCO-Stuff-15 IIC Pixel Accuracy 27.7 #3 of 3 Archive leaderboard report
Unsupervised Semantic Segmentation COCO-Stuff-171 IIC (ResNet-50) Pixel Accuracy 15.7 #4 of 4 Archive leaderboard report
Unsupervised Semantic Segmentation COCO-Stuff-171 IIC (ResNet-50) mIoU 2.2 #4 of 4 Archive leaderboard report
Unsupervised Semantic Segmentation COCO-Stuff-27 IIC Clustering [Accuracy] 21.8 #27 of 29 Archive leaderboard report
Unsupervised Semantic Segmentation COCO-Stuff-3 IIC Pixel Accuracy 72.3 #6 of 6 Archive leaderboard report
Unsupervised Semantic Segmentation Potsdam-3 IIC Accuracy 45.4 #7 of 8 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections