{"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/iterative-reorganization-with-weak-spatial","title":"Iterative Reorganization with Weak Spatial Constraints: Solving Arbitrary Jigsaw Puzzles for Unsupervised Representation Learning","arxiv_id":"1812.00329","date":"2018-12-02","proceeding":"CVPR 2019 6","authors":["Chen Wei","Lingxi Xie","Xutong Ren","Yingda Xia","Chi Su","Jiaying Liu","Qi Tian","Alan L. Yuille"],"abstract":"Learning visual features from unlabeled image data is an important yet\nchallenging task, which is often achieved by training a model on some\nannotation-free information. We consider spatial contexts, for which we solve\nso-called jigsaw puzzles, i.e., each image is cut into grids and then\ndisordered, and the goal is to recover the correct configuration. Existing\napproaches formulated it as a classification task by defining a fixed mapping\nfrom a small subset of configurations to a class set, but these approaches\nignore the underlying relationship between different configurations and also\nlimit their application to more complex scenarios. This paper presents a novel\napproach which applies to jigsaw puzzles with an arbitrary grid size and\ndimensionality. We provide a fundamental and generalized principle, that weaker\ncues are easier to be learned in an unsupervised manner and also transfer\nbetter. In the context of puzzle recognition, we use an iterative manner which,\ninstead of solving the puzzle all at once, adjusts the order of the patches in\neach step until convergence. In each step, we combine both unary and binary\nfeatures on each patch into a cost function judging the correctness of the\ncurrent configuration. Our approach, by taking similarity between puzzles into\nconsideration, enjoys a more reasonable way of learning visual knowledge. We\nverify the effectiveness of our approach in two aspects. First, it is able to\nsolve arbitrarily complex puzzles, including high-dimensional puzzles, that\nprior methods are difficult to handle. Second, it serves as a reliable way of\nnetwork initialization, which leads to better transfer performance in a few\nvisual recognition tasks including image classification, object detection, and\nsemantic segmentation.","url_abs":"http://arxiv.org/abs/1812.00329v1","url_pdf":"http://arxiv.org/pdf/1812.00329v1.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":"iterative-reorganization-with-weak-spatial","repo_url":"https://github.com/weichen582/Unsupervised-Visual-Recognition-by-Solving-Arbitrary-Puzzles","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"},{"task_slug":"image-classification","task_name":"image-classification"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[{"method_slug":"jigsaw","method_name":"Jigsaw"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1812.00329","atlas_url":"https://app.syntology.ai/?focus=1812.00329","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":"1812.00329"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1812.00329\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1812.00329"},"call":"get_concepts_for_paper(arxiv_id=\"1812.00329\")"}],"by_repo":[{"repo":"weichen582/Unsupervised-Visual-Recognition-by-Solving-Arbitrary-Puzzles","kind":"listed","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":"3e2f86c50d37c3506259dbf8b198e7b9397961150bf1ceee0e77e728145d6e29","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}