{"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/the-hidden-uniform-cluster-prior-in-self","title":"The Hidden Uniform Cluster Prior in Self-Supervised Learning","arxiv_id":"2210.07277","date":"2022-10-13","proceeding":null,"authors":["Mahmoud Assran","Randall Balestriero","Quentin Duval","Florian Bordes","Ishan Misra","Piotr Bojanowski","Pascal Vincent","Michael Rabbat","Nicolas Ballas"],"abstract":"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.","url_abs":"https://arxiv.org/abs/2210.07277v1","url_pdf":"https://arxiv.org/pdf/2210.07277v1.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":"the-hidden-uniform-cluster-prior-in-self","repo_url":"https://github.com/lightly-ai/lightly","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"self-supervised-learning","task_name":"Self-Supervised Learning"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"average-pooling","method_name":"Average Pooling"},{"method_slug":"batch-normalization","method_name":"Batch Normalization"},{"method_slug":"bottleneck-residual-block","method_name":"Bottleneck Residual Block"},{"method_slug":"colorjitter","method_name":"ColorJitter"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"feedforward-network","method_name":"Feedforward Network"},{"method_slug":"global-average-pooling","method_name":"Global Average Pooling"},{"method_slug":"kaiming-initialization","method_name":"Kaiming Initialization"},{"method_slug":"lars","method_name":"LARS"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"nt-xent","method_name":"NT-Xent"},{"method_slug":"random-gaussian-blur","method_name":"Random Gaussian Blur"},{"method_slug":"random-resized-crop","method_name":"Random Resized Crop"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-block","method_name":"Residual Block"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"simclr","method_name":"SimCLR"},{"method_slug":"swav","method_name":"SwAV"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2210.07277","atlas_url":"https://app.syntology.ai/?focus=2210.07277","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2210.07277"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2210.07277\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2210.07277"},"call":"get_concepts_for_paper(arxiv_id=\"2210.07277\")"}],"by_repo":[{"repo":"lightly-ai/lightly","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":11,"harvested_for":["1911.05722","2002.05709","2006.09882","2011.10566","2103.03230","2104.14548","2105.04906","2204.07141","2207.06167","2210.01571","2301.08243"],"harvested_for_calls":[{"arxiv_id":"1911.05722","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1911.05722"},"call":"get_harvested_code_for_paper(arxiv_id=\"1911.05722\")"},{"arxiv_id":"2002.05709","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2002.05709"},"call":"get_harvested_code_for_paper(arxiv_id=\"2002.05709\")"},{"arxiv_id":"2006.09882","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.09882"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.09882\")"},{"arxiv_id":"2011.10566","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2011.10566"},"call":"get_harvested_code_for_paper(arxiv_id=\"2011.10566\")"},{"arxiv_id":"2103.03230","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.03230"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.03230\")"},{"arxiv_id":"2104.14548","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.14548"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.14548\")"},{"arxiv_id":"2105.04906","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.04906"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.04906\")"},{"arxiv_id":"2204.07141","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.07141"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.07141\")"},{"arxiv_id":"2207.06167","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2207.06167"},"call":"get_harvested_code_for_paper(arxiv_id=\"2207.06167\")"},{"arxiv_id":"2210.01571","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.01571"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.01571\")"},{"arxiv_id":"2301.08243","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2301.08243"},"call":"get_harvested_code_for_paper(arxiv_id=\"2301.08243\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"5ed889a3451282b8ebdb9c637bd75b0e16e78a0380b5d417228a072d67fab279","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}