{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/information-maximization-clustering-via-multi","title":"Information Maximization Clustering via Multi-View Self-Labelling","arxiv_id":"2103.07368","date":"2021-03-12","proceeding":null,"authors":["Foivos Ntelemis","Yaochu Jin","Spencer A. Thomas"],"abstract":"Image clustering is a particularly challenging computer vision task, which aims to generate annotations without human supervision. Recent advances focus on the use of self-supervised learning strategies in image clustering, by first learning valuable semantics and then clustering the image representations. These multiple-phase algorithms, however, increase the computational time and their final performance is reliant on the first stage. By extending the self-supervised approach, we propose a novel single-phase clustering method that simultaneously learns meaningful representations and assigns the corresponding annotations. This is achieved by integrating a discrete representation into the self-supervised paradigm through a classifier net. Specifically, the proposed clustering objective employs mutual information, and maximizes the dependency between the integrated discrete representation and a discrete probability distribution. The discrete probability distribution is derived though the self-supervised process by comparing the learnt latent representation with a set of trainable prototypes. To enhance the learning performance of the classifier, we jointly apply the mutual information across multi-crop views. Our empirical results show that the proposed framework outperforms state-of-the-art techniques with the average accuracy of 89.1% and 49.0%, respectively, on CIFAR-10 and CIFAR-100/20 datasets. Finally, the proposed method also demonstrates attractive robustness to parameter settings, making it ready to be applicable to other datasets.","url_abs":"https://arxiv.org/abs/2103.07368v2","url_pdf":"https://arxiv.org/pdf/2103.07368v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"information-maximization-clustering-via-multi","repo_url":"https://github.com/foiv0s/imc-swav-pub","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"image-clustering","task_name":"Image Clustering"},{"task_slug":"self-supervised-learning","task_name":"Self-Supervised Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-clustering-on-cifar-10","task":"Image Clustering","dataset":"CIFAR-10","model":"IMC-SwAV (Best)","rank_in_archive_order":14,"of":40,"metrics":{"ARI":"0.8","Accuracy":"0.897","Backbone":"ResNet-18","NMI":"0.818","Train set":"Train"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-cifar-10","task":"Image Clustering","dataset":"CIFAR-10","model":"IMC-SwAV (Avg+-)","rank_in_archive_order":15,"of":40,"metrics":{"ARI":"0.79","Accuracy":"0.891","Backbone":"ResNet-18","NMI":"0.811","Train set":"Train"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-cifar-100","task":"Image Clustering","dataset":"CIFAR-100","model":"IMC-SwAV (Best)","rank_in_archive_order":12,"of":30,"metrics":{"ARI":"0.361","Accuracy":"0.519","NMI":"0.527","Train Set":"Train"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-cifar-100","task":"Image Clustering","dataset":"CIFAR-100","model":"IMC-SwAV (Avg+-)","rank_in_archive_order":14,"of":30,"metrics":{"ARI":"0.337","Accuracy":"0.49","NMI":"0.503"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-stl-10","task":"Image Clustering","dataset":"STL-10","model":"IMC-SwAV (Best)","rank_in_archive_order":10,"of":29,"metrics":{"ARI":"0.716","Accuracy":"0.853","Backbone":"ResNet-18","NMI":"0.747","Train Split":"Train"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-stl-10","task":"Image Clustering","dataset":"STL-10","model":"IMC-SwAV (Avg+-)","rank_in_archive_order":13,"of":29,"metrics":{"ARI":"0.685","Accuracy":"0.831","Backbone":"ResNet-18","NMI":"0.729","Train Split":"Train"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-tiny-imagenet","task":"Image Clustering","dataset":"Tiny-ImageNet","model":"IMC-SwAV (Best)","rank_in_archive_order":4,"of":14,"metrics":{"ARI":"0.146","Accuracy":"0.282","NMI":"0.526"},"uses_additional_data":false},{"leaderboard":"/sota/image-clustering-on-tiny-imagenet","task":"Image Clustering","dataset":"Tiny-ImageNet","model":"IMC-SwAV (Avg+-)","rank_in_archive_order":5,"of":14,"metrics":{"ARI":"0.143","Accuracy":"0.279","NMI":"0.485"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"foiv0s/imc-swav-pub","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"3bf333205294fb1d758c5b00f98b6711887ef04004ced51203687c0b925679db","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}